[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 pe-01
⊦ m0 < m → n0 + (m + n)-1 = ((n0 + m) + n)-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: 0
Proof steps: 4
Used lemmas:
eq-01
,
succ
,
z
,
c
,
a
,
z-01
,
Used spec theorems:
Used simplifier rules:
nat-basic1
/
f
nat-basic1
/
elim-pred-c
nat-basic1
/
lf-01