[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 updrow-sel
⊦ # a = #c mx ∧ r0 < #r mx ∧ c0 < #c mx → mx[r := a]r(r0, c0) = (r = r0 ⊃ a(c0);mx(r0, c0))
Type: An axiom
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
putrow-getrow
,
putrow-id
,
putrow-outside-id
,
Used by units in proved state:
Proof exists?: No