[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 del-del1-nodups (
previous step
)
∀ a1. x0 -l a1 = x0 -1l a1 ⊦ a = a0, x0 -l a = x0 -1l a, a0 ∈ x0, dups(x0)
Heuristic quantifier closing applied rule all left
And closed the goal!
Rule argument
pos: left 1 terms: a
Additional information
Used terms: a