[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 prefixn-add
n ≠ 0 ⊦ prefixn(n, a ' + x0) = prefixn(n, a ' + x1) ↔ prefixn(n - 1, x0) = prefixn(n - 1, x1)
Type: A user defined theorem
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
prefixn-shorter
,
refine-add
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 3
Used lemmas:
Used spec theorems:
Used simplifier rules:
nat-basic
/
oz
nat-basic
/
a
nat-basic
/
c
list-prefixn
/
prefixn-prepend-one
list
/
a
list
/
app-08
nat
/
elim-pred-c