[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 3 from proof cleanup-lpt-to-n (
previous step
)
⊦ lpt = lpt0 ↔ # lpt = # lpt0 ∧ (∀ n. n < # lpt → lpt[n] = lpt0[n])
A spec-lemma