[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-shorter-sublist (conclusion)
⊦ ordered≤(sublist(m0, n1 + 1, x)) ∧ n2 < n1 ∧ n1 + m0 < # x → (ordered≤(sublist(m0, n2 + 1, x)) ↔ true)
System applied rule normalize
And obtained the following new goals
Proof step 2
:
n2 < n1, n1 + m0 < # x, ordered≤(sublist(m0, n1 + 1, x)) ⊦ ordered≤(sublist(m0, n2 + 1, x)) ↔ true
Rule argument
Additional information