[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 17 from proof rm-vl-notin-before (
previous step
)
eq-entry(n, lref) ∈ q0 - lref0, eq-entry(n0, lref) ∈ q0, ∀ n, lref, lref0. eq-entry(n, lref) ∈ q0 - lref0 → (∃ n. eq-entry(n, lref) ∈ q0) ⊦ lref1 = lref0, ∃ n0. eq-entry(n0, lref) = eq-entry(m, lref1) ∨ eq-entry(n0, lref) ∈ q0
Heuristic quantifier closing applied rule exists right
And closed the goal!
Rule argument
pos: right 2 terms: n0
Additional information
Used terms: n0