[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-03
⊦ 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:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 8
Used lemmas:
abs-neg
,
Int2nat-pos
,
Int2nat-neg
,
Used spec theorems:
Used simplifier rules:
int-abs
/
elim-sub
int-abs
/
lels
int-abs
/
lels-03
int-abs
/
neg
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
eq-01
int-basic2
/
ls
int-abs
/
ler
int-basic2
/
ls-01
int-abs
/
forward-lsle
int-abs
/
lep
int-abs
/
succ-02
int-basic1
/
lf-02
int-basic2
/
mone-03
int-abs
/
numadd-01
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
negeq
int-abs
/
neg-03