[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 20 from proof size-three-02 (
previous step
)
⊦ a = a0, a0 = a1, a = a1, ∃ a2, b, c. a2 ≠ b ∧ a2 ≠ c ∧ b ≠ c ∧ ∅ ++ a1 ++ a0 ++ a = ∅ ++ a2 ++ b ++ c
Heuristic quantifier closing applied rule exists right
And closed the goal!
Rule argument
pos: right 4 terms: a1, a0, a
Additional information
Used terms: a1, a0, a