[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-rec
⊦ ns ≠ ∅ → (is-encoded(ns, buf) ↔ (∃ n, buf0, buf1. n ∈ ns ∧ buf = buf0 + buf1 ∧ is-encoded(n, buf0) ∧ is-encoded(ns -- n, buf1)))
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
is-encoded-size
,
is-encoded-split-one
,
is-encoded-unique
,
Used by units in proved state:
persistence-io-asm
,
Proof exists?: No