[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-int-le-nat
⊦ i ≥ 0 → ((* i) + n→i(n) ≤ n→i(m) ↔ i→n(i) + n ≤ m)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 3
Used lemmas:
add-nonneg-int-to-nat
,
nat2int-08
,
num-n2i-ls-06
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-01
int-abs
/
lels
int-abs
/
ge-def
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
lels-01
int-abs
/
forward-lsle
int-abs
/
forward-le-02
int-basic2
/
ls