[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 sum-add
⊦ Σ(ns, f1) + Σ(ns, f2) = Σ(ns, λ n. f1(n) + f2(n))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
distrmxmx-l
,
distrmxmx-r
,
distrmxmxvec
,
distrmxvecvec
,
distrvecmxmx
,
distrvevecmx
,
sum-switch
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 7
Used lemmas:
sum-rec
,
sum-base
,
Used spec theorems:
set-basic
/natset/
eq
Used simplifier rules:
ring
/
addzero-r
ring
/
addassoc
ring
/
addcom
set-basic
/natset/
size-zero-01
set-basic
/natset/
ne-01