[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-05
⊦ n * 2^ n0 ≤ m ∧ m + 1 < (n + 1) * 2^ n0 → #fz(m) < n0
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
prefixsum
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 11
Used lemmas:
finz-odd
,
finz-even
,
Used spec theorems:
nat-even
/
Even
nat-even
/
oex
Used simplifier rules:
nat-basic2
/
l-04
nat-basic2
/
s
nat-mult
/
twols
nat
/
lep-02
nat-mult
/
coef-13
nat-mult
/
le2-04
nat-pot
/
lemma-ax2
nat-basic2
/
succ
nat
/
l-num-02
nat
/
le-ls-simp
nat-even
/
eo-01
nat-mult
/
two-02
nat
/
lez-01
nat-pot
/
Pot2-zero
nat-mult
/
one
nat-basic2
/
l
nat
/
ls-le-simp
nat-basic1
/
f
nat
/
lels
nat-mult
/
mult-c
nat-mult
/
mult-a
nat-basic2
/
c
nat-basic2
/
a
nat-mult
/
rsucc-02