| Entry |
Value |
|
Name |
UNIONS_SUBSET |
|
Conclusion |
!f t. UNIONS f SUBSET t <=> (!s. s IN f ==> s SUBSET t) |
|
Constructive Proof |
Yes |
|
Axiom |
N|A |
|
Classical Lemmas |
N|A |
|
Constructive Lemmas |
T!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!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 q. (?x. p x) ==> q <=> (!x. p x ==> q)!s t. s SUBSET t <=> (!x. x IN s ==> x IN t)!s x. x IN UNIONS s <=> (?t. t IN s /\ x IN t)!s. UNIONS s = {x | ?u. u IN s /\ x IN u}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 |
