[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 21 from proof is-encoded-prefix (
previous step
)
⊦ is-encoded(a, buf) ∧ n ≤ # buf → (is-encoded(b, subarray(buf, 0, n)) ↔ b = a ∧ n = # buf)
Lemma
is-encoded-unique-size