[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 pot-square-est-01
⊦ 0 ≤ i → ¬ 4 ^ i ≤ i * i
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 16
Used lemmas:
Pot-neg
,
succ
,
Used spec theorems:
int-mult
/
dist-lsplit
Used simplifier rules:
intnat
/
abs-pred
int-abs
/
anti
int-abs
/
leone
int-abs
/
sub-le-01
int-abs
/
elim-sub
int-abs
/
mone-06
int-abs
/
numls-02
int-abs
/
numle-02
int-abs
/
mone-08
int-abs
/
abs-08
int-abs
/
forward-le-02
int-abs
/
forward-le-01
int-abs
/
zero-gels-04
int-abs
/
numleledel-01
int-abs
/
lels
int-abs
/
forward-lele
int-mult
/
numle-10
int-abs
/
lels-01
int-abs
/
lenls
int-abs
/
succ-02
int-mult
/
numls-05
int-mult
/
numls-10
int-abs
/
lels-02
int-mult
/
le-pos
int-div
/
nummult-le
int-abs
/
lels-03
int-mult
/
one
int-mult
/
associativity
int-mult
/
commutativity
int-basic2
/
add-a
int-mult
/
numeq-02
int-mult
/
eq-succ
int-basic2
/
add-c