[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 decode-contract (
previous step
)
⊦ ⟪decode#(n, buf; a, n0; err)⟫ ((err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → is-encoded(a, subarray(buf, n, n0)) ∧ n + n0 ≤ # buf ∧ n0 = encoding-size(a)))
A spec-lemma