[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 9 from proof lasttwo (
previous step
)
⊦ a0 = a, a ∈ z0, a0 ∈ y0, a0 ∈ z0, ∃ b, y1, z1. y + a0 ' + y0 + a ' + z0 = y1 + b ' + z1 ∧ (b = a ∨ b = a0) ∧ ¬ a ∈ z1 ∧ ¬ a0 ∈ z1
Heuristic quantifier closing applied rule exists right
And closed the goal!
Rule argument
pos: right 5 terms: a, y + a0 ' + y0, z0
Additional information
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; Used terms: a, y + a0 ' + y0, z0