[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 rowsincreasing-def
⊦ rowsincreasing(mx, r) ↔ (∀ r1, r2, c1, c2. r1 < r2 ∧ r2 < r ∧ c1 < #c mx ∧ c2 < #c mx → ¬ mx[r2, c2] < mx[r1, c1])
Type: An axiom
Validity: The proof is valid.
Features:
Comment: all elements in row r1 are less or equal to all elements in row r2 when r1 < r2 < r
Used by:
dirtyrowsone-rowsincreasing
,
psortrows-correct
,
rowsincreasing-allrowsorted-sorted-ind
,
Used by units in proved state:
Proof exists?: No