[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 is-encoded-unique-size
⊦ is-encoded(a, buf) ∧ n ≤ # buf → (is-encoded(b, subarray(buf, 0, n)) ↔ b = a ∧ n = # buf)
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
is-encoded-prefix
,
is-encoded-unique
,
Used by units in proved state:
Proof exists?: No