[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
,
Theorem sorted-sub
⊦ sorted(ar, n0, n1, ⊑) ↔ (∀ n, m. n0 ≤ n ∧ n < m ∧ m < n1 → ⊑(ar[n], ar[m]))
Type: An axiom
Validity: The proof is valid.
Features: localsimp,
Comment:
Used by:
sorted-0
,
sorted-1
,
sorted-exchange
,
sorted-last2
,
sorted-sub-change-above
,
sorted-sub-entire
,
sorted-sub-less1
,
sorted-sub-merge
,
Used by units in proved state:
Proof exists?: No