[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 cgetput
m < # ar ⊦ ar[m, a][m] = a
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
cputput
,
cputput-reverse
,
eq-put2
,
eq-write-2
,
ext-rec
,
put-put-get-ls
,
put-put-get-neq
,
putgetinv
,
write3
,
Used by units in proved state:
list-as-arrayinstance
,
rowcol-upd
,
array-copy
,
array-listops
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 2
Used lemmas:
Put-same
,
Used spec theorems:
Used simplifier rules: