[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 11 from proof mklist-rmdup (
previous step
)
∀ a, n. rmdup(x0 + mklist(a, n)) = rmdup(x0) + a ' ∨ n = 0 ∨ a ∈ x0 ⊦ a = a0, n = 0, rmdup(x0 + mklist(a, n)) = rmdup(x0) + a ', a ∈ x0, a0 ∈ x0, a0 ∈ mklist(a, n)
Heuristic quantifier closing applied rule all left
And closed the goal!
Rule argument
pos: left 1 terms: a, n
Additional information
Used terms: a, n