| Entry |
Value |
|
Name |
SUBSET_ANTISYM_EQ |
|
Conclusion |
!s t. s SUBSET t /\ t SUBSET s <=> s = t |
|
Constructive Proof |
Yes |
|
Axiom |
(\a. a = (\b. (\c. c) = (\c. c))) (\d. (\e. d e) = d) |
|
Classical Lemmas |
N|A |
|
Constructive Lemmas |
T!x y. x = y <=> y = x!x y. x = y ==> y = x!x. x = x!t. (!x. 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. t ==> t!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!s t. (!x. x IN s <=> x IN t) <=> s = t!s t. s SUBSET t <=> (!x. x IN s ==> x IN t)!s t. (!x. x IN s <=> x IN t) ==> s = t!s t. s SUBSET t /\ t SUBSET s ==> s = t!s. s SUBSET sF <=> (!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)) |
|
Contained Package |
set-thm |
|
Comment |
Standard HOL library retrieved from OpenTheory |
