[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 rax
⊦ 0 < i + 1 → i→n(i + 1) = i→n(i) + 1
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
abs-succ-03
,
i2np
,
rax-04
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 2
Used lemmas:
Int2nat-pos
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-01
int-abs
/
numsub
int-basic2
/
add-zero-rev
int-basic2
/
add-a
int-basic2
/
add-c
nat-basic2
/
eq-01
nat-basic2
/
a
nat-basic2
/
c
int-abs
/
numls-02
int-abs
/
mone-06
int-abs
/
zero-gels-04