[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 extension
⊦ mx1 = mx2 ↔ #c mx1 = #c mx2 ∧ #r mx1 = #r mx2 ∧ (∀ r, c. r < #c mx1 ∧ c < #r mx1 → mx1[r, c]rv = mx2[r, c]rv)
Type: A proof obligation
Validity: The proof is valid.
Features:
Comment: |- mx1 = mx2 <-> #r mx1 = #r mx2 and #c mx1 = #c mx2 and (all r, c. r < #r mx1 and c < #c mx1 -> mx1[r, c] = mx2[r, c])
Used by:
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:
Used spec theorems:
matrix
/
extension
Used simplifier rules:
matrix-revops
/
revselect-def
nat-basic
/
f
nat-basic
/
lf-01