[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 12 from proof valid-eraseqd-append (
previous step
)
valid-eraseq(q0), valid-eraseq(q0 + eq-entry(m, lref) '), m ∈ q0, ∀ m1, lref1. valid-eraseq(q0 + eq-entry(m1, lref1) ') ↔ ¬ m1 ∈ q0 ⊦ m0 ∈ q0
Heuristic quantifier closing applied rule all left
And closed the goal!
Rule argument
pos: left 4 terms: m, lref
Additional information
Used terms: m, lref