[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 5 from proof subapp (
previous step
)
a ∈ x0, y ⊆m y0, x1 ⊆m x0 -1l a, ∀ y, y0, x0. y ⊆m y0 ∧ x1 ⊆m x0 → x1 + y ⊆m x0 + y0 ⊦ x1 + y ⊆m (x0 -1l a) + y0
Heuristic quantifier closing applied rule all left
And closed the goal!
Rule argument
pos: left 4 terms: y, y0, x0 -1l a
Additional information
Used terms: y, y0, x0 -1l a