[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 append-mod
⊦ # x ≤ n ∧ n < # x + # x0 → ((x + x0)[n, a] = x + x1 ↔ x0[n - # x, a] = x1)
Type: A user defined theorem
Validity: The proof is valid.
Features:
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: 10
Used lemmas:
put-succ
,
Used spec theorems:
Used simplifier rules:
nat-basic2
/
l-01
nat
/
fle-01
nat
/
elim-sub
nat-basic1
/
f
nat
/
lep
nat-basic2
/
l
list
/
Nil
list-data
/
size-01
nat-basic2
/
add-base
nat-basic2
/
oz
list
/
app-08
nat-basic2
/
succ
list
/
len-05
list
/
a
list
/
c
nat-basic2
/
z-01
list-data
/
l
nat-basic2
/
a
nat-basic2
/
c