[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 inv-outer
⊦ inv-outer(ar, ar0, n, ⊑) ↔ ¬ ¬ (n ≤ # ar ∧ ar .elems = ar0 .elems ∧ sorted(ar, 0, n, ⊑) ∧ reflexive(⊑) ∧ transitive(⊑) ∧ total(⊑))
Type: An axiom
Validity: The proof is valid.
Features: localsimp,
Comment:
Used by:
correctness-sort
,
Used by units in proved state:
Proof exists?: No