Database
REAL AND COMPLEX NUMBERS
Elementary limits and convergence
Finite and infinite products
Complex products
prodeq1
Next ⟩
nfcprod1
Metamath Proof Explorer
Ascii
Unicode
Theorem
prodeq1
Description:
Equality theorem for a product.
(Contributed by
Scott Fenton
, 1-Dec-2017)
Ref
Expression
Assertion
prodeq1
⊢
A
=
B
→
∏
k
∈
A
C
=
∏
k
∈
B
C
Proof
Step
Hyp
Ref
Expression
1
nfcv
⊢
Ⅎ
_
k
A
2
nfcv
⊢
Ⅎ
_
k
B
3
1
2
prodeq1f
⊢
A
=
B
→
∏
k
∈
A
C
=
∏
k
∈
B
C