[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 put-selcol
c < #c mx ⊦ (mx[m, n := j])[c]c = (n = c ⊃ mx[c]c[m := j];mx[c]c)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
oc-put-toArc-rec
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 8
Used lemmas:
Used spec theorems:
array
/
Extension
matrix
/
cngetput-c
matrix
/
cngetput-num-r
Used simplifier rules:
nat-basic
/
f
matrix+array
/
selcol-get
matrix
/
rowno-put
matrix+array
/
selcol-size
array
/
Size-put
array
/
Put-other
matrix
/
put-same
nat
/
lels
nat
/
ls-le-simp
array
/
cgetput