[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-ls-pred-01
⊦ 2 ^ (i - 1) + 1 < 2 ^ i ↔ 1 < i
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: 3
Proof steps: 6
Used lemmas:
two-lsz
,
pot2-pos-01
,
Pot-neg
,
Pot-pos
,
Used spec theorems:
int-div
/
one-04
Used simplifier rules:
int-abs
/
sub-pred
int-mult
/
numls-08
int-mult
/
one
int-mult
/
associativity
int-mult
/
commutativity
int-abs
/
sub-ls-01
int-abs
/
numlelsdel-01
int-abs
/
numleledel
int-abs
/
forward-lsle
int-abs
/
forward-le-05
int-basic1
/
forward-pos
int-abs
/
forward-le-04
int-abs
/
lels
int-abs
/
anti
int-abs
/
forward-le-02
int-abs
/
abs-08
int-abs
/
zero-gels-03
int-abs
/
neg
int-abs
/
zero-gels-01
int-abs
/
numls-03
int-basic2
/
add-a
int-basic2
/
add-c
int-basic1
/
numlsf