[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 exinpot
0 < j, 1 < i ⊦ ∃ i0. 0 ≤ i0 ∧ i ^ i0 ≤ j ∧ j < i ^ (i0 + 1)
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: 5
Proof steps: 9
Used lemmas:
ls-pos
,
Pot-zero
,
succ
,
Used spec theorems:
Used simplifier rules:
intnat
/
abs-pred
int-abs
/
lels-03
int-basic1
/
lf-02
int-abs
/
bet
int-abs
/
sub-ls-01
int-mult
/
one
int-basic1
/
forward-pos
int-abs
/
forward-le-05
int-basic1
/
lf-01
int-abs
/
forward-le-01
int-abs
/
forward-lsle
int-abs
/
forward-le
int-abs
/
sub-ls
int-abs
/
succ-01
int-abs
/
sub-le-01
int-mult
/
ls-pos
int-mult
/
ls-same-01
int-abs
/
numlelsdel-01
int-mult
/
zero-gr
int-abs
/
leone
int-mult
/
le-same-01
int-abs
/
forward-lele
int-abs
/
anti
int-abs
/
lels
int-basic1
/
ls-01
int-abs
/
lels-01
int-abs
/
zero-gels-04
int-abs
/
numle-02
int-abs
/
numleledel-01
int-basic2
/
add-a
int-basic2
/
add-c
int-mult
/
le-pos
int-abs
/
ler
int-mult
/
associativity
int-mult
/
commutativity
int-abs
/
succ-02