| Entry |
Value |
|
Name |
WF_UREC |
|
Conclusion |
!r. WF r
==> (!h. (!f g x. (!z. r z x ==> f z = g z) ==> h f x = h g x)
==> (!f g. (!x. f x = h f x) /\ (!x. g x = h g x) ==> f = g)) |
|
Constructive Proof |
No |
|
Axiom |
!t. t \/ ~t
(\a. a = (\b. (\c. c) = (\c. c))) (\d. (\e. d e) = d) |
|
Classical Lemmas |
!t1 t2. ~(t1 ==> t2) <=> t1 /\ ~t2!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)!r. WF r <=> (!p. (!x. (!y. r y x ==> p y) ==> p x) ==> (!x. p x)) |
|
Constructive Lemmas |
T!x y. x = y <=> y = x!x y. x = y ==> y = x!x. x = x!t1 t2. ~(t1 ==> t2) <=> t1 /\ ~t2!t1 t2. t1 /\ t2 <=> t2 /\ t1!p q. p ==> (!x. q x) <=> (!x. p ==> q 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. (?x. ~p x) <=> ~(!x. p x)!p. ~(!x. p x) <=> (?x. ~p x)!p. ~(?x. p x) <=> (!x. ~p x)!r. WF r <=> (!p. (!x. (!y. r y x ==> p y) ==> p x) ==> (!x. p x))!r. WF r <=> (!p. (?x. p x) ==> (?x. p x /\ (!y. r y x ==> ~p y)))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 |
relation-natural-thm |
|
Comment |
Standard HOL library retrieved from OpenTheory |
