[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 oc-put-toArr-rec
⊦ m < #r mx ∧ n < #c mx ∧ r ≤ #r mx → #oc(i, toArr(mx[m, n, j], r)) = #oc(i, toArr(mx, r)) + (i = j ∧ m < r ⊃ 1;0) - (mx[m, n] = i ∧ m < r ⊃ 1;0)
Type: A user defined theorem
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
oc-put-toAr
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 13
Proof steps: 28
Used lemmas:
oc-toArr-positive
,
getrow-putsame
,
put-selrow
,
toArr-rec
,
toArr-base
,
Used spec theorems:
list-perm
/list-as-arrayinstance/
ocs-put-01
list-perm
/list-as-arrayinstance/
ocs-put-02
list-perm
/list-as-arrayinstance/
ocs-put
nat
/
prop-05
list-del
/list-as-arrayinstance/
in-get
Used simplifier rules:
list-perm
/list-as-arrayinstance/
oc-e
nat-basic
/
a
nat-basic
/
c
nat-basic
/
less-zero
nat-basic
/
f
nat
/
succ-01
nat-basic
/
succ
nat-basic
/
s-04
list
/list-as-arrayinstance/
a
list-perm
/list-as-arrayinstance/
ocappend
nat-basic
/
refl-nat
nat
/
lels-03
nat
/
sub-base
nat-basic
/
add-base
matrix+array
/
selrow-get
nat-basic
/
eq-01
matrix+array
/
selrow-size
nat
/
eq-01
matrix
/
put-same-content
nat
/
pred-03
nat-basic
/
z-01
list-perm
/list-as-arrayinstance/
oc-zero
list-perm
/list-as-arrayinstance/
notin
nat
/
elim-pred-c
nat-basic
/
oz
nat
/
add-01
nat
/
le-def
nat-basic
/
one-01
nat
/
eq-02
nat-basic
/
eq-02
nat-basic
/
trans-nat
nat-basic
/
lf
nat-basic
/
ls-02
nat-basic
/
neq-01