[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 ls-pos-02
⊦ i ≤ i0 ∧ 0 ≤ i ∧ 0 ≤ j → ¬ i0 ^ j < i ^ j
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
ls-pos-01
,
ls-pos-03
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 10
Used lemmas:
Pot-neg
,
notneg
,
succ
,
Pot-zero
,
Used spec theorems:
int-mult
/
pnls-pos
Used simplifier rules:
int-abs
/
forward-lele
intnat
/
abs-pred
int-abs
/
anti
int-abs
/
leone
int-abs
/
sub-le-01
int-abs
/
elim-sub
int-abs
/
numls-02
int-abs
/
numle-02
int-abs
/
mone-08
int-abs
/
abs-08
int-abs
/
forward-lsle
int-abs
/
forward-le-02
int-abs
/
mone-06
int-abs
/
forward-le-01
int-abs
/
lels
int-abs
/
numleledel-01
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
zero-gels-04
int-abs
/
lels-01