[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 overwrite-col
⊦ c < #c mx ∧ # a = #r mx ∧ c0 < #c mx → mx[c, a]c[c0]c = (c = c0 ⊃ a;mx[c0]c)
Type: A user defined theorem
Validity: The proof is valid.
Features: ls, s,
Comment:
Used by:
perm-updcol-ind
,
toArc-outside-gen
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 4
Used lemmas:
updcol-sel
,
rowno-updcol
,
Used spec theorems:
array
/
Extension
Used simplifier rules:
nat-basic
/
f
matrix+array
/
selcol-get
matrix+array
/
selcol-size