[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 dirtyrowsone-rowsincreasing
#r mx = #r mx0, #c mx = #c mx0 ⊦ mx.dirtyrows≤(1) ∧ colsorted(mx0, #c mx, mx) → rowsincreasing(mx, #r mx)
Type: A user defined theorem
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
pshearsort-correct
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 30
Proof steps: 59
Used lemmas:
colsorted-def
,
dirytrows-leone
,
rowsincreasing-def
,
dirtyrowsbound-def
,
Used spec theorems:
olist
/oarray-sort/
orderedle-all
filter-count
/oarray-sort/
count-zero
Used simplifier rules:
nat-basic
/
lf-01
nat-basic
/
succ
nat-basic
/
f
nat-basic
/
trans-nat
nat-basic
/
lf
nat-basic
/
one
nat
/
le-def
nat
/
one-02
nat-basic
/
lf-02
nat-basic
/
ls-02
nat
/
ler
nat
/
fle
matrix+array
/
selcol-get
matrix+array
/
selcol-size
tord
/Bubblesort-row-rev/
nll
nat
/
lels-03
tord
/
nll
matrix+array
/
selrow-get
matrix+array
/
selrow-size
nat-basic
/
refl-nat
nat
/
lels
nat
/
fle-01
tord
/
irreflexivity