[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 2 from proof payload-save-load-same (
previous step
)
⊦ # zbrar0 = # zbrar1 ∧ n + m ≤ # zbrar0 ∧ # zbrar0 = BRANCH_SIZE ∧ save(zbrar0, n, m) = save(zbrar1, n, m) → payload(zbrar0, n, m) = payload(zbrar1, n, m)
Lemma
save-same-payload-same