[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 4 from proof exa (
previous step
)
x0 = [] ∨ x0 = a0 + y ⊦ ∃ a0, y. a + x0 = a0 + y
Heuristic quantifier closing applied rule exists right
And closed the goal!
Rule argument
pos: right 1 terms: a, x0
Additional information
Used terms: a, x0