[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 ext-rec
⊦ mx1 = mx0[r, c := a] ↔ #r mx0 = #r mx1 ∧ #c mx0 = #c mx1 ∧ (∀ r0, c0. r0 < #r mx0 ∧ c0 < #c mx0 → mx1[r0, c0] = (r = r0 ∧ c = c0 ⊃ a;mx0[r0, c0]))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 26
Used lemmas:
put-otherrow
,
put-othercol
,
put-same
,
colno-put
,
rowno-put
,
extension
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
nat-basic
/
lf-01