Theorem prodssdc 11944

Description: Change the index set to a subset in an upper integer product. (Contributed by Scott Fenton, 11-Dec-2017.) (Revised by Jim Kingdon, 6-Aug-2024.)

Hypotheses

Ref	Expression
prodss.1	⊢ (𝜑 → 𝐴 ⊆ 𝐵)
prodss.2	⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ ℂ)
prodssdc.3	⊢ (𝜑 → ∃𝑛 ∈ (ℤ≥‘𝑀)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ (ℤ≥‘𝑀) ↦ if(𝑘 ∈ 𝐵, 𝐶, 1))) ⇝ 𝑦))
prodssdc.a	⊢ (𝜑 → ∀𝑗 ∈ (ℤ≥‘𝑀)DECID 𝑗 ∈ 𝐴)
prodssdc.m	⊢ (𝜑 → 𝑀 ∈ ℤ)
prodss.4	⊢ ((𝜑 ∧ 𝑘 ∈ (𝐵 ∖ 𝐴)) → 𝐶 = 1)
prodss.5	⊢ (𝜑 → 𝐵 ⊆ (ℤ≥‘𝑀))
prodssdc.b	⊢ (𝜑 → ∀𝑗 ∈ (ℤ≥‘𝑀)DECID 𝑗 ∈ 𝐵)

Assertion

Ref	Expression
prodssdc	⊢ (𝜑 → ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ 𝐵 𝐶)

Distinct variable groups:   𝐴,𝑗,𝑘,𝑛,𝑦   𝐵,𝑗,𝑘,𝑛,𝑦   𝐶,𝑗,𝑛,𝑦   𝑗,𝑀,𝑘,𝑛,𝑦   𝜑,𝑗,𝑘,𝑛,𝑦

Allowed substitution hint:   𝐶(𝑘)

Proof of Theorem prodssdc

Dummy variable 𝑚 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2206	. . . 4 ⊢ (ℤ≥‘𝑀) = (ℤ≥‘𝑀)
2		prodssdc.m	. . . 4 ⊢ (𝜑 → 𝑀 ∈ ℤ)
3		prodssdc.3	. . . 4 ⊢ (𝜑 → ∃𝑛 ∈ (ℤ≥‘𝑀)∃𝑦(𝑦 # 0 ∧ seq𝑛( · , (𝑘 ∈ (ℤ≥‘𝑀) ↦ if(𝑘 ∈ 𝐵, 𝐶, 1))) ⇝ 𝑦))
4		prodss.1	. . . . 5 ⊢ (𝜑 → 𝐴 ⊆ 𝐵)
5		prodss.5	. . . . 5 ⊢ (𝜑 → 𝐵 ⊆ (ℤ≥‘𝑀))
6	4, 5	sstrd 3204	. . . 4 ⊢ (𝜑 → 𝐴 ⊆ (ℤ≥‘𝑀))
7		prodssdc.a	. . . 4 ⊢ (𝜑 → ∀𝑗 ∈ (ℤ≥‘𝑀)DECID 𝑗 ∈ 𝐴)
8		simpr 110	. . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ≥‘𝑀)) → 𝑚 ∈ (ℤ≥‘𝑀))
9		eleq1w 2267	. . . . . . . . . 10 ⊢ (𝑗 = 𝑚 → (𝑗 ∈ 𝐵 ↔ 𝑚 ∈ 𝐵))
10	9	dcbid 840	. . . . . . . . 9 ⊢ (𝑗 = 𝑚 → (DECID 𝑗 ∈ 𝐵 ↔ DECID 𝑚 ∈ 𝐵))
11		prodssdc.b	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑗 ∈ (ℤ≥‘𝑀)DECID 𝑗 ∈ 𝐵)
12	11	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ≥‘𝑀)) → ∀𝑗 ∈ (ℤ≥‘𝑀)DECID 𝑗 ∈ 𝐵)
13	10, 12, 8	rspcdva 2883	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ≥‘𝑀)) → DECID 𝑚 ∈ 𝐵)
14		exmiddc 838	. . . . . . . 8 ⊢ (DECID 𝑚 ∈ 𝐵 → (𝑚 ∈ 𝐵 ∨ ¬ 𝑚 ∈ 𝐵))
15	13, 14	syl 14	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ≥‘𝑀)) → (𝑚 ∈ 𝐵 ∨ ¬ 𝑚 ∈ 𝐵))
16		iftrue 3577	. . . . . . . . . . . 12 ⊢ (𝑚 ∈ 𝐵 → if(𝑚 ∈ 𝐵, ⦋𝑚 / 𝑘⦌𝐶, 1) = ⦋𝑚 / 𝑘⦌𝐶)
17	16	adantl 277	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐵) → if(𝑚 ∈ 𝐵, ⦋𝑚 / 𝑘⦌𝐶, 1) = ⦋𝑚 / 𝑘⦌𝐶)
18		prodss.2	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ ℂ)
19	18	ex 115	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑘 ∈ 𝐴 → 𝐶 ∈ ℂ))
20	19	adantr 276	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑘 ∈ 𝐴 → 𝐶 ∈ ℂ))
21		eldif 3176	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ (𝐵 ∖ 𝐴) ↔ (𝑘 ∈ 𝐵 ∧ ¬ 𝑘 ∈ 𝐴))
22		prodss.4	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐵 ∖ 𝐴)) → 𝐶 = 1)
23		ax-1cn 8025	. . . . . . . . . . . . . . . . 17 ⊢ 1 ∈ ℂ
24	22, 23	eqeltrdi 2297	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐵 ∖ 𝐴)) → 𝐶 ∈ ℂ)
25	21, 24	sylan2br 288	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ ¬ 𝑘 ∈ 𝐴)) → 𝐶 ∈ ℂ)
26	25	expr 375	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (¬ 𝑘 ∈ 𝐴 → 𝐶 ∈ ℂ))
27		eleq1w 2267	. . . . . . . . . . . . . . . . 17 ⊢ (𝑗 = 𝑘 → (𝑗 ∈ 𝐴 ↔ 𝑘 ∈ 𝐴))
28	27	dcbid 840	. . . . . . . . . . . . . . . 16 ⊢ (𝑗 = 𝑘 → (DECID 𝑗 ∈ 𝐴 ↔ DECID 𝑘 ∈ 𝐴))
29	7	adantr 276	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → ∀𝑗 ∈ (ℤ≥‘𝑀)DECID 𝑗 ∈ 𝐴)
30	5	sselda 3194	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → 𝑘 ∈ (ℤ≥‘𝑀))
31	28, 29, 30	rspcdva 2883	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → DECID 𝑘 ∈ 𝐴)
32		exmiddc 838	. . . . . . . . . . . . . . 15 ⊢ (DECID 𝑘 ∈ 𝐴 → (𝑘 ∈ 𝐴 ∨ ¬ 𝑘 ∈ 𝐴))
33	31, 32	syl 14	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑘 ∈ 𝐴 ∨ ¬ 𝑘 ∈ 𝐴))
34	20, 26, 33	mpjaod 720	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → 𝐶 ∈ ℂ)
35	34	ralrimiva 2580	. . . . . . . . . . . 12 ⊢ (𝜑 → ∀𝑘 ∈ 𝐵 𝐶 ∈ ℂ)
36		nfcsb1v 3127	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑘⦋𝑚 / 𝑘⦌𝐶
37	36	nfel1 2360	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑘⦋𝑚 / 𝑘⦌𝐶 ∈ ℂ
38		csbeq1a 3103	. . . . . . . . . . . . . 14 ⊢ (𝑘 = 𝑚 → 𝐶 = ⦋𝑚 / 𝑘⦌𝐶)
39	38	eleq1d 2275	. . . . . . . . . . . . 13 ⊢ (𝑘 = 𝑚 → (𝐶 ∈ ℂ ↔ ⦋𝑚 / 𝑘⦌𝐶 ∈ ℂ))
40	37, 39	rspc 2872	. . . . . . . . . . . 12 ⊢ (𝑚 ∈ 𝐵 → (∀𝑘 ∈ 𝐵 𝐶 ∈ ℂ → ⦋𝑚 / 𝑘⦌𝐶 ∈ ℂ))
41	35, 40	mpan9 281	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐵) → ⦋𝑚 / 𝑘⦌𝐶 ∈ ℂ)
42	17, 41	eqeltrd 2283	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐵) → if(𝑚 ∈ 𝐵, ⦋𝑚 / 𝑘⦌𝐶, 1) ∈ ℂ)
43	42	ex 115	. . . . . . . . 9 ⊢ (𝜑 → (𝑚 ∈ 𝐵 → if(𝑚 ∈ 𝐵, ⦋𝑚 / 𝑘⦌𝐶, 1) ∈ ℂ))
44		iffalse 3580	. . . . . . . . . . 11 ⊢ (¬ 𝑚 ∈ 𝐵 → if(𝑚 ∈ 𝐵, ⦋𝑚 / 𝑘⦌𝐶, 1) = 1)
45	44, 23	eqeltrdi 2297	. . . . . . . . . 10 ⊢ (¬ 𝑚 ∈ 𝐵 → if(𝑚 ∈ 𝐵, ⦋𝑚 / 𝑘⦌𝐶, 1) ∈ ℂ)
46	45	a1i 9	. . . . . . . . 9 ⊢ (𝜑 → (¬ 𝑚 ∈ 𝐵 → if(𝑚 ∈ 𝐵, ⦋𝑚 / 𝑘⦌𝐶, 1) ∈ ℂ))
47	43, 46	jaod 719	. . . . . . . 8 ⊢ (𝜑 → ((𝑚 ∈ 𝐵 ∨ ¬ 𝑚 ∈ 𝐵) → if(𝑚 ∈ 𝐵, ⦋𝑚 / 𝑘⦌𝐶, 1) ∈ ℂ))
48	47	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ≥‘𝑀)) → ((𝑚 ∈ 𝐵 ∨ ¬ 𝑚 ∈ 𝐵) → if(𝑚 ∈ 𝐵, ⦋𝑚 / 𝑘⦌𝐶, 1) ∈ ℂ))
49	15, 48	mpd 13	. . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ≥‘𝑀)) → if(𝑚 ∈ 𝐵, ⦋𝑚 / 𝑘⦌𝐶, 1) ∈ ℂ)
50		nfcv 2349	. . . . . . 7 ⊢ Ⅎ𝑘𝑚
51		nfv 1552	. . . . . . . 8 ⊢ Ⅎ𝑘 𝑚 ∈ 𝐵
52		nfcv 2349	. . . . . . . 8 ⊢ Ⅎ𝑘1
53	51, 36, 52	nfif 3600	. . . . . . 7 ⊢ Ⅎ𝑘if(𝑚 ∈ 𝐵, ⦋𝑚 / 𝑘⦌𝐶, 1)
54		eleq1w 2267	. . . . . . . 8 ⊢ (𝑘 = 𝑚 → (𝑘 ∈ 𝐵 ↔ 𝑚 ∈ 𝐵))
55	54, 38	ifbieq1d 3594	. . . . . . 7 ⊢ (𝑘 = 𝑚 → if(𝑘 ∈ 𝐵, 𝐶, 1) = if(𝑚 ∈ 𝐵, ⦋𝑚 / 𝑘⦌𝐶, 1))
56		eqid 2206	. . . . . . 7 ⊢ (𝑘 ∈ (ℤ≥‘𝑀) ↦ if(𝑘 ∈ 𝐵, 𝐶, 1)) = (𝑘 ∈ (ℤ≥‘𝑀) ↦ if(𝑘 ∈ 𝐵, 𝐶, 1))
57	50, 53, 55, 56	fvmptf 5679	. . . . . 6 ⊢ ((𝑚 ∈ (ℤ≥‘𝑀) ∧ if(𝑚 ∈ 𝐵, ⦋𝑚 / 𝑘⦌𝐶, 1) ∈ ℂ) → ((𝑘 ∈ (ℤ≥‘𝑀) ↦ if(𝑘 ∈ 𝐵, 𝐶, 1))‘𝑚) = if(𝑚 ∈ 𝐵, ⦋𝑚 / 𝑘⦌𝐶, 1))
58	8, 49, 57	syl2anc 411	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ≥‘𝑀)) → ((𝑘 ∈ (ℤ≥‘𝑀) ↦ if(𝑘 ∈ 𝐵, 𝐶, 1))‘𝑚) = if(𝑚 ∈ 𝐵, ⦋𝑚 / 𝑘⦌𝐶, 1))
59		iftrue 3577	. . . . . . . . . . . . . . 15 ⊢ (𝑚 ∈ 𝐴 → if(𝑚 ∈ 𝐴, ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚), 1) = ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚))
60	59	adantl 277	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → if(𝑚 ∈ 𝐴, ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚), 1) = ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚))
61		simpr 110	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → 𝑚 ∈ 𝐴)
62	4	sselda 3194	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → 𝑚 ∈ 𝐵)
63	62, 41	syldan 282	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → ⦋𝑚 / 𝑘⦌𝐶 ∈ ℂ)
64		eqid 2206	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ 𝐴 ↦ 𝐶) = (𝑘 ∈ 𝐴 ↦ 𝐶)
65	64	fvmpts 5664	. . . . . . . . . . . . . . 15 ⊢ ((𝑚 ∈ 𝐴 ∧ ⦋𝑚 / 𝑘⦌𝐶 ∈ ℂ) → ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚) = ⦋𝑚 / 𝑘⦌𝐶)
66	61, 63, 65	syl2anc 411	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚) = ⦋𝑚 / 𝑘⦌𝐶)
67	60, 66	eqtrd 2239	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → if(𝑚 ∈ 𝐴, ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚), 1) = ⦋𝑚 / 𝑘⦌𝐶)
68	67	ex 115	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑚 ∈ 𝐴 → if(𝑚 ∈ 𝐴, ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚), 1) = ⦋𝑚 / 𝑘⦌𝐶))
69	68	adantr 276	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐵) → (𝑚 ∈ 𝐴 → if(𝑚 ∈ 𝐴, ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚), 1) = ⦋𝑚 / 𝑘⦌𝐶))
70		iffalse 3580	. . . . . . . . . . . . . . 15 ⊢ (¬ 𝑚 ∈ 𝐴 → if(𝑚 ∈ 𝐴, ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚), 1) = 1)
71	70	adantl 277	. . . . . . . . . . . . . 14 ⊢ ((𝑚 ∈ 𝐵 ∧ ¬ 𝑚 ∈ 𝐴) → if(𝑚 ∈ 𝐴, ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚), 1) = 1)
72	71	adantl 277	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑚 ∈ 𝐵 ∧ ¬ 𝑚 ∈ 𝐴)) → if(𝑚 ∈ 𝐴, ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚), 1) = 1)
73		eldif 3176	. . . . . . . . . . . . . 14 ⊢ (𝑚 ∈ (𝐵 ∖ 𝐴) ↔ (𝑚 ∈ 𝐵 ∧ ¬ 𝑚 ∈ 𝐴))
74	22	ralrimiva 2580	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ∀𝑘 ∈ (𝐵 ∖ 𝐴)𝐶 = 1)
75	36	nfeq1 2359	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑘⦋𝑚 / 𝑘⦌𝐶 = 1
76	38	eqeq1d 2215	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 = 𝑚 → (𝐶 = 1 ↔ ⦋𝑚 / 𝑘⦌𝐶 = 1))
77	75, 76	rspc 2872	. . . . . . . . . . . . . . 15 ⊢ (𝑚 ∈ (𝐵 ∖ 𝐴) → (∀𝑘 ∈ (𝐵 ∖ 𝐴)𝐶 = 1 → ⦋𝑚 / 𝑘⦌𝐶 = 1))
78	74, 77	mpan9 281	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑚 ∈ (𝐵 ∖ 𝐴)) → ⦋𝑚 / 𝑘⦌𝐶 = 1)
79	73, 78	sylan2br 288	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑚 ∈ 𝐵 ∧ ¬ 𝑚 ∈ 𝐴)) → ⦋𝑚 / 𝑘⦌𝐶 = 1)
80	72, 79	eqtr4d 2242	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑚 ∈ 𝐵 ∧ ¬ 𝑚 ∈ 𝐴)) → if(𝑚 ∈ 𝐴, ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚), 1) = ⦋𝑚 / 𝑘⦌𝐶)
81	80	expr 375	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐵) → (¬ 𝑚 ∈ 𝐴 → if(𝑚 ∈ 𝐴, ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚), 1) = ⦋𝑚 / 𝑘⦌𝐶))
82		eleq1w 2267	. . . . . . . . . . . . . 14 ⊢ (𝑗 = 𝑚 → (𝑗 ∈ 𝐴 ↔ 𝑚 ∈ 𝐴))
83	82	dcbid 840	. . . . . . . . . . . . 13 ⊢ (𝑗 = 𝑚 → (DECID 𝑗 ∈ 𝐴 ↔ DECID 𝑚 ∈ 𝐴))
84	7	adantr 276	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐵) → ∀𝑗 ∈ (ℤ≥‘𝑀)DECID 𝑗 ∈ 𝐴)
85	5	sselda 3194	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐵) → 𝑚 ∈ (ℤ≥‘𝑀))
86	83, 84, 85	rspcdva 2883	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐵) → DECID 𝑚 ∈ 𝐴)
87		exmiddc 838	. . . . . . . . . . . 12 ⊢ (DECID 𝑚 ∈ 𝐴 → (𝑚 ∈ 𝐴 ∨ ¬ 𝑚 ∈ 𝐴))
88	86, 87	syl 14	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐵) → (𝑚 ∈ 𝐴 ∨ ¬ 𝑚 ∈ 𝐴))
89	69, 81, 88	mpjaod 720	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐵) → if(𝑚 ∈ 𝐴, ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚), 1) = ⦋𝑚 / 𝑘⦌𝐶)
90	89, 17	eqtr4d 2242	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐵) → if(𝑚 ∈ 𝐴, ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚), 1) = if(𝑚 ∈ 𝐵, ⦋𝑚 / 𝑘⦌𝐶, 1))
91	90	ex 115	. . . . . . . 8 ⊢ (𝜑 → (𝑚 ∈ 𝐵 → if(𝑚 ∈ 𝐴, ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚), 1) = if(𝑚 ∈ 𝐵, ⦋𝑚 / 𝑘⦌𝐶, 1)))
92	4	ssneld 3196	. . . . . . . . . . . 12 ⊢ (𝜑 → (¬ 𝑚 ∈ 𝐵 → ¬ 𝑚 ∈ 𝐴))
93	92	imp 124	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ 𝑚 ∈ 𝐵) → ¬ 𝑚 ∈ 𝐴)
94	93, 70	syl 14	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝑚 ∈ 𝐵) → if(𝑚 ∈ 𝐴, ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚), 1) = 1)
95	44	adantl 277	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝑚 ∈ 𝐵) → if(𝑚 ∈ 𝐵, ⦋𝑚 / 𝑘⦌𝐶, 1) = 1)
96	94, 95	eqtr4d 2242	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝑚 ∈ 𝐵) → if(𝑚 ∈ 𝐴, ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚), 1) = if(𝑚 ∈ 𝐵, ⦋𝑚 / 𝑘⦌𝐶, 1))
97	96	ex 115	. . . . . . . 8 ⊢ (𝜑 → (¬ 𝑚 ∈ 𝐵 → if(𝑚 ∈ 𝐴, ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚), 1) = if(𝑚 ∈ 𝐵, ⦋𝑚 / 𝑘⦌𝐶, 1)))
98	91, 97	jaod 719	. . . . . . 7 ⊢ (𝜑 → ((𝑚 ∈ 𝐵 ∨ ¬ 𝑚 ∈ 𝐵) → if(𝑚 ∈ 𝐴, ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚), 1) = if(𝑚 ∈ 𝐵, ⦋𝑚 / 𝑘⦌𝐶, 1)))
99	98	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ≥‘𝑀)) → ((𝑚 ∈ 𝐵 ∨ ¬ 𝑚 ∈ 𝐵) → if(𝑚 ∈ 𝐴, ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚), 1) = if(𝑚 ∈ 𝐵, ⦋𝑚 / 𝑘⦌𝐶, 1)))
100	15, 99	mpd 13	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ≥‘𝑀)) → if(𝑚 ∈ 𝐴, ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚), 1) = if(𝑚 ∈ 𝐵, ⦋𝑚 / 𝑘⦌𝐶, 1))
101	58, 100	eqtr4d 2242	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ≥‘𝑀)) → ((𝑘 ∈ (ℤ≥‘𝑀) ↦ if(𝑘 ∈ 𝐵, 𝐶, 1))‘𝑚) = if(𝑚 ∈ 𝐴, ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚), 1))
102	18	fmpttd 5742	. . . . 5 ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ 𝐶):𝐴⟶ℂ)
103	102	ffvelcdmda 5722	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚) ∈ ℂ)
104	1, 2, 3, 6, 7, 101, 103	zproddc 11934	. . 3 ⊢ (𝜑 → ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚) = ( ⇝ ‘seq𝑀( · , (𝑘 ∈ (ℤ≥‘𝑀) ↦ if(𝑘 ∈ 𝐵, 𝐶, 1)))))
105		simpr 110	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐵) → 𝑚 ∈ 𝐵)
106		eqid 2206	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ 𝐵 ↦ 𝐶) = (𝑘 ∈ 𝐵 ↦ 𝐶)
107	106	fvmpts 5664	. . . . . . . . . . 11 ⊢ ((𝑚 ∈ 𝐵 ∧ ⦋𝑚 / 𝑘⦌𝐶 ∈ ℂ) → ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚) = ⦋𝑚 / 𝑘⦌𝐶)
108	105, 41, 107	syl2anc 411	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐵) → ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚) = ⦋𝑚 / 𝑘⦌𝐶)
109	108	ifeq1d 3589	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐵) → if(𝑚 ∈ 𝐵, ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚), 1) = if(𝑚 ∈ 𝐵, ⦋𝑚 / 𝑘⦌𝐶, 1))
110	109	ex 115	. . . . . . . 8 ⊢ (𝜑 → (𝑚 ∈ 𝐵 → if(𝑚 ∈ 𝐵, ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚), 1) = if(𝑚 ∈ 𝐵, ⦋𝑚 / 𝑘⦌𝐶, 1)))
111		iffalse 3580	. . . . . . . . . 10 ⊢ (¬ 𝑚 ∈ 𝐵 → if(𝑚 ∈ 𝐵, ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚), 1) = 1)
112	111, 44	eqtr4d 2242	. . . . . . . . 9 ⊢ (¬ 𝑚 ∈ 𝐵 → if(𝑚 ∈ 𝐵, ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚), 1) = if(𝑚 ∈ 𝐵, ⦋𝑚 / 𝑘⦌𝐶, 1))
113	112	a1i 9	. . . . . . . 8 ⊢ (𝜑 → (¬ 𝑚 ∈ 𝐵 → if(𝑚 ∈ 𝐵, ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚), 1) = if(𝑚 ∈ 𝐵, ⦋𝑚 / 𝑘⦌𝐶, 1)))
114	110, 113	jaod 719	. . . . . . 7 ⊢ (𝜑 → ((𝑚 ∈ 𝐵 ∨ ¬ 𝑚 ∈ 𝐵) → if(𝑚 ∈ 𝐵, ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚), 1) = if(𝑚 ∈ 𝐵, ⦋𝑚 / 𝑘⦌𝐶, 1)))
115	114	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ≥‘𝑀)) → ((𝑚 ∈ 𝐵 ∨ ¬ 𝑚 ∈ 𝐵) → if(𝑚 ∈ 𝐵, ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚), 1) = if(𝑚 ∈ 𝐵, ⦋𝑚 / 𝑘⦌𝐶, 1)))
116	15, 115	mpd 13	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ≥‘𝑀)) → if(𝑚 ∈ 𝐵, ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚), 1) = if(𝑚 ∈ 𝐵, ⦋𝑚 / 𝑘⦌𝐶, 1))
117	58, 116	eqtr4d 2242	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ≥‘𝑀)) → ((𝑘 ∈ (ℤ≥‘𝑀) ↦ if(𝑘 ∈ 𝐵, 𝐶, 1))‘𝑚) = if(𝑚 ∈ 𝐵, ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚), 1))
118	34	fmpttd 5742	. . . . 5 ⊢ (𝜑 → (𝑘 ∈ 𝐵 ↦ 𝐶):𝐵⟶ℂ)
119	118	ffvelcdmda 5722	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐵) → ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚) ∈ ℂ)
120	1, 2, 3, 5, 11, 117, 119	zproddc 11934	. . 3 ⊢ (𝜑 → ∏𝑚 ∈ 𝐵 ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚) = ( ⇝ ‘seq𝑀( · , (𝑘 ∈ (ℤ≥‘𝑀) ↦ if(𝑘 ∈ 𝐵, 𝐶, 1)))))
121	104, 120	eqtr4d 2242	. 2 ⊢ (𝜑 → ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚) = ∏𝑚 ∈ 𝐵 ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚))
122	18	ralrimiva 2580	. . 3 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝐶 ∈ ℂ)
123		prodfct 11942	. . 3 ⊢ (∀𝑘 ∈ 𝐴 𝐶 ∈ ℂ → ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚) = ∏𝑘 ∈ 𝐴 𝐶)
124	122, 123	syl 14	. 2 ⊢ (𝜑 → ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚) = ∏𝑘 ∈ 𝐴 𝐶)
125		prodfct 11942	. . 3 ⊢ (∀𝑘 ∈ 𝐵 𝐶 ∈ ℂ → ∏𝑚 ∈ 𝐵 ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚) = ∏𝑘 ∈ 𝐵 𝐶)
126	35, 125	syl 14	. 2 ⊢ (𝜑 → ∏𝑚 ∈ 𝐵 ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚) = ∏𝑘 ∈ 𝐵 𝐶)
127	121, 124, 126	3eqtr3d 2247	1 ⊢ (𝜑 → ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ 𝐵 𝐶)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ∨ wo 710  DECID wdc 836   = wceq 1373  ∃wex 1516   ∈ wcel 2177  ∀wral 2485  ∃wrex 2486  ⦋csb 3094   ∖ cdif 3164   ⊆ wss 3167  ifcif 3572   class class class wbr 4047   ↦ cmpt 4109  ‘cfv 5276  ℂcc 7930  0cc0 7932  1c1 7933   · cmul 7937   # cap 8661  ℤcz 9379  ℤ_≥cuz 9655  seqcseq 10599   ⇝ cli 11633  ∏cprod 11905

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-coll 4163  ax-sep 4166  ax-nul 4174  ax-pow 4222  ax-pr 4257  ax-un 4484  ax-setind 4589  ax-iinf 4640  ax-cnex 8023  ax-resscn 8024  ax-1cn 8025  ax-1re 8026  ax-icn 8027  ax-addcl 8028  ax-addrcl 8029  ax-mulcl 8030  ax-mulrcl 8031  ax-addcom 8032  ax-mulcom 8033  ax-addass 8034  ax-mulass 8035  ax-distr 8036  ax-i2m1 8037  ax-0lt1 8038  ax-1rid 8039  ax-0id 8040  ax-rnegex 8041  ax-precex 8042  ax-cnre 8043  ax-pre-ltirr 8044  ax-pre-ltwlin 8045  ax-pre-lttrn 8046  ax-pre-apti 8047  ax-pre-ltadd 8048  ax-pre-mulgt0 8049  ax-pre-mulext 8050

This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-nel 2473  df-ral 2490  df-rex 2491  df-reu 2492  df-rmo 2493  df-rab 2494  df-v 2775  df-sbc 3000  df-csb 3095  df-dif 3169  df-un 3171  df-in 3173  df-ss 3180  df-nul 3462  df-if 3573  df-pw 3619  df-sn 3640  df-pr 3641  df-op 3643  df-uni 3853  df-int 3888  df-iun 3931  df-br 4048  df-opab 4110  df-mpt 4111  df-tr 4147  df-id 4344  df-po 4347  df-iso 4348  df-iord 4417  df-on 4419  df-ilim 4420  df-suc 4422  df-iom 4643  df-xp 4685  df-rel 4686  df-cnv 4687  df-co 4688  df-dm 4689  df-rn 4690  df-res 4691  df-ima 4692  df-iota 5237  df-fun 5278  df-fn 5279  df-f 5280  df-f1 5281  df-fo 5282  df-f1o 5283  df-fv 5284  df-isom 5285  df-riota 5906  df-ov 5954  df-oprab 5955  df-mpo 5956  df-1st 6233  df-2nd 6234  df-recs 6398  df-irdg 6463  df-frec 6484  df-1o 6509  df-oadd 6513  df-er 6627  df-en 6835  df-dom 6836  df-fin 6837  df-pnf 8116  df-mnf 8117  df-xr 8118  df-ltxr 8119  df-le 8120  df-sub 8252  df-neg 8253  df-reap 8655  df-ap 8662  df-div 8753  df-inn 9044  df-2 9102  df-n0 9303  df-z 9380  df-uz 9656  df-q 9748  df-rp 9783  df-fz 10138  df-fzo 10272  df-seqfrec 10600  df-exp 10691  df-ihash 10928  df-cj 11197  df-rsqrt 11353  df-abs 11354  df-clim 11634  df-proddc 11906

This theorem is referenced by:  fprodssdc  11945