Entry Value
Name SURJECTIVE_FORALL_THM
Conclusion !f. (!y. ?x. f x = y) <=> (!p. (!x. p (f x)) <=> (!y. p y))
Constructive Proof Yes
Axiom 
N|A
Classical Lemmas N|A
Constructive Lemmas
  • T
  • T <=> (\p. p) = (\p. p)
  • (/\) = (\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 function-thm
    Comment Standard HOL library retrieved from OpenTheory
    Back to main package pageBack to contained package page