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

Theorem fprodss 15305
Description: Change the index set to a subset in a finite sum. (Contributed by Scott Fenton, 16-Dec-2017.)
Hypotheses
Ref Expression
fprodss.1 (𝜑𝐴𝐵)
fprodss.2 ((𝜑𝑘𝐴) → 𝐶 ∈ ℂ)
fprodss.3 ((𝜑𝑘 ∈ (𝐵𝐴)) → 𝐶 = 1)
fprodss.4 (𝜑𝐵 ∈ Fin)
Assertion
Ref Expression
fprodss (𝜑 → ∏𝑘𝐴 𝐶 = ∏𝑘𝐵 𝐶)
Distinct variable groups:   𝐴,𝑘   𝐵,𝑘   𝜑,𝑘
Allowed substitution hint:   𝐶(𝑘)

Proof of Theorem fprodss
Dummy variables 𝑓 𝑚 𝑛 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fprodss.1 . . 3 (𝜑𝐴𝐵)
2 sseq2 3996 . . . . 5 (𝐵 = ∅ → (𝐴𝐵𝐴 ⊆ ∅))
3 ss0 4355 . . . . 5 (𝐴 ⊆ ∅ → 𝐴 = ∅)
42, 3syl6bi 255 . . . 4 (𝐵 = ∅ → (𝐴𝐵𝐴 = ∅))
5 prodeq1 15266 . . . . . 6 (𝐴 = ∅ → ∏𝑘𝐴 𝐶 = ∏𝑘 ∈ ∅ 𝐶)
6 prodeq1 15266 . . . . . . 7 (𝐵 = ∅ → ∏𝑘𝐵 𝐶 = ∏𝑘 ∈ ∅ 𝐶)
76eqcomd 2830 . . . . . 6 (𝐵 = ∅ → ∏𝑘 ∈ ∅ 𝐶 = ∏𝑘𝐵 𝐶)
85, 7sylan9eq 2879 . . . . 5 ((𝐴 = ∅ ∧ 𝐵 = ∅) → ∏𝑘𝐴 𝐶 = ∏𝑘𝐵 𝐶)
98expcom 416 . . . 4 (𝐵 = ∅ → (𝐴 = ∅ → ∏𝑘𝐴 𝐶 = ∏𝑘𝐵 𝐶))
104, 9syld 47 . . 3 (𝐵 = ∅ → (𝐴𝐵 → ∏𝑘𝐴 𝐶 = ∏𝑘𝐵 𝐶))
111, 10syl5com 31 . 2 (𝜑 → (𝐵 = ∅ → ∏𝑘𝐴 𝐶 = ∏𝑘𝐵 𝐶))
12 cnvimass 5952 . . . . . . . . 9 (𝑓𝐴) ⊆ dom 𝑓
13 simprr 771 . . . . . . . . . 10 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)
14 f1of 6618 . . . . . . . . . 10 (𝑓:(1...(♯‘𝐵))–1-1-onto𝐵𝑓:(1...(♯‘𝐵))⟶𝐵)
1513, 14syl 17 . . . . . . . . 9 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → 𝑓:(1...(♯‘𝐵))⟶𝐵)
1612, 15fssdm 6533 . . . . . . . 8 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → (𝑓𝐴) ⊆ (1...(♯‘𝐵)))
17 f1ofn 6619 . . . . . . . . . . . 12 (𝑓:(1...(♯‘𝐵))–1-1-onto𝐵𝑓 Fn (1...(♯‘𝐵)))
18 elpreima 6831 . . . . . . . . . . . 12 (𝑓 Fn (1...(♯‘𝐵)) → (𝑛 ∈ (𝑓𝐴) ↔ (𝑛 ∈ (1...(♯‘𝐵)) ∧ (𝑓𝑛) ∈ 𝐴)))
1913, 17, 183syl 18 . . . . . . . . . . 11 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → (𝑛 ∈ (𝑓𝐴) ↔ (𝑛 ∈ (1...(♯‘𝐵)) ∧ (𝑓𝑛) ∈ 𝐴)))
2015ffvelrnda 6854 . . . . . . . . . . . . 13 (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) ∧ 𝑛 ∈ (1...(♯‘𝐵))) → (𝑓𝑛) ∈ 𝐵)
2120ex 415 . . . . . . . . . . . 12 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → (𝑛 ∈ (1...(♯‘𝐵)) → (𝑓𝑛) ∈ 𝐵))
2221adantrd 494 . . . . . . . . . . 11 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → ((𝑛 ∈ (1...(♯‘𝐵)) ∧ (𝑓𝑛) ∈ 𝐴) → (𝑓𝑛) ∈ 𝐵))
2319, 22sylbid 242 . . . . . . . . . 10 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → (𝑛 ∈ (𝑓𝐴) → (𝑓𝑛) ∈ 𝐵))
2423imp 409 . . . . . . . . 9 (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) ∧ 𝑛 ∈ (𝑓𝐴)) → (𝑓𝑛) ∈ 𝐵)
25 fprodss.2 . . . . . . . . . . . . . . 15 ((𝜑𝑘𝐴) → 𝐶 ∈ ℂ)
2625ex 415 . . . . . . . . . . . . . 14 (𝜑 → (𝑘𝐴𝐶 ∈ ℂ))
2726adantr 483 . . . . . . . . . . . . 13 ((𝜑𝑘𝐵) → (𝑘𝐴𝐶 ∈ ℂ))
28 eldif 3949 . . . . . . . . . . . . . . 15 (𝑘 ∈ (𝐵𝐴) ↔ (𝑘𝐵 ∧ ¬ 𝑘𝐴))
29 fprodss.3 . . . . . . . . . . . . . . . 16 ((𝜑𝑘 ∈ (𝐵𝐴)) → 𝐶 = 1)
30 ax-1cn 10598 . . . . . . . . . . . . . . . 16 1 ∈ ℂ
3129, 30eqeltrdi 2924 . . . . . . . . . . . . . . 15 ((𝜑𝑘 ∈ (𝐵𝐴)) → 𝐶 ∈ ℂ)
3228, 31sylan2br 596 . . . . . . . . . . . . . 14 ((𝜑 ∧ (𝑘𝐵 ∧ ¬ 𝑘𝐴)) → 𝐶 ∈ ℂ)
3332expr 459 . . . . . . . . . . . . 13 ((𝜑𝑘𝐵) → (¬ 𝑘𝐴𝐶 ∈ ℂ))
3427, 33pm2.61d 181 . . . . . . . . . . . 12 ((𝜑𝑘𝐵) → 𝐶 ∈ ℂ)
3534adantlr 713 . . . . . . . . . . 11 (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) ∧ 𝑘𝐵) → 𝐶 ∈ ℂ)
3635fmpttd 6882 . . . . . . . . . 10 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → (𝑘𝐵𝐶):𝐵⟶ℂ)
3736ffvelrnda 6854 . . . . . . . . 9 (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) ∧ (𝑓𝑛) ∈ 𝐵) → ((𝑘𝐵𝐶)‘(𝑓𝑛)) ∈ ℂ)
3824, 37syldan 593 . . . . . . . 8 (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) ∧ 𝑛 ∈ (𝑓𝐴)) → ((𝑘𝐵𝐶)‘(𝑓𝑛)) ∈ ℂ)
39 eqid 2824 . . . . . . . . 9 (ℤ‘1) = (ℤ‘1)
40 simprl 769 . . . . . . . . . 10 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → (♯‘𝐵) ∈ ℕ)
41 nnuz 12284 . . . . . . . . . 10 ℕ = (ℤ‘1)
4240, 41eleqtrdi 2926 . . . . . . . . 9 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → (♯‘𝐵) ∈ (ℤ‘1))
43 ssidd 3993 . . . . . . . . 9 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → (1...(♯‘𝐵)) ⊆ (1...(♯‘𝐵)))
4439, 42, 43fprodntriv 15299 . . . . . . . 8 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → ∃𝑚 ∈ (ℤ‘1)∃𝑦(𝑦 ≠ 0 ∧ seq𝑚( · , (𝑛 ∈ (ℤ‘1) ↦ if(𝑛 ∈ (1...(♯‘𝐵)), ((𝑘𝐵𝐶)‘(𝑓𝑛)), 1))) ⇝ 𝑦))
45 eldifi 4106 . . . . . . . . . . . 12 (𝑛 ∈ ((1...(♯‘𝐵)) ∖ (𝑓𝐴)) → 𝑛 ∈ (1...(♯‘𝐵)))
4645, 20sylan2 594 . . . . . . . . . . 11 (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (𝑓𝐴))) → (𝑓𝑛) ∈ 𝐵)
47 eldifn 4107 . . . . . . . . . . . . 13 (𝑛 ∈ ((1...(♯‘𝐵)) ∖ (𝑓𝐴)) → ¬ 𝑛 ∈ (𝑓𝐴))
4847adantl 484 . . . . . . . . . . . 12 (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (𝑓𝐴))) → ¬ 𝑛 ∈ (𝑓𝐴))
4945adantl 484 . . . . . . . . . . . . 13 (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (𝑓𝐴))) → 𝑛 ∈ (1...(♯‘𝐵)))
5019adantr 483 . . . . . . . . . . . . 13 (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (𝑓𝐴))) → (𝑛 ∈ (𝑓𝐴) ↔ (𝑛 ∈ (1...(♯‘𝐵)) ∧ (𝑓𝑛) ∈ 𝐴)))
5149, 50mpbirand 705 . . . . . . . . . . . 12 (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (𝑓𝐴))) → (𝑛 ∈ (𝑓𝐴) ↔ (𝑓𝑛) ∈ 𝐴))
5248, 51mtbid 326 . . . . . . . . . . 11 (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (𝑓𝐴))) → ¬ (𝑓𝑛) ∈ 𝐴)
5346, 52eldifd 3950 . . . . . . . . . 10 (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (𝑓𝐴))) → (𝑓𝑛) ∈ (𝐵𝐴))
54 difss 4111 . . . . . . . . . . . . 13 (𝐵𝐴) ⊆ 𝐵
55 resmpt 5908 . . . . . . . . . . . . 13 ((𝐵𝐴) ⊆ 𝐵 → ((𝑘𝐵𝐶) ↾ (𝐵𝐴)) = (𝑘 ∈ (𝐵𝐴) ↦ 𝐶))
5654, 55ax-mp 5 . . . . . . . . . . . 12 ((𝑘𝐵𝐶) ↾ (𝐵𝐴)) = (𝑘 ∈ (𝐵𝐴) ↦ 𝐶)
5756fveq1i 6674 . . . . . . . . . . 11 (((𝑘𝐵𝐶) ↾ (𝐵𝐴))‘(𝑓𝑛)) = ((𝑘 ∈ (𝐵𝐴) ↦ 𝐶)‘(𝑓𝑛))
58 fvres 6692 . . . . . . . . . . 11 ((𝑓𝑛) ∈ (𝐵𝐴) → (((𝑘𝐵𝐶) ↾ (𝐵𝐴))‘(𝑓𝑛)) = ((𝑘𝐵𝐶)‘(𝑓𝑛)))
5957, 58syl5eqr 2873 . . . . . . . . . 10 ((𝑓𝑛) ∈ (𝐵𝐴) → ((𝑘 ∈ (𝐵𝐴) ↦ 𝐶)‘(𝑓𝑛)) = ((𝑘𝐵𝐶)‘(𝑓𝑛)))
6053, 59syl 17 . . . . . . . . 9 (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (𝑓𝐴))) → ((𝑘 ∈ (𝐵𝐴) ↦ 𝐶)‘(𝑓𝑛)) = ((𝑘𝐵𝐶)‘(𝑓𝑛)))
61 1ex 10640 . . . . . . . . . . . . . . 15 1 ∈ V
6261elsn2 4607 . . . . . . . . . . . . . 14 (𝐶 ∈ {1} ↔ 𝐶 = 1)
6329, 62sylibr 236 . . . . . . . . . . . . 13 ((𝜑𝑘 ∈ (𝐵𝐴)) → 𝐶 ∈ {1})
6463fmpttd 6882 . . . . . . . . . . . 12 (𝜑 → (𝑘 ∈ (𝐵𝐴) ↦ 𝐶):(𝐵𝐴)⟶{1})
6564ad2antrr 724 . . . . . . . . . . 11 (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (𝑓𝐴))) → (𝑘 ∈ (𝐵𝐴) ↦ 𝐶):(𝐵𝐴)⟶{1})
6665, 53ffvelrnd 6855 . . . . . . . . . 10 (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (𝑓𝐴))) → ((𝑘 ∈ (𝐵𝐴) ↦ 𝐶)‘(𝑓𝑛)) ∈ {1})
67 elsni 4587 . . . . . . . . . 10 (((𝑘 ∈ (𝐵𝐴) ↦ 𝐶)‘(𝑓𝑛)) ∈ {1} → ((𝑘 ∈ (𝐵𝐴) ↦ 𝐶)‘(𝑓𝑛)) = 1)
6866, 67syl 17 . . . . . . . . 9 (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (𝑓𝐴))) → ((𝑘 ∈ (𝐵𝐴) ↦ 𝐶)‘(𝑓𝑛)) = 1)
6960, 68eqtr3d 2861 . . . . . . . 8 (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (𝑓𝐴))) → ((𝑘𝐵𝐶)‘(𝑓𝑛)) = 1)
70 fzssuz 12951 . . . . . . . . 9 (1...(♯‘𝐵)) ⊆ (ℤ‘1)
7170a1i 11 . . . . . . . 8 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → (1...(♯‘𝐵)) ⊆ (ℤ‘1))
7216, 38, 44, 69, 71prodss 15304 . . . . . . 7 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → ∏𝑛 ∈ (𝑓𝐴)((𝑘𝐵𝐶)‘(𝑓𝑛)) = ∏𝑛 ∈ (1...(♯‘𝐵))((𝑘𝐵𝐶)‘(𝑓𝑛)))
731adantr 483 . . . . . . . . . . . 12 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → 𝐴𝐵)
7473resmptd 5911 . . . . . . . . . . 11 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → ((𝑘𝐵𝐶) ↾ 𝐴) = (𝑘𝐴𝐶))
7574fveq1d 6675 . . . . . . . . . 10 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → (((𝑘𝐵𝐶) ↾ 𝐴)‘𝑚) = ((𝑘𝐴𝐶)‘𝑚))
76 fvres 6692 . . . . . . . . . 10 (𝑚𝐴 → (((𝑘𝐵𝐶) ↾ 𝐴)‘𝑚) = ((𝑘𝐵𝐶)‘𝑚))
7775, 76sylan9req 2880 . . . . . . . . 9 (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) ∧ 𝑚𝐴) → ((𝑘𝐴𝐶)‘𝑚) = ((𝑘𝐵𝐶)‘𝑚))
7877prodeq2dv 15280 . . . . . . . 8 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → ∏𝑚𝐴 ((𝑘𝐴𝐶)‘𝑚) = ∏𝑚𝐴 ((𝑘𝐵𝐶)‘𝑚))
79 fveq2 6673 . . . . . . . . 9 (𝑚 = (𝑓𝑛) → ((𝑘𝐵𝐶)‘𝑚) = ((𝑘𝐵𝐶)‘(𝑓𝑛)))
80 fzfid 13344 . . . . . . . . . 10 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → (1...(♯‘𝐵)) ∈ Fin)
8180, 15fisuppfi 8844 . . . . . . . . 9 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → (𝑓𝐴) ∈ Fin)
82 f1of1 6617 . . . . . . . . . . . 12 (𝑓:(1...(♯‘𝐵))–1-1-onto𝐵𝑓:(1...(♯‘𝐵))–1-1𝐵)
8313, 82syl 17 . . . . . . . . . . 11 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → 𝑓:(1...(♯‘𝐵))–1-1𝐵)
84 f1ores 6632 . . . . . . . . . . 11 ((𝑓:(1...(♯‘𝐵))–1-1𝐵 ∧ (𝑓𝐴) ⊆ (1...(♯‘𝐵))) → (𝑓 ↾ (𝑓𝐴)):(𝑓𝐴)–1-1-onto→(𝑓 “ (𝑓𝐴)))
8583, 16, 84syl2anc 586 . . . . . . . . . 10 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → (𝑓 ↾ (𝑓𝐴)):(𝑓𝐴)–1-1-onto→(𝑓 “ (𝑓𝐴)))
86 f1ofo 6625 . . . . . . . . . . . . 13 (𝑓:(1...(♯‘𝐵))–1-1-onto𝐵𝑓:(1...(♯‘𝐵))–onto𝐵)
8713, 86syl 17 . . . . . . . . . . . 12 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → 𝑓:(1...(♯‘𝐵))–onto𝐵)
88 foimacnv 6635 . . . . . . . . . . . 12 ((𝑓:(1...(♯‘𝐵))–onto𝐵𝐴𝐵) → (𝑓 “ (𝑓𝐴)) = 𝐴)
8987, 73, 88syl2anc 586 . . . . . . . . . . 11 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → (𝑓 “ (𝑓𝐴)) = 𝐴)
9089f1oeq3d 6615 . . . . . . . . . 10 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → ((𝑓 ↾ (𝑓𝐴)):(𝑓𝐴)–1-1-onto→(𝑓 “ (𝑓𝐴)) ↔ (𝑓 ↾ (𝑓𝐴)):(𝑓𝐴)–1-1-onto𝐴))
9185, 90mpbid 234 . . . . . . . . 9 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → (𝑓 ↾ (𝑓𝐴)):(𝑓𝐴)–1-1-onto𝐴)
92 fvres 6692 . . . . . . . . . 10 (𝑛 ∈ (𝑓𝐴) → ((𝑓 ↾ (𝑓𝐴))‘𝑛) = (𝑓𝑛))
9392adantl 484 . . . . . . . . 9 (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) ∧ 𝑛 ∈ (𝑓𝐴)) → ((𝑓 ↾ (𝑓𝐴))‘𝑛) = (𝑓𝑛))
9473sselda 3970 . . . . . . . . . 10 (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) ∧ 𝑚𝐴) → 𝑚𝐵)
9536ffvelrnda 6854 . . . . . . . . . 10 (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) ∧ 𝑚𝐵) → ((𝑘𝐵𝐶)‘𝑚) ∈ ℂ)
9694, 95syldan 593 . . . . . . . . 9 (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) ∧ 𝑚𝐴) → ((𝑘𝐵𝐶)‘𝑚) ∈ ℂ)
9779, 81, 91, 93, 96fprodf1o 15303 . . . . . . . 8 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → ∏𝑚𝐴 ((𝑘𝐵𝐶)‘𝑚) = ∏𝑛 ∈ (𝑓𝐴)((𝑘𝐵𝐶)‘(𝑓𝑛)))
9878, 97eqtrd 2859 . . . . . . 7 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → ∏𝑚𝐴 ((𝑘𝐴𝐶)‘𝑚) = ∏𝑛 ∈ (𝑓𝐴)((𝑘𝐵𝐶)‘(𝑓𝑛)))
99 eqidd 2825 . . . . . . . 8 (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) ∧ 𝑛 ∈ (1...(♯‘𝐵))) → (𝑓𝑛) = (𝑓𝑛))
10079, 80, 13, 99, 95fprodf1o 15303 . . . . . . 7 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → ∏𝑚𝐵 ((𝑘𝐵𝐶)‘𝑚) = ∏𝑛 ∈ (1...(♯‘𝐵))((𝑘𝐵𝐶)‘(𝑓𝑛)))
10172, 98, 1003eqtr4d 2869 . . . . . 6 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → ∏𝑚𝐴 ((𝑘𝐴𝐶)‘𝑚) = ∏𝑚𝐵 ((𝑘𝐵𝐶)‘𝑚))
102 prodfc 15302 . . . . . 6 𝑚𝐴 ((𝑘𝐴𝐶)‘𝑚) = ∏𝑘𝐴 𝐶
103 prodfc 15302 . . . . . 6 𝑚𝐵 ((𝑘𝐵𝐶)‘𝑚) = ∏𝑘𝐵 𝐶
104101, 102, 1033eqtr3g 2882 . . . . 5 ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)) → ∏𝑘𝐴 𝐶 = ∏𝑘𝐵 𝐶)
105104expr 459 . . . 4 ((𝜑 ∧ (♯‘𝐵) ∈ ℕ) → (𝑓:(1...(♯‘𝐵))–1-1-onto𝐵 → ∏𝑘𝐴 𝐶 = ∏𝑘𝐵 𝐶))
106105exlimdv 1933 . . 3 ((𝜑 ∧ (♯‘𝐵) ∈ ℕ) → (∃𝑓 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵 → ∏𝑘𝐴 𝐶 = ∏𝑘𝐵 𝐶))
107106expimpd 456 . 2 (𝜑 → (((♯‘𝐵) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵) → ∏𝑘𝐴 𝐶 = ∏𝑘𝐵 𝐶))
108 fprodss.4 . . 3 (𝜑𝐵 ∈ Fin)
109 fz1f1o 15070 . . 3 (𝐵 ∈ Fin → (𝐵 = ∅ ∨ ((♯‘𝐵) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)))
110108, 109syl 17 . 2 (𝜑 → (𝐵 = ∅ ∨ ((♯‘𝐵) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐵))–1-1-onto𝐵)))
11111, 107, 110mpjaod 856 1 (𝜑 → ∏𝑘𝐴 𝐶 = ∏𝑘𝐵 𝐶)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208  wa 398  wo 843   = wceq 1536  wex 1779  wcel 2113  cdif 3936  wss 3939  c0 4294  {csn 4570  cmpt 5149  ccnv 5557  cres 5560  cima 5561   Fn wfn 6353  wf 6354  1-1wf1 6355  ontowfo 6356  1-1-ontowf1o 6357  cfv 6358  (class class class)co 7159  Fincfn 8512  cc 10538  1c1 10541  cn 11641  cuz 12246  ...cfz 12895  chash 13693  cprod 15262
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-rep 5193  ax-sep 5206  ax-nul 5213  ax-pow 5269  ax-pr 5333  ax-un 7464  ax-inf2 9107  ax-cnex 10596  ax-resscn 10597  ax-1cn 10598  ax-icn 10599  ax-addcl 10600  ax-addrcl 10601  ax-mulcl 10602  ax-mulrcl 10603  ax-mulcom 10604  ax-addass 10605  ax-mulass 10606  ax-distr 10607  ax-i2m1 10608  ax-1ne0 10609  ax-1rid 10610  ax-rnegex 10611  ax-rrecex 10612  ax-cnre 10613  ax-pre-lttri 10614  ax-pre-lttrn 10615  ax-pre-ltadd 10616  ax-pre-mulgt0 10617  ax-pre-sup 10618
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1539  df-fal 1549  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ne 3020  df-nel 3127  df-ral 3146  df-rex 3147  df-reu 3148  df-rmo 3149  df-rab 3150  df-v 3499  df-sbc 3776  df-csb 3887  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-pss 3957  df-nul 4295  df-if 4471  df-pw 4544  df-sn 4571  df-pr 4573  df-tp 4575  df-op 4577  df-uni 4842  df-int 4880  df-iun 4924  df-br 5070  df-opab 5132  df-mpt 5150  df-tr 5176  df-id 5463  df-eprel 5468  df-po 5477  df-so 5478  df-fr 5517  df-se 5518  df-we 5519  df-xp 5564  df-rel 5565  df-cnv 5566  df-co 5567  df-dm 5568  df-rn 5569  df-res 5570  df-ima 5571  df-pred 6151  df-ord 6197  df-on 6198  df-lim 6199  df-suc 6200  df-iota 6317  df-fun 6360  df-fn 6361  df-f 6362  df-f1 6363  df-fo 6364  df-f1o 6365  df-fv 6366  df-isom 6367  df-riota 7117  df-ov 7162  df-oprab 7163  df-mpo 7164  df-om 7584  df-1st 7692  df-2nd 7693  df-wrecs 7950  df-recs 8011  df-rdg 8049  df-1o 8105  df-oadd 8109  df-er 8292  df-en 8513  df-dom 8514  df-sdom 8515  df-fin 8516  df-sup 8909  df-oi 8977  df-card 9371  df-pnf 10680  df-mnf 10681  df-xr 10682  df-ltxr 10683  df-le 10684  df-sub 10875  df-neg 10876  df-div 11301  df-nn 11642  df-2 11703  df-3 11704  df-n0 11901  df-z 11985  df-uz 12247  df-rp 12393  df-fz 12896  df-fzo 13037  df-seq 13373  df-exp 13433  df-hash 13694  df-cj 14461  df-re 14462  df-im 14463  df-sqrt 14597  df-abs 14598  df-clim 14848  df-prod 15263
This theorem is referenced by:  fprodsplit  15323
  Copyright terms: Public domain W3C validator