[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 30 from proof max-sort-sublist (
previous step
)
∀ x0. x1 + x0 = [] ∨ max(x1 + x0) = max(x1) ∨ max(x1 + x0) = max(x0) ⊦ max(x1 + x0) = max(x1), x1 + x0 = [], max(x1 + x0) = max(x0), x1 = [], max(x1 + x0) < a, max(x1) < a
Heuristic quantifier closing applied rule all left
And closed the goal!
Rule argument
pos: left 1 terms: x0
Additional information
Used terms: x0