[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 eq-write-2-r
⊦ r ≠ r0 → ( (mx[r, c := a0])[r0, c0 := a1] = (mx[r0, c0 := b1])[r, c := b0] ↔ (r < #r mx ∧ c < #c mx → a0 = b0) ∧ (r0 < #r mx ∧ c0 < #c mx → a1 = b1))
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
cputput-reverse-r
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 57
Used lemmas:
ngp-07-r
,
cngetput-r
,
ngp-07-c
,
put-othercol
,
put-same
,
cgetput
,
put-otherrow
,
cngetput-c
,
colno-put
,
rowno-put
,
extension
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
nat
/
fle
nat
/
le-ls-simp
nat
/
lels