Entry Value
Name natural-bits_146
Conclusion !n k. num_to_bitvec n (SUC k) = CONS (bit_hd n) (num_to_bitvec (bit_tl n) k)
Constructive Proof Yes
Axiom 
N|A
Classical Lemmas N|A
Constructive Lemmas
  • T
  • !n k. num_to_bitvec n (SUC k) = CONS (bit_hd n) (num_to_bitvec (bit_tl n) k)
  • T <=> (\p. p) = (\p. p)
  • (/\) = (\p q. (\f. f p q) = (\f. f T T))
    		•
    Contained Package natural-bits
    Comment Probability package from OpenTheory.
    Back to main package pageBack to contained package page