[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 ordered-app-max (conclusion)
⊦ x0 ≠ [] ∧ ¬ a < max(x0) ∧ ordered≤(x0) → (ordered≤(x0 + a ') ↔ true)
System applied rule normalize
And obtained the following new goals
Proof step 2
:
ordered≤(x0) ⊦ ordered≤(x0 + a ') ↔ true, x0 = [], a < max(x0)
Rule argument
Additional information