[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-add-bigger
⊦ ¬ #fz(m) < #fz(m + 2^ #fz(m)) ↔ false
Type: A user defined theorem
Validity: The proof is valid.
Features: localsimp, simp,
Comment:
Used by:
finz-add-leq
,
finz-add-neq
,
finz-add-notless
,
Used by units in proved state:
prefixsum
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 14
Proof steps: 18
Used lemmas:
pot2-even
,
pot2-odd
,
lead-is-odd
,
split-ok
,
Used spec theorems:
nat
/
le-addex
nat-pot
/
pot2-add
nat-even
/
odd-add
nat-even
/
odd-mult
Used simplifier rules:
nat-even
/
oe-01
nat-mult
/
one
nat-pot
/
Pot2-zero
nat-mult
/
mult-a
nat-pot
/
zero
nat-mult
/
coef-04
nat-mult
/
mult-c
nat-basic2
/
c
nat-basic2
/
a
nat
/
lels