[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 put-at
m < # x ⊦ m ≠ n → x[m, a][n] = x[n]
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
list-perm
,
array-as-listinstance
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 15
Used lemmas:
get-zero
,
put-succ
,
get-succ
,
get-rec
,
put-zero
,
Used spec theorems:
Used simplifier rules:
list-data
/
l
nat-basic
/
f
nat-basic
/
c
nat-basic
/
a
nat-basic
/
oz
nat-basic
/
zero
nat-basic
/
succ
list-data
/
size-add
list-data
/
disj-nil-add
list-data
/
sel-add-dottail
nat
/
elim-pred-c
nat-basic
/
l
nat-basic
/
eq-01