[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 prove-ext
⊦ A ≠ B ↔ ¬(A.rows = B.rows ∧ A.cols = B.cols ∧ (∀ m, n. m < A.rows ∧ n < A.cols → A[m, n] = B[m, n]))
Type: A user defined theorem
Validity: The proof is valid.
Features: localsimp,
Comment:
Used by:
correctness
,
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
/
ext
Used simplifier rules:
nat-basic1
/
lf-01
nat-basic1
/
f