[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 1 from proof encoding-unique (conclusion)
⊦ is-encoded(lpt0, buf) ∧ # lpt0 = # lpt1 → (is-encoded(lpt1, buf) ↔ lpt0 = lpt1)
System applied rule normalize
And obtained the following new goals
Proof step 2
:
# lpt0 = # lpt1, is-encoded(lpt0, buf) ⊦ is-encoded(lpt1, buf) ↔ lpt0 = lpt1
Rule argument
Additional information