[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 natpos
0 < j, 0 ≤ i ⊦ i→n(i) / i→n(j) = i→n(i / j)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
nat
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 11
Used lemmas:
labs-01
,
i2n
,
add
,
abs-zero
,
Used spec theorems:
nat-mult
/
modeq
Used simplifier rules:
int-div
/
div-elim-pos
int-abs
/
forward-le-01
int-basic2
/
add-c
int-basic2
/
add-a
int-mult
/
zero-ge-add
int-basic1
/
lf-02
nat-div
/
div-elim
int-mult
/
commutativity
int-mult
/
associativity
int-abs
/
zero-gels-04
int-mult
/
zero-ge
int-basic1
/
forward-pos
int-abs
/
forward-le-05
int-basic1
/
lf-01
int-abs
/
lels-02
nat-basic1
/
f
nat
/
fle
nat
/
lels
int-abs
/
abs-16
int-abs
/
lels-03