[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-add
⊦ 0 ≤ j1 ∧ j1 < j → (i0 * j + j1 < j ↔ i0 ≤ 0)
Type: A user defined theorem
Validity: The proof is valid.
Features: ls, s,
Comment:
Used by:
modeqp
,
Used by units in proved state:
int-div
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 6
Used lemmas:
zero-gr
,
one-01
,
commutativity
,
associativity
,
one
,
modlsp-02
,
Used spec theorems:
int-abs
/
le-def
Used simplifier rules:
int-abs
/
forward-lsle
int-abs
/
forward-lels
int-abs
/
forward-lele
int-basic2
/
ls-02
int-abs
/
lels-04
int-abs
/
absle
int-abs
/
le-def
int-abs
/
lels
int-abs
/
bet
int-basic2
/
ls
int-abs
/
lenls
int-basic2
/
add-a
int-basic2
/
add-c