[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 6 from proof log-group-block-write-other (
previous step
)
lpt[n] = mklp(n0, n1, lpf, n2), n < # lpt, n ∈ nx, ∀ n. n ∈ nx → n < # lpt ∧ lpt[n].flags = LP_GROUP_NODES ⊦ lpf = LP_GROUP_NODES, lpf0 = LP_GROUP_NODES
Heuristic quantifier applied rule all left
And closed the goal!
Rule argument
pos: left 4 terms: n
Additional information
Used simplifier rules: ⊦ mklp(n2, n3, lpf, m).flags = lpf; (s) Used terms: n