[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 abs-pred-01
⊦ i < 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
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 5
Used lemmas:
rax-02
,
abs-neg
,
Int2nat-neg
,
abs-zero
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-02
int-basic1
/
lf-02
nat
/
elim-pred-c
int-basic2
/
add-a
int-basic2
/
add-c
nat
/
pred-03
int-abs
/
numls-03
nat
/
add-01
nat-basic2
/
add-base
nat-basic2
/
a
nat-basic2
/
c
int-abs
/
lels
int-abs
/
mone-08