[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 18 from proof remove-wbufs-rec (
previous step
)
n0 < # lpt ⊦ lpt[n0] = lpt.mapIndices(ns, λ lp. lp.size:= LEB_SIZE)[n0], n0 = n, n ∈ ns, n0 ∈ ns
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 19
:
n0 < # lpt ⊦ lpt[n0] = lpt.mapIndices(ns, λ lp. lp.size:= LEB_SIZE)[n0], n0 = n, n0 ∈ ns, n ∈ ns
Rule argument
Additional information