MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fprodmul Structured version   Visualization version   GIF version

Theorem fprodmul 15292
Description: The product of two finite products. (Contributed by Scott Fenton, 14-Dec-2017.)
Hypotheses
Ref Expression
fprodmul.1 (𝜑𝐴 ∈ Fin)
fprodmul.2 ((𝜑𝑘𝐴) → 𝐵 ∈ ℂ)
fprodmul.3 ((𝜑𝑘𝐴) → 𝐶 ∈ ℂ)
Assertion
Ref Expression
fprodmul (𝜑 → ∏𝑘𝐴 (𝐵 · 𝐶) = (∏𝑘𝐴 𝐵 · ∏𝑘𝐴 𝐶))
Distinct variable groups:   𝐴,𝑘   𝜑,𝑘
Allowed substitution hints:   𝐵(𝑘)   𝐶(𝑘)

Proof of Theorem fprodmul
Dummy variables 𝑓 𝑚 𝑛 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 1t1e1 11776 . . . . 5 (1 · 1) = 1
2 prod0 15275 . . . . . 6 𝑘 ∈ ∅ 𝐵 = 1
3 prod0 15275 . . . . . 6 𝑘 ∈ ∅ 𝐶 = 1
42, 3oveq12i 7143 . . . . 5 (∏𝑘 ∈ ∅ 𝐵 · ∏𝑘 ∈ ∅ 𝐶) = (1 · 1)
5 prod0 15275 . . . . 5 𝑘 ∈ ∅ (𝐵 · 𝐶) = 1
61, 4, 53eqtr4ri 2854 . . . 4 𝑘 ∈ ∅ (𝐵 · 𝐶) = (∏𝑘 ∈ ∅ 𝐵 · ∏𝑘 ∈ ∅ 𝐶)
7 prodeq1 15241 . . . 4 (𝐴 = ∅ → ∏𝑘𝐴 (𝐵 · 𝐶) = ∏𝑘 ∈ ∅ (𝐵 · 𝐶))
8 prodeq1 15241 . . . . 5 (𝐴 = ∅ → ∏𝑘𝐴 𝐵 = ∏𝑘 ∈ ∅ 𝐵)
9 prodeq1 15241 . . . . 5 (𝐴 = ∅ → ∏𝑘𝐴 𝐶 = ∏𝑘 ∈ ∅ 𝐶)
108, 9oveq12d 7149 . . . 4 (𝐴 = ∅ → (∏𝑘𝐴 𝐵 · ∏𝑘𝐴 𝐶) = (∏𝑘 ∈ ∅ 𝐵 · ∏𝑘 ∈ ∅ 𝐶))
116, 7, 103eqtr4a 2881 . . 3 (𝐴 = ∅ → ∏𝑘𝐴 (𝐵 · 𝐶) = (∏𝑘𝐴 𝐵 · ∏𝑘𝐴 𝐶))
1211a1i 11 . 2 (𝜑 → (𝐴 = ∅ → ∏𝑘𝐴 (𝐵 · 𝐶) = (∏𝑘𝐴 𝐵 · ∏𝑘𝐴 𝐶)))
13 simprl 769 . . . . . . . . 9 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → (♯‘𝐴) ∈ ℕ)
14 nnuz 12258 . . . . . . . . 9 ℕ = (ℤ‘1)
1513, 14eleqtrdi 2921 . . . . . . . 8 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → (♯‘𝐴) ∈ (ℤ‘1))
16 fprodmul.2 . . . . . . . . . . . 12 ((𝜑𝑘𝐴) → 𝐵 ∈ ℂ)
1716fmpttd 6853 . . . . . . . . . . 11 (𝜑 → (𝑘𝐴𝐵):𝐴⟶ℂ)
1817adantr 483 . . . . . . . . . 10 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → (𝑘𝐴𝐵):𝐴⟶ℂ)
19 f1of 6589 . . . . . . . . . . 11 (𝑓:(1...(♯‘𝐴))–1-1-onto𝐴𝑓:(1...(♯‘𝐴))⟶𝐴)
2019ad2antll 727 . . . . . . . . . 10 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → 𝑓:(1...(♯‘𝐴))⟶𝐴)
21 fco 6505 . . . . . . . . . 10 (((𝑘𝐴𝐵):𝐴⟶ℂ ∧ 𝑓:(1...(♯‘𝐴))⟶𝐴) → ((𝑘𝐴𝐵) ∘ 𝑓):(1...(♯‘𝐴))⟶ℂ)
2218, 20, 21syl2anc 586 . . . . . . . . 9 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → ((𝑘𝐴𝐵) ∘ 𝑓):(1...(♯‘𝐴))⟶ℂ)
2322ffvelrnda 6825 . . . . . . . 8 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑛 ∈ (1...(♯‘𝐴))) → (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑛) ∈ ℂ)
24 fprodmul.3 . . . . . . . . . . . 12 ((𝜑𝑘𝐴) → 𝐶 ∈ ℂ)
2524fmpttd 6853 . . . . . . . . . . 11 (𝜑 → (𝑘𝐴𝐶):𝐴⟶ℂ)
2625adantr 483 . . . . . . . . . 10 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → (𝑘𝐴𝐶):𝐴⟶ℂ)
27 fco 6505 . . . . . . . . . 10 (((𝑘𝐴𝐶):𝐴⟶ℂ ∧ 𝑓:(1...(♯‘𝐴))⟶𝐴) → ((𝑘𝐴𝐶) ∘ 𝑓):(1...(♯‘𝐴))⟶ℂ)
2826, 20, 27syl2anc 586 . . . . . . . . 9 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → ((𝑘𝐴𝐶) ∘ 𝑓):(1...(♯‘𝐴))⟶ℂ)
2928ffvelrnda 6825 . . . . . . . 8 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑛 ∈ (1...(♯‘𝐴))) → (((𝑘𝐴𝐶) ∘ 𝑓)‘𝑛) ∈ ℂ)
3020ffvelrnda 6825 . . . . . . . . . 10 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑛 ∈ (1...(♯‘𝐴))) → (𝑓𝑛) ∈ 𝐴)
31 simpr 487 . . . . . . . . . . . . . 14 ((𝜑𝑘𝐴) → 𝑘𝐴)
3216, 24mulcld 10637 . . . . . . . . . . . . . 14 ((𝜑𝑘𝐴) → (𝐵 · 𝐶) ∈ ℂ)
33 eqid 2820 . . . . . . . . . . . . . . 15 (𝑘𝐴 ↦ (𝐵 · 𝐶)) = (𝑘𝐴 ↦ (𝐵 · 𝐶))
3433fvmpt2 6753 . . . . . . . . . . . . . 14 ((𝑘𝐴 ∧ (𝐵 · 𝐶) ∈ ℂ) → ((𝑘𝐴 ↦ (𝐵 · 𝐶))‘𝑘) = (𝐵 · 𝐶))
3531, 32, 34syl2anc 586 . . . . . . . . . . . . 13 ((𝜑𝑘𝐴) → ((𝑘𝐴 ↦ (𝐵 · 𝐶))‘𝑘) = (𝐵 · 𝐶))
36 eqid 2820 . . . . . . . . . . . . . . . 16 (𝑘𝐴𝐵) = (𝑘𝐴𝐵)
3736fvmpt2 6753 . . . . . . . . . . . . . . 15 ((𝑘𝐴𝐵 ∈ ℂ) → ((𝑘𝐴𝐵)‘𝑘) = 𝐵)
3831, 16, 37syl2anc 586 . . . . . . . . . . . . . 14 ((𝜑𝑘𝐴) → ((𝑘𝐴𝐵)‘𝑘) = 𝐵)
39 eqid 2820 . . . . . . . . . . . . . . . 16 (𝑘𝐴𝐶) = (𝑘𝐴𝐶)
4039fvmpt2 6753 . . . . . . . . . . . . . . 15 ((𝑘𝐴𝐶 ∈ ℂ) → ((𝑘𝐴𝐶)‘𝑘) = 𝐶)
4131, 24, 40syl2anc 586 . . . . . . . . . . . . . 14 ((𝜑𝑘𝐴) → ((𝑘𝐴𝐶)‘𝑘) = 𝐶)
4238, 41oveq12d 7149 . . . . . . . . . . . . 13 ((𝜑𝑘𝐴) → (((𝑘𝐴𝐵)‘𝑘) · ((𝑘𝐴𝐶)‘𝑘)) = (𝐵 · 𝐶))
4335, 42eqtr4d 2858 . . . . . . . . . . . 12 ((𝜑𝑘𝐴) → ((𝑘𝐴 ↦ (𝐵 · 𝐶))‘𝑘) = (((𝑘𝐴𝐵)‘𝑘) · ((𝑘𝐴𝐶)‘𝑘)))
4443ralrimiva 3169 . . . . . . . . . . 11 (𝜑 → ∀𝑘𝐴 ((𝑘𝐴 ↦ (𝐵 · 𝐶))‘𝑘) = (((𝑘𝐴𝐵)‘𝑘) · ((𝑘𝐴𝐶)‘𝑘)))
4544ad2antrr 724 . . . . . . . . . 10 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑛 ∈ (1...(♯‘𝐴))) → ∀𝑘𝐴 ((𝑘𝐴 ↦ (𝐵 · 𝐶))‘𝑘) = (((𝑘𝐴𝐵)‘𝑘) · ((𝑘𝐴𝐶)‘𝑘)))
46 nffvmpt1 6655 . . . . . . . . . . . 12 𝑘((𝑘𝐴 ↦ (𝐵 · 𝐶))‘(𝑓𝑛))
47 nffvmpt1 6655 . . . . . . . . . . . . 13 𝑘((𝑘𝐴𝐵)‘(𝑓𝑛))
48 nfcv 2973 . . . . . . . . . . . . 13 𝑘 ·
49 nffvmpt1 6655 . . . . . . . . . . . . 13 𝑘((𝑘𝐴𝐶)‘(𝑓𝑛))
5047, 48, 49nfov 7161 . . . . . . . . . . . 12 𝑘(((𝑘𝐴𝐵)‘(𝑓𝑛)) · ((𝑘𝐴𝐶)‘(𝑓𝑛)))
5146, 50nfeq 2986 . . . . . . . . . . 11 𝑘((𝑘𝐴 ↦ (𝐵 · 𝐶))‘(𝑓𝑛)) = (((𝑘𝐴𝐵)‘(𝑓𝑛)) · ((𝑘𝐴𝐶)‘(𝑓𝑛)))
52 fveq2 6644 . . . . . . . . . . . 12 (𝑘 = (𝑓𝑛) → ((𝑘𝐴 ↦ (𝐵 · 𝐶))‘𝑘) = ((𝑘𝐴 ↦ (𝐵 · 𝐶))‘(𝑓𝑛)))
53 fveq2 6644 . . . . . . . . . . . . 13 (𝑘 = (𝑓𝑛) → ((𝑘𝐴𝐵)‘𝑘) = ((𝑘𝐴𝐵)‘(𝑓𝑛)))
54 fveq2 6644 . . . . . . . . . . . . 13 (𝑘 = (𝑓𝑛) → ((𝑘𝐴𝐶)‘𝑘) = ((𝑘𝐴𝐶)‘(𝑓𝑛)))
5553, 54oveq12d 7149 . . . . . . . . . . . 12 (𝑘 = (𝑓𝑛) → (((𝑘𝐴𝐵)‘𝑘) · ((𝑘𝐴𝐶)‘𝑘)) = (((𝑘𝐴𝐵)‘(𝑓𝑛)) · ((𝑘𝐴𝐶)‘(𝑓𝑛))))
5652, 55eqeq12d 2836 . . . . . . . . . . 11 (𝑘 = (𝑓𝑛) → (((𝑘𝐴 ↦ (𝐵 · 𝐶))‘𝑘) = (((𝑘𝐴𝐵)‘𝑘) · ((𝑘𝐴𝐶)‘𝑘)) ↔ ((𝑘𝐴 ↦ (𝐵 · 𝐶))‘(𝑓𝑛)) = (((𝑘𝐴𝐵)‘(𝑓𝑛)) · ((𝑘𝐴𝐶)‘(𝑓𝑛)))))
5751, 56rspc 3590 . . . . . . . . . 10 ((𝑓𝑛) ∈ 𝐴 → (∀𝑘𝐴 ((𝑘𝐴 ↦ (𝐵 · 𝐶))‘𝑘) = (((𝑘𝐴𝐵)‘𝑘) · ((𝑘𝐴𝐶)‘𝑘)) → ((𝑘𝐴 ↦ (𝐵 · 𝐶))‘(𝑓𝑛)) = (((𝑘𝐴𝐵)‘(𝑓𝑛)) · ((𝑘𝐴𝐶)‘(𝑓𝑛)))))
5830, 45, 57sylc 65 . . . . . . . . 9 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑛 ∈ (1...(♯‘𝐴))) → ((𝑘𝐴 ↦ (𝐵 · 𝐶))‘(𝑓𝑛)) = (((𝑘𝐴𝐵)‘(𝑓𝑛)) · ((𝑘𝐴𝐶)‘(𝑓𝑛))))
59 fvco3 6734 . . . . . . . . . 10 ((𝑓:(1...(♯‘𝐴))⟶𝐴𝑛 ∈ (1...(♯‘𝐴))) → (((𝑘𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓)‘𝑛) = ((𝑘𝐴 ↦ (𝐵 · 𝐶))‘(𝑓𝑛)))
6020, 59sylan 582 . . . . . . . . 9 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑛 ∈ (1...(♯‘𝐴))) → (((𝑘𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓)‘𝑛) = ((𝑘𝐴 ↦ (𝐵 · 𝐶))‘(𝑓𝑛)))
61 fvco3 6734 . . . . . . . . . . 11 ((𝑓:(1...(♯‘𝐴))⟶𝐴𝑛 ∈ (1...(♯‘𝐴))) → (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑛) = ((𝑘𝐴𝐵)‘(𝑓𝑛)))
6220, 61sylan 582 . . . . . . . . . 10 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑛 ∈ (1...(♯‘𝐴))) → (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑛) = ((𝑘𝐴𝐵)‘(𝑓𝑛)))
63 fvco3 6734 . . . . . . . . . . 11 ((𝑓:(1...(♯‘𝐴))⟶𝐴𝑛 ∈ (1...(♯‘𝐴))) → (((𝑘𝐴𝐶) ∘ 𝑓)‘𝑛) = ((𝑘𝐴𝐶)‘(𝑓𝑛)))
6420, 63sylan 582 . . . . . . . . . 10 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑛 ∈ (1...(♯‘𝐴))) → (((𝑘𝐴𝐶) ∘ 𝑓)‘𝑛) = ((𝑘𝐴𝐶)‘(𝑓𝑛)))
6562, 64oveq12d 7149 . . . . . . . . 9 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑛 ∈ (1...(♯‘𝐴))) → ((((𝑘𝐴𝐵) ∘ 𝑓)‘𝑛) · (((𝑘𝐴𝐶) ∘ 𝑓)‘𝑛)) = (((𝑘𝐴𝐵)‘(𝑓𝑛)) · ((𝑘𝐴𝐶)‘(𝑓𝑛))))
6658, 60, 653eqtr4d 2865 . . . . . . . 8 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑛 ∈ (1...(♯‘𝐴))) → (((𝑘𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓)‘𝑛) = ((((𝑘𝐴𝐵) ∘ 𝑓)‘𝑛) · (((𝑘𝐴𝐶) ∘ 𝑓)‘𝑛)))
6715, 23, 29, 66prodfmul 15224 . . . . . . 7 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → (seq1( · , ((𝑘𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓))‘(♯‘𝐴)) = ((seq1( · , ((𝑘𝐴𝐵) ∘ 𝑓))‘(♯‘𝐴)) · (seq1( · , ((𝑘𝐴𝐶) ∘ 𝑓))‘(♯‘𝐴))))
68 fveq2 6644 . . . . . . . 8 (𝑚 = (𝑓𝑛) → ((𝑘𝐴 ↦ (𝐵 · 𝐶))‘𝑚) = ((𝑘𝐴 ↦ (𝐵 · 𝐶))‘(𝑓𝑛)))
69 simprr 771 . . . . . . . 8 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)
7032fmpttd 6853 . . . . . . . . . 10 (𝜑 → (𝑘𝐴 ↦ (𝐵 · 𝐶)):𝐴⟶ℂ)
7170adantr 483 . . . . . . . . 9 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → (𝑘𝐴 ↦ (𝐵 · 𝐶)):𝐴⟶ℂ)
7271ffvelrnda 6825 . . . . . . . 8 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑚𝐴) → ((𝑘𝐴 ↦ (𝐵 · 𝐶))‘𝑚) ∈ ℂ)
7368, 13, 69, 72, 60fprod 15273 . . . . . . 7 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → ∏𝑚𝐴 ((𝑘𝐴 ↦ (𝐵 · 𝐶))‘𝑚) = (seq1( · , ((𝑘𝐴 ↦ (𝐵 · 𝐶)) ∘ 𝑓))‘(♯‘𝐴)))
74 fveq2 6644 . . . . . . . . 9 (𝑚 = (𝑓𝑛) → ((𝑘𝐴𝐵)‘𝑚) = ((𝑘𝐴𝐵)‘(𝑓𝑛)))
7518ffvelrnda 6825 . . . . . . . . 9 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑚𝐴) → ((𝑘𝐴𝐵)‘𝑚) ∈ ℂ)
7674, 13, 69, 75, 62fprod 15273 . . . . . . . 8 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → ∏𝑚𝐴 ((𝑘𝐴𝐵)‘𝑚) = (seq1( · , ((𝑘𝐴𝐵) ∘ 𝑓))‘(♯‘𝐴)))
77 fveq2 6644 . . . . . . . . 9 (𝑚 = (𝑓𝑛) → ((𝑘𝐴𝐶)‘𝑚) = ((𝑘𝐴𝐶)‘(𝑓𝑛)))
7826ffvelrnda 6825 . . . . . . . . 9 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑚𝐴) → ((𝑘𝐴𝐶)‘𝑚) ∈ ℂ)
7977, 13, 69, 78, 64fprod 15273 . . . . . . . 8 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → ∏𝑚𝐴 ((𝑘𝐴𝐶)‘𝑚) = (seq1( · , ((𝑘𝐴𝐶) ∘ 𝑓))‘(♯‘𝐴)))
8076, 79oveq12d 7149 . . . . . . 7 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → (∏𝑚𝐴 ((𝑘𝐴𝐵)‘𝑚) · ∏𝑚𝐴 ((𝑘𝐴𝐶)‘𝑚)) = ((seq1( · , ((𝑘𝐴𝐵) ∘ 𝑓))‘(♯‘𝐴)) · (seq1( · , ((𝑘𝐴𝐶) ∘ 𝑓))‘(♯‘𝐴))))
8167, 73, 803eqtr4d 2865 . . . . . 6 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → ∏𝑚𝐴 ((𝑘𝐴 ↦ (𝐵 · 𝐶))‘𝑚) = (∏𝑚𝐴 ((𝑘𝐴𝐵)‘𝑚) · ∏𝑚𝐴 ((𝑘𝐴𝐶)‘𝑚)))
82 prodfc 15277 . . . . . 6 𝑚𝐴 ((𝑘𝐴 ↦ (𝐵 · 𝐶))‘𝑚) = ∏𝑘𝐴 (𝐵 · 𝐶)
83 prodfc 15277 . . . . . . 7 𝑚𝐴 ((𝑘𝐴𝐵)‘𝑚) = ∏𝑘𝐴 𝐵
84 prodfc 15277 . . . . . . 7 𝑚𝐴 ((𝑘𝐴𝐶)‘𝑚) = ∏𝑘𝐴 𝐶
8583, 84oveq12i 7143 . . . . . 6 (∏𝑚𝐴 ((𝑘𝐴𝐵)‘𝑚) · ∏𝑚𝐴 ((𝑘𝐴𝐶)‘𝑚)) = (∏𝑘𝐴 𝐵 · ∏𝑘𝐴 𝐶)
8681, 82, 853eqtr3g 2878 . . . . 5 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → ∏𝑘𝐴 (𝐵 · 𝐶) = (∏𝑘𝐴 𝐵 · ∏𝑘𝐴 𝐶))
8786expr 459 . . . 4 ((𝜑 ∧ (♯‘𝐴) ∈ ℕ) → (𝑓:(1...(♯‘𝐴))–1-1-onto𝐴 → ∏𝑘𝐴 (𝐵 · 𝐶) = (∏𝑘𝐴 𝐵 · ∏𝑘𝐴 𝐶)))
8887exlimdv 1934 . . 3 ((𝜑 ∧ (♯‘𝐴) ∈ ℕ) → (∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴 → ∏𝑘𝐴 (𝐵 · 𝐶) = (∏𝑘𝐴 𝐵 · ∏𝑘𝐴 𝐶)))
8988expimpd 456 . 2 (𝜑 → (((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴) → ∏𝑘𝐴 (𝐵 · 𝐶) = (∏𝑘𝐴 𝐵 · ∏𝑘𝐴 𝐶)))
90 fprodmul.1 . . 3 (𝜑𝐴 ∈ Fin)
91 fz1f1o 15045 . . 3 (𝐴 ∈ Fin → (𝐴 = ∅ ∨ ((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)))
9290, 91syl 17 . 2 (𝜑 → (𝐴 = ∅ ∨ ((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)))
9312, 89, 92mpjaod 856 1 (𝜑 → ∏𝑘𝐴 (𝐵 · 𝐶) = (∏𝑘𝐴 𝐵 · ∏𝑘𝐴 𝐶))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398  wo 843   = wceq 1537  wex 1780  wcel 2114  wral 3125  c0 4267  cmpt 5120  ccom 5533  wf 6325  1-1-ontowf1o 6328  cfv 6329  (class class class)co 7131  Fincfn 8485  cc 10511  1c1 10514   · cmul 10518  cn 11614  cuz 12220  ...cfz 12874  seqcseq 13351  chash 13673  cprod 15237
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2792  ax-rep 5164  ax-sep 5177  ax-nul 5184  ax-pow 5240  ax-pr 5304  ax-un 7437  ax-inf2 9080  ax-cnex 10569  ax-resscn 10570  ax-1cn 10571  ax-icn 10572  ax-addcl 10573  ax-addrcl 10574  ax-mulcl 10575  ax-mulrcl 10576  ax-mulcom 10577  ax-addass 10578  ax-mulass 10579  ax-distr 10580  ax-i2m1 10581  ax-1ne0 10582  ax-1rid 10583  ax-rnegex 10584  ax-rrecex 10585  ax-cnre 10586  ax-pre-lttri 10587  ax-pre-lttrn 10588  ax-pre-ltadd 10589  ax-pre-mulgt0 10590  ax-pre-sup 10591
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-fal 1550  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2653  df-clab 2799  df-cleq 2813  df-clel 2891  df-nfc 2959  df-ne 3007  df-nel 3111  df-ral 3130  df-rex 3131  df-reu 3132  df-rmo 3133  df-rab 3134  df-v 3475  df-sbc 3752  df-csb 3860  df-dif 3915  df-un 3917  df-in 3919  df-ss 3928  df-pss 3930  df-nul 4268  df-if 4442  df-pw 4515  df-sn 4542  df-pr 4544  df-tp 4546  df-op 4548  df-uni 4813  df-int 4851  df-iun 4895  df-br 5041  df-opab 5103  df-mpt 5121  df-tr 5147  df-id 5434  df-eprel 5439  df-po 5448  df-so 5449  df-fr 5488  df-se 5489  df-we 5490  df-xp 5535  df-rel 5536  df-cnv 5537  df-co 5538  df-dm 5539  df-rn 5540  df-res 5541  df-ima 5542  df-pred 6122  df-ord 6168  df-on 6169  df-lim 6170  df-suc 6171  df-iota 6288  df-fun 6331  df-fn 6332  df-f 6333  df-f1 6334  df-fo 6335  df-f1o 6336  df-fv 6337  df-isom 6338  df-riota 7089  df-ov 7134  df-oprab 7135  df-mpo 7136  df-om 7557  df-1st 7665  df-2nd 7666  df-wrecs 7923  df-recs 7984  df-rdg 8022  df-1o 8078  df-oadd 8082  df-er 8265  df-en 8486  df-dom 8487  df-sdom 8488  df-fin 8489  df-sup 8882  df-oi 8950  df-card 9344  df-pnf 10653  df-mnf 10654  df-xr 10655  df-ltxr 10656  df-le 10657  df-sub 10848  df-neg 10849  df-div 11274  df-nn 11615  df-2 11677  df-3 11678  df-n0 11875  df-z 11959  df-uz 12221  df-rp 12367  df-fz 12875  df-fzo 13016  df-seq 13352  df-exp 13413  df-hash 13674  df-cj 14436  df-re 14437  df-im 14438  df-sqrt 14572  df-abs 14573  df-clim 14823  df-prod 15238
This theorem is referenced by:  fprodsplit  15298  risefallfac  15356  gausslemma2dlem5  25931  gausslemma2dlem6  25932  bcprod  32975
  Copyright terms: Public domain W3C validator