Entry |
Value |
Name |
DIFF_INTERS |
Conclusion |
!u s. u DIFF INTERS s = UNIONS {u DIFF t | t IN s} |
Constructive Proof |
No |
Axiom |
!t. t \/ ~t
(\a. a = (\b. (\c. c) = (\c. c))) (\d. (\e. d e) = d) |
Classical Lemmas |
!t. ~ ~t <=> t!t. (t <=> T) \/ (t <=> F)!p. (?x. ~p x) <=> ~(!x. p x)!p. ~(!x. p x) <=> (?x. ~p x)!p. ~(?x. p x) <=> (!x. ~p x) |
Constructive Lemmas |
T!x y. x = y <=> y = x!x y. x = y ==> y = x!x. x = x!t. (!x. t) <=> t!t. (?x. t) <=> t!t. ~ ~t <=> t!t. F /\ t <=> F!t. T /\ t <=> t!t. t /\ F <=> F!t. t /\ T <=> t!t. t /\ t <=> t!t. (F <=> t) <=> ~t!t. (T <=> t) <=> t!t. (t <=> F) <=> ~t!t. (t <=> T) <=> t!t. F ==> t <=> T!t. T ==> t <=> t!t. t ==> F <=> ~t!t. t ==> T <=> T!t. F \/ t <=> t!t. T \/ t <=> T!t. t \/ F <=> t!t. t \/ T <=> T!t. t \/ t <=> t!t. t ==> t!t. (t <=> T) \/ (t <=> F)!f y. (\x. f x) y = f y!f g. (!x. f x = g x) <=> f = g!f g. (!x. f x = g x) ==> f = g!t. (\x. t x) = t!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!p f. UNIONS {f x | p x} = {a | ?x. p x /\ a IN f x}!p. (?x. ~p x) <=> ~(!x. p x)!p. ~(!x. p x) <=> (?x. ~p x)!p. ~(?x. p x) <=> (!x. ~p x)!p f. UNIONS {f x y | p x y} = {a | ?x y. p x y /\ a IN f x y}!p f. UNIONS {f x y z | p x y z} = {a | ?x y z. p x y z /\ a IN f x y z}!s t x. x IN s DIFF t <=> x IN s /\ ~(x IN t)!s t. (!x. x IN s <=> x IN t) <=> s = t!s t. s DIFF t = {x | x IN s /\ ~(x IN t)}!s t. (!x. x IN s <=> x IN t) ==> s = t!s x. x IN INTERS s <=> (!t. t IN s ==> x IN t)!s x. x IN UNIONS s <=> (?t. t IN s /\ x IN t)!s. INTERS s = {x | !u. u IN s ==> x IN u}!s. UNIONS s = {x | ?u. u IN s /\ x IN u}F <=> (!p. p)T <=> (\p. p) = (\p. p)~F <=> T~T <=> F(~) = (\p. p ==> F)(/\) = (\p q. (\f. f p q) = (\f. f T T))(==>) = (\p q. p /\ q <=> p)(\/) = (\p q. !r. (p ==> r) ==> (q ==> r) ==> r)(!) = (\p. p = (\x. T))(?) = (\p. !q. (!x. p x ==> q) ==> q) |
Contained Package |
set-thm |
Comment |
Standard HOL library retrieved from OpenTheory |