[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 rowperms-clean0unchanged
#r mx = #r mx0, #c mx = #c mx0, #c mx ≠ 0, ∀ r. r < #r mx → perm(mx0[r]r, mx[r]r) ⊦ #clean0rows(mx0, i) = #clean0rows(mx, i) ↔ true
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment: sorting rows leaves number of clean0 rows for i unchanged
Used by:
rowperms-dirtyrowsunchanged
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 8
Proof steps: 17
Used lemmas:
clean0rows-allls
,
clean0rows-notallls
,
clean0rows-bounded
,
Used spec theorems:
filter-count
/oarray-sort/
perm-count
list-perm
/list-as-arrayinstance/
sym
Used simplifier rules:
nat-basic
/
f
nat-basic
/
lf-01
nat
/
fle
nat
/
lels
nat-basic
/
neq-01