[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 71 from proof prepost-read-log (
previous step
)
⊦ is-encoded(nx0 + nx1, buf) ↔ (∃ buf0, buf1. buf = buf0 + buf1 ∧ is-encoded(nx0, buf0) ∧ is-encoded(nx1, buf1))
A spec-lemma