[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 1 from proof max-ins-max-last (conclusion)
⊦ ¬ a < max(x0) ∧ ordered≤(x0) → ins≤(a, x0) = x0 + a '
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 2
:
ordered≤(x0) ⊦ ins≤(a, x0) = x0 + a ', a < max(x0)
Rule argument
Additional information