[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 25 from proof prepost-encode-lpt (
previous step
)
# buf = lptsize(# lpt, LEB_SIZE), is-encoded(lpt, buf, # lpt) ⊦ is-encoded(lpt, buf)
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 26
:
⊦ is-encoded(lpt, buf) ↔ is-encoded(lpt, buf, # lpt)
Rule argument
spec: encoding-lpt name: is-encoded-full seq: ⊦ is-encoded(lpt, buf) ↔ is-encoded(lpt, buf, # lpt) subst: [buf, lpt] → [buf, lpt] flags: <all paths>
Additional information
Used terms: buf, lpt