Entry
Value
Name
IN_UNION
Conclusion
!s t x. x IN s UNION t <=> x IN s \/ x IN t
Constructive Proof
Yes
Axiom
N|A
Classical Lemmas
N|A
Constructive Lemmas
T
!x. x = x
!t. (!x. t) <=> t
!t. (F <=> t) <=> ~t
!t. (T <=> t) <=> t
!t. (t <=> F) <=> ~t
!t. (t <=> T) <=> t
!f y. (\x. f x) y = f y
!p a. (?x. a = x /\ p x) <=> p a
!p x. x IN GSPEC p <=> p x
!p x. x IN {y | p y} <=> p x
!s t. s UNION t = {x | x IN s \/ x IN t}
F <=> (!p. p)
T <=> (\p. p) = (\p. p)
(~) = (\p. p ==> F)
(/\) = (\p q. (\f. f p q) = (\f. f T T))
(==>) = (\p q. p /\ q <=> p)
(!) = (\p. p = (\x. T))
(?) = (\p. !q. (!x. p x ==> q) ==> q)
Contained Package
set-thm
Comment
Standard HOL library retrieved from OpenTheory
Back to main package page
Back to contained package page
