[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-rec
⊦ sorted(zbrar, n, m + 2) ↔ n < # zbrar ∧ zbrar[n].key < zbrar[n + 1].key ∧ sorted(zbrar, n + 1, m + 1)
Type: An axiom
Validity: The proof is valid.
Features: ws, lws,
Comment:
Used by:
keep-sorted
,
sorted-all
,
sorted-lt-h
,
sorted-rec1
,
Used by units in proved state:
Proof exists?: No