[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
,
Proof step 4 from proof payload-mod-0 (
previous step
)
n < nused, m + nused ≤ # zbrar, zbrar[m + n].key = key, sorted(zbrar, m, nused) ⊦ payload(zbrar[m + n, mkzentry(key, adr)], m, nused) = payload(zbrar, m, nused)[key, adr]
Lemma
payload-mod