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