[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 le-add-01
⊦ i + j ≤ i0 ∧ j ≥ 0 ∧ j0 ≥ 0 → i - j0 ≤ i0
Type: A user defined theorem
Validity: The proof is valid.
Features: localsimp, simp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
sub-le
,
ge-def
,
le-def
,
Used spec theorems:
int-basic2
/
pls-02
int-basic2
/
pls-04
Used simplifier rules:
int-basic2
/
add-zero-rev
int-basic2
/
add-a
int-basic2
/
add-c
int-basic2
/
ls-add-both