Entry
Value
Name
natural-bits_89
Conclusion
!n i. bit_nth n i <=> bit_hd (bit_shr n i)
Constructive Proof
Yes
Axiom
N|A
Classical Lemmas
N|A
Constructive Lemmas
T
!n i. bit_nth n i <=> bit_hd (bit_shr n i)
T <=> (\p. p) = (\p. p)
(!) = (\p. p = (\x. T))
Contained Package
natural-bits
Comment
Probability package from OpenTheory.
Back to main package page
Back to contained package page
