[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 sortrow
sortrow#(m, asc; mx){choose a with # a = #c mx ∧ perm(mx[m]r, a) ∧ ordered≤((asc ⊃ a;rev(a))) in mx[m]r := a}
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
sortrow-correct
,
sortrowsnake-correct
,
Used by units in proved state:
Proof exists?: No