Entry
Value
Name
natural-bits_133
Conclusion
!n k. bit_shl n k = 2 EXP k * n
Constructive Proof
Yes
Axiom
N|A
Classical Lemmas
N|A
Constructive Lemmas
T
!x. x = x
!t. (!x. t) <=> t
!f y. (\x. f x) y = f y
!n k. bit_shl n k = 2 EXP k * n
T <=> (\p. p) = (\p. p)
(/\) = (\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 page
Back to contained package page
