[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Theorem finz-bounded-03
⊦ m < 2 * 2^ n → (n = #fz(m) ↔ m + 1 = 2^ n)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 12
Used lemmas:
finz-odd
,
finz-even
,
Used spec theorems:
nat-even
/
Even
nat-even
/
oex
Used simplifier rules:
nat-basic2
/
s
nat-mult
/
twols
nat-mult
/
coef-17
nat-basic2
/
eq-01
nat
/
add-num-03
nat-mult
/
modls
nat-even
/
eo-01
nat-basic1
/
one-01
nat-basic2
/
one-03
nat-pot
/
Pot2-zero
nat-basic2
/
succ
nat-basic2
/
oz
nat-pot
/
lemma-ax2
nat-mult
/
two-succ-05
nat-mult
/
ls
nat-basic2
/
c
nat-basic2
/
a
nat-mult
/
two-02
nat-mult
/
mult-c
nat-mult
/
mult-a
nat-pot
/
zero
nat-mult
/
two-zero-01
nat-basic1
/
f