[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 pot2-est-mult8
⊦ 0 ≤ i → ¬ 8 * 2 ^ i < i + 7
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
pot2-est-div6
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 8
Proof steps: 14
Used lemmas:
Pot-pos
,
Used spec theorems:
int-mult
/
dist-lsplit
Used simplifier rules:
int-abs
/
anti
int-abs
/
forward-le-05
int-abs
/
sub-pred
int-abs
/
elim-sub
int-abs
/
forward-le-01
int-abs
/
numleledel-01
int-abs
/
mone-06
int-abs
/
numls-02
int-abs
/
numle-02
intnat
/
rax-04
nat-basic2
/
s
intnat
/
labs
int-abs
/
absle
int-basic1
/
irref
nat-basic2
/
a
nat-basic2
/
c
int-abs
/
zero-gels-04
int-abs
/
lels-01
int-mult
/
eq-pos
int-div
/
nummult-modle
int-abs
/
lels
int-abs
/
forward-lsle
int-div
/
nummult-modls-01
int-abs
/
lenls
int-mult
/
associativity
int-mult
/
numls-03
int-mult
/
one
int-abs
/
numls-03
int-abs
/
zero-gels
int-basic2
/
add-a
int-basic2
/
add-c
int-mult
/
commutativity