[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 3 from proof bin (
previous step
)
∀ x, a. (x + a ' + y0).butlast = x + (a ' + y0).butlast ⊦ (x + a ' + a0 ' + y0).butlast = x + a ' + (a0 ' + y0).butlast
Heuristic quantifier closing applied rule all left
And closed the goal!
Rule argument
pos: left 1 terms: x + a ', a0
Additional information
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list Used terms: x + a ', a0