[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 ole-last-01 (conclusion)
⊦ ordered≤(x) ∧ x ≠ [] → (ordered≤(x + a ') ↔ ¬ a < x.last)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 2
:
ordered≤(x) ⊦ ordered≤(x + a ') ↔ ¬ a < x.last, x = []
Rule argument
Additional information