Entry
Value
Name
case_sum_id
Conclusion
!x. case_sum INL INR x = x
Constructive Proof
Yes
Axiom
N|A
Classical Lemmas
N|A
Constructive Lemmas
T
!x. x = x
!f g a. case_sum f g (INL a) = f a
!f g b. case_sum f g (INR b) = g b
!p. (!a. p (INL a)) /\ (!b. p (INR b)) ==> (!x. p x)
!x. (?a. x = INL a) \/ (?b. x = INR b)
T <=> (\p. p) = (\p. p)
(/\) = (\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
sum-thm
Comment
Standard HOL library retrieved from OpenTheory
Back to main package page
Back to contained package page
