[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 correctness
A.cols = B.rows ⊦ ⟨multiply(A, B; C)⟩ (C = A * B)
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: 68
Used lemmas:
prove-ext
,
multiply
,
Used spec theorems:
Used simplifier rules:
matrix
/
rows-base
matrix
/
cols-base
matrix-dot
/
sum-base
nat
/
lez
nat-basic1
/
zero-01
matrix
/
at-rec
matrix
/
rows-rec
matrix
/
cols-rec
int-basic2
/
add-in
nat
/
ls-le-simp
matrix-dot
/
sum-rec
nat-basic1
/
trans-1
nat-basic1
/
neq-01
nat
/
prop-07
nat
/
ls-01
nat
/
le-ls-simp
nat-basic2
/
s
nat-basic2
/
c
nat-basic2
/
a
nat
/
succ-01
nat
/
lels-03
nat
/
fle-01
nat-basic2
/
succ
nat-basic1
/
lf
nat
/
lels-02
nat-basic1
/
ref-1
nat-basic1
/
ls-02
int-basic2
/
add-c
int-basic2
/
add-a
int-basic2
/
add-zero-rev
matrix
/
at-base
nat
/
ler
nat-basic1
/
lf-01
nat-basic1
/
f
nat
/
anti
nat
/
lels
matrix-dot
/
at-dot
matrix-dot
/
cols-dot
matrix-dot
/
rows-dot