[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 2 from proof valid-eraseqd-nodups-middle0 (
previous step
)
valid-eraseq(q0 + eq-entry(m, lref) ' + q1), m ∈ q0 ⊦
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 3
:
valid-eraseq(q0 + eq-entry(m, lref) ' + q1), m ∈ q0 ⊦
Rule argument
Additional information