Entry Value
Name natural-bits_2
Conclusion ~bit_hd 0
Constructive Proof Yes
Axiom 
N|A
Classical Lemmas N|A
Constructive Lemmas
  • T
  • !x. x = x
  • !t. (!x. t) <=> t
  • !t. (F <=> t) <=> ~t
  • !t. (T <=> t) <=> t
  • !t. (t <=> F) <=> ~t
  • !t. (t <=> T) <=> t
  • !f y. (\x. f x) y = f y
  • ~ODD 0
  • ~bit_hd 0
  • F <=> (!p. p)
  • T <=> (\p. p) = (\p. p)
  • ~F <=> T
  • (~) = (\p. p ==> F)
  • (/\) = (\p q. (\f. f p q) = (\f. f T T))
  • (==>) = (\p q. p /\ q <=> p)
  • (!) = (\p. p = (\x. T))
  • NUMERAL = (\n. n)
    		•
    Contained Package natural-bits
    Comment Probability package from OpenTheory.
    Back to main package pageBack to contained package page