[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 lsnum-addboth1
⊦ i < j → ((* i).r + r0 < (* j).r + r1 ↔ r0 < (j - i).r + r1)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls, norw,
Comment:
Used by:
Used by units in proved state:
real-multdiv
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 4
Used lemmas:
add-comm
,
add-assoc
,
less-add-cancel-l
,
eqint-add
,
Used spec theorems:
Used simplifier rules:
int-abs
/
elim-sub
int-abs
/
forward-le-05
int-basic2
/
add-c
int-basic2
/
add-a
int-basic2
/
ls-02