[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 28 from proof prepost-encode-orphans (
previous step
)
⊦ is-encoded(ns, buf0) ∧ is-encoded(n, buf1) ∧ ¬ n ∈ ns → (is-encoded(ns1, buf0 + buf1) ↔ ns1 = ns ++ n)
A spec-lemma