fprodss - Metamath Proof Explorer

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

Theorem fprodss 14798

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.

Step	Hyp	Ref	Expression
1		fprodss.1	. . 3 ⊢ (𝜑 → 𝐴 ⊆ 𝐵)
2		sseq2 3733	. . . . 5 ⊢ (𝐵 = ∅ → (𝐴 ⊆ 𝐵 ↔ 𝐴 ⊆ ∅))
3		ss0 4082	. . . . 5 ⊢ (𝐴 ⊆ ∅ → 𝐴 = ∅)
4	2, 3	syl6bi 243	. . . 4 ⊢ (𝐵 = ∅ → (𝐴 ⊆ 𝐵 → 𝐴 = ∅))
5		prodeq1 14759	. . . . . 6 ⊢ (𝐴 = ∅ → ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ ∅ 𝐶)
6		prodeq1 14759	. . . . . . 7 ⊢ (𝐵 = ∅ → ∏𝑘 ∈ 𝐵 𝐶 = ∏𝑘 ∈ ∅ 𝐶)
7	6	eqcomd 2730	. . . . . 6 ⊢ (𝐵 = ∅ → ∏𝑘 ∈ ∅ 𝐶 = ∏𝑘 ∈ 𝐵 𝐶)
8	5, 7	sylan9eq 2778	. . . . 5 ⊢ ((𝐴 = ∅ ∧ 𝐵 = ∅) → ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ 𝐵 𝐶)
9	8	expcom 450	. . . 4 ⊢ (𝐵 = ∅ → (𝐴 = ∅ → ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ 𝐵 𝐶))
10	4, 9	syld 47	. . 3 ⊢ (𝐵 = ∅ → (𝐴 ⊆ 𝐵 → ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ 𝐵 𝐶))
11	1, 10	syl5com 31	. 2 ⊢ (𝜑 → (𝐵 = ∅ → ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ 𝐵 𝐶))
12		cnvimass 5595	. . . . . . . . 9 ⊢ (^◡𝑓 “ 𝐴) ⊆ dom 𝑓
13		simprr 813	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)
14		f1of 6250	. . . . . . . . . . 11 ⊢ (𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵 → 𝑓:(1...(♯‘𝐵))⟶𝐵)
15	13, 14	syl 17	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → 𝑓:(1...(♯‘𝐵))⟶𝐵)
16		fdm 6164	. . . . . . . . . 10 ⊢ (𝑓:(1...(♯‘𝐵))⟶𝐵 → dom 𝑓 = (1...(♯‘𝐵)))
17	15, 16	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → dom 𝑓 = (1...(♯‘𝐵)))
18	12, 17	syl5sseq 3759	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (^◡𝑓 “ 𝐴) ⊆ (1...(♯‘𝐵)))
19		f1ofn 6251	. . . . . . . . . . . . 13 ⊢ (𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵 → 𝑓 Fn (1...(♯‘𝐵)))
20	13, 19	syl 17	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → 𝑓 Fn (1...(♯‘𝐵)))
21		elpreima 6452	. . . . . . . . . . . 12 ⊢ (𝑓 Fn (1...(♯‘𝐵)) → (𝑛 ∈ (^◡𝑓 “ 𝐴) ↔ (𝑛 ∈ (1...(♯‘𝐵)) ∧ (𝑓‘𝑛) ∈ 𝐴)))
22	20, 21	syl 17	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (𝑛 ∈ (^◡𝑓 “ 𝐴) ↔ (𝑛 ∈ (1...(♯‘𝐵)) ∧ (𝑓‘𝑛) ∈ 𝐴)))
23	15	ffvelrnda 6474	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ (1...(♯‘𝐵))) → (𝑓‘𝑛) ∈ 𝐵)
24	23	ex 449	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (𝑛 ∈ (1...(♯‘𝐵)) → (𝑓‘𝑛) ∈ 𝐵))
25	24	adantrd 485	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → ((𝑛 ∈ (1...(♯‘𝐵)) ∧ (𝑓‘𝑛) ∈ 𝐴) → (𝑓‘𝑛) ∈ 𝐵))
26	22, 25	sylbid 230	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (𝑛 ∈ (^◡𝑓 “ 𝐴) → (𝑓‘𝑛) ∈ 𝐵))
27	26	imp 444	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ (^◡𝑓 “ 𝐴)) → (𝑓‘𝑛) ∈ 𝐵)
28		fprodss.2	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ ℂ)
29	28	ex 449	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑘 ∈ 𝐴 → 𝐶 ∈ ℂ))
30	29	adantr 472	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑘 ∈ 𝐴 → 𝐶 ∈ ℂ))
31		eldif 3690	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ (𝐵 ∖ 𝐴) ↔ (𝑘 ∈ 𝐵 ∧ ¬ 𝑘 ∈ 𝐴))
32		fprodss.3	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐵 ∖ 𝐴)) → 𝐶 = 1)
33		ax-1cn 10107	. . . . . . . . . . . . . . . 16 ⊢ 1 ∈ ℂ
34	32, 33	syl6eqel 2811	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐵 ∖ 𝐴)) → 𝐶 ∈ ℂ)
35	31, 34	sylan2br 494	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ ¬ 𝑘 ∈ 𝐴)) → 𝐶 ∈ ℂ)
36	35	expr 644	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (¬ 𝑘 ∈ 𝐴 → 𝐶 ∈ ℂ))
37	30, 36	pm2.61d 170	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → 𝐶 ∈ ℂ)
38	37	adantlr 753	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑘 ∈ 𝐵) → 𝐶 ∈ ℂ)
39		eqid 2724	. . . . . . . . . . 11 ⊢ (𝑘 ∈ 𝐵 ↦ 𝐶) = (𝑘 ∈ 𝐵 ↦ 𝐶)
40	38, 39	fmptd 6500	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (𝑘 ∈ 𝐵 ↦ 𝐶):𝐵⟶ℂ)
41	40	ffvelrnda 6474	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ (𝑓‘𝑛) ∈ 𝐵) → ((𝑘 ∈ 𝐵 ↦ 𝐶)‘(𝑓‘𝑛)) ∈ ℂ)
42	27, 41	syldan 488	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ (^◡𝑓 “ 𝐴)) → ((𝑘 ∈ 𝐵 ↦ 𝐶)‘(𝑓‘𝑛)) ∈ ℂ)
43		eqid 2724	. . . . . . . . 9 ⊢ (ℤ_≥‘1) = (ℤ_≥‘1)
44		simprl 811	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (♯‘𝐵) ∈ ℕ)
45		nnuz 11837	. . . . . . . . . 10 ⊢ ℕ = (ℤ_≥‘1)
46	44, 45	syl6eleq 2813	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (♯‘𝐵) ∈ (ℤ_≥‘1))
47		ssid 3730	. . . . . . . . . 10 ⊢ (1...(♯‘𝐵)) ⊆ (1...(♯‘𝐵))
48	47	a1i 11	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (1...(♯‘𝐵)) ⊆ (1...(♯‘𝐵)))
49	43, 46, 48	fprodntriv 14792	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → ∃𝑚 ∈ (ℤ_≥‘1)∃𝑦(𝑦 ≠ 0 ∧ seq𝑚( · , (𝑛 ∈ (ℤ_≥‘1) ↦ if(𝑛 ∈ (1...(♯‘𝐵)), ((𝑘 ∈ 𝐵 ↦ 𝐶)‘(𝑓‘𝑛)), 1))) ⇝ 𝑦))
50		eldifi 3840	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ ((1...(♯‘𝐵)) ∖ (^◡𝑓 “ 𝐴)) → 𝑛 ∈ (1...(♯‘𝐵)))
51	50, 23	sylan2 492	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (^◡𝑓 “ 𝐴))) → (𝑓‘𝑛) ∈ 𝐵)
52		eldifn 3841	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ((1...(♯‘𝐵)) ∖ (^◡𝑓 “ 𝐴)) → ¬ 𝑛 ∈ (^◡𝑓 “ 𝐴))
53	52	adantl 473	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (^◡𝑓 “ 𝐴))) → ¬ 𝑛 ∈ (^◡𝑓 “ 𝐴))
54	22	adantr 472	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (^◡𝑓 “ 𝐴))) → (𝑛 ∈ (^◡𝑓 “ 𝐴) ↔ (𝑛 ∈ (1...(♯‘𝐵)) ∧ (𝑓‘𝑛) ∈ 𝐴)))
55	50	adantl 473	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (^◡𝑓 “ 𝐴))) → 𝑛 ∈ (1...(♯‘𝐵)))
56	55	biantrurd 530	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (^◡𝑓 “ 𝐴))) → ((𝑓‘𝑛) ∈ 𝐴 ↔ (𝑛 ∈ (1...(♯‘𝐵)) ∧ (𝑓‘𝑛) ∈ 𝐴)))
57	54, 56	bitr4d 271	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (^◡𝑓 “ 𝐴))) → (𝑛 ∈ (^◡𝑓 “ 𝐴) ↔ (𝑓‘𝑛) ∈ 𝐴))
58	53, 57	mtbid 313	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (^◡𝑓 “ 𝐴))) → ¬ (𝑓‘𝑛) ∈ 𝐴)
59	51, 58	eldifd 3691	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (^◡𝑓 “ 𝐴))) → (𝑓‘𝑛) ∈ (𝐵 ∖ 𝐴))
60		difss 3845	. . . . . . . . . . . . 13 ⊢ (𝐵 ∖ 𝐴) ⊆ 𝐵
61		resmpt 5559	. . . . . . . . . . . . 13 ⊢ ((𝐵 ∖ 𝐴) ⊆ 𝐵 → ((𝑘 ∈ 𝐵 ↦ 𝐶) ↾ (𝐵 ∖ 𝐴)) = (𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶))
62	60, 61	ax-mp 5	. . . . . . . . . . . 12 ⊢ ((𝑘 ∈ 𝐵 ↦ 𝐶) ↾ (𝐵 ∖ 𝐴)) = (𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶)
63	62	fveq1i 6305	. . . . . . . . . . 11 ⊢ (((𝑘 ∈ 𝐵 ↦ 𝐶) ↾ (𝐵 ∖ 𝐴))‘(𝑓‘𝑛)) = ((𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶)‘(𝑓‘𝑛))
64		fvres 6320	. . . . . . . . . . 11 ⊢ ((𝑓‘𝑛) ∈ (𝐵 ∖ 𝐴) → (((𝑘 ∈ 𝐵 ↦ 𝐶) ↾ (𝐵 ∖ 𝐴))‘(𝑓‘𝑛)) = ((𝑘 ∈ 𝐵 ↦ 𝐶)‘(𝑓‘𝑛)))
65	63, 64	syl5eqr 2772	. . . . . . . . . 10 ⊢ ((𝑓‘𝑛) ∈ (𝐵 ∖ 𝐴) → ((𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶)‘(𝑓‘𝑛)) = ((𝑘 ∈ 𝐵 ↦ 𝐶)‘(𝑓‘𝑛)))
66	59, 65	syl 17	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (^◡𝑓 “ 𝐴))) → ((𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶)‘(𝑓‘𝑛)) = ((𝑘 ∈ 𝐵 ↦ 𝐶)‘(𝑓‘𝑛)))
67		1ex 10148	. . . . . . . . . . . . . . 15 ⊢ 1 ∈ V
68	67	elsn2 4319	. . . . . . . . . . . . . 14 ⊢ (𝐶 ∈ {1} ↔ 𝐶 = 1)
69	32, 68	sylibr 224	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐵 ∖ 𝐴)) → 𝐶 ∈ {1})
70		eqid 2724	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶) = (𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶)
71	69, 70	fmptd 6500	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶):(𝐵 ∖ 𝐴)⟶{1})
72	71	ad2antrr 764	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (^◡𝑓 “ 𝐴))) → (𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶):(𝐵 ∖ 𝐴)⟶{1})
73	72, 59	ffvelrnd 6475	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (^◡𝑓 “ 𝐴))) → ((𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶)‘(𝑓‘𝑛)) ∈ {1})
74		elsni 4302	. . . . . . . . . 10 ⊢ (((𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶)‘(𝑓‘𝑛)) ∈ {1} → ((𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶)‘(𝑓‘𝑛)) = 1)
75	73, 74	syl 17	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (^◡𝑓 “ 𝐴))) → ((𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶)‘(𝑓‘𝑛)) = 1)
76	66, 75	eqtr3d 2760	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (^◡𝑓 “ 𝐴))) → ((𝑘 ∈ 𝐵 ↦ 𝐶)‘(𝑓‘𝑛)) = 1)
77		fzssuz 12496	. . . . . . . . 9 ⊢ (1...(♯‘𝐵)) ⊆ (ℤ_≥‘1)
78	77	a1i 11	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (1...(♯‘𝐵)) ⊆ (ℤ_≥‘1))
79	18, 42, 49, 76, 78	prodss 14797	. . . . . . 7 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → ∏𝑛 ∈ (^◡𝑓 “ 𝐴)((𝑘 ∈ 𝐵 ↦ 𝐶)‘(𝑓‘𝑛)) = ∏𝑛 ∈ (1...(♯‘𝐵))((𝑘 ∈ 𝐵 ↦ 𝐶)‘(𝑓‘𝑛)))
80	1	adantr 472	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → 𝐴 ⊆ 𝐵)
81	80	resmptd 5562	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → ((𝑘 ∈ 𝐵 ↦ 𝐶) ↾ 𝐴) = (𝑘 ∈ 𝐴 ↦ 𝐶))
82	81	fveq1d 6306	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (((𝑘 ∈ 𝐵 ↦ 𝐶) ↾ 𝐴)‘𝑚) = ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚))
83		fvres 6320	. . . . . . . . . 10 ⊢ (𝑚 ∈ 𝐴 → (((𝑘 ∈ 𝐵 ↦ 𝐶) ↾ 𝐴)‘𝑚) = ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚))
84	82, 83	sylan9req 2779	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑚 ∈ 𝐴) → ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚) = ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚))
85	84	prodeq2dv 14773	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚) = ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚))
86		fveq2 6304	. . . . . . . . 9 ⊢ (𝑚 = (𝑓‘𝑛) → ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚) = ((𝑘 ∈ 𝐵 ↦ 𝐶)‘(𝑓‘𝑛)))
87		fzfid 12887	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (1...(♯‘𝐵)) ∈ Fin)
88	87, 15	fisuppfi 8399	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (^◡𝑓 “ 𝐴) ∈ Fin)
89		f1of1 6249	. . . . . . . . . . . 12 ⊢ (𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵 → 𝑓:(1...(♯‘𝐵))–1-1→𝐵)
90	13, 89	syl 17	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → 𝑓:(1...(♯‘𝐵))–1-1→𝐵)
91		f1ores 6264	. . . . . . . . . . 11 ⊢ ((𝑓:(1...(♯‘𝐵))–1-1→𝐵 ∧ (^◡𝑓 “ 𝐴) ⊆ (1...(♯‘𝐵))) → (𝑓 ↾ (^◡𝑓 “ 𝐴)):(^◡𝑓 “ 𝐴)–1-1-onto→(𝑓 “ (^◡𝑓 “ 𝐴)))
92	90, 18, 91	syl2anc 696	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (𝑓 ↾ (^◡𝑓 “ 𝐴)):(^◡𝑓 “ 𝐴)–1-1-onto→(𝑓 “ (^◡𝑓 “ 𝐴)))
93		f1ofo 6257	. . . . . . . . . . . . 13 ⊢ (𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵 → 𝑓:(1...(♯‘𝐵))–onto→𝐵)
94	13, 93	syl 17	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → 𝑓:(1...(♯‘𝐵))–onto→𝐵)
95		foimacnv 6267	. . . . . . . . . . . 12 ⊢ ((𝑓:(1...(♯‘𝐵))–onto→𝐵 ∧ 𝐴 ⊆ 𝐵) → (𝑓 “ (^◡𝑓 “ 𝐴)) = 𝐴)
96	94, 80, 95	syl2anc 696	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (𝑓 “ (^◡𝑓 “ 𝐴)) = 𝐴)
97		f1oeq3 6242	. . . . . . . . . . 11 ⊢ ((𝑓 “ (^◡𝑓 “ 𝐴)) = 𝐴 → ((𝑓 ↾ (^◡𝑓 “ 𝐴)):(^◡𝑓 “ 𝐴)–1-1-onto→(𝑓 “ (^◡𝑓 “ 𝐴)) ↔ (𝑓 ↾ (^◡𝑓 “ 𝐴)):(^◡𝑓 “ 𝐴)–1-1-onto→𝐴))
98	96, 97	syl 17	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → ((𝑓 ↾ (^◡𝑓 “ 𝐴)):(^◡𝑓 “ 𝐴)–1-1-onto→(𝑓 “ (^◡𝑓 “ 𝐴)) ↔ (𝑓 ↾ (^◡𝑓 “ 𝐴)):(^◡𝑓 “ 𝐴)–1-1-onto→𝐴))
99	92, 98	mpbid 222	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (𝑓 ↾ (^◡𝑓 “ 𝐴)):(^◡𝑓 “ 𝐴)–1-1-onto→𝐴)
100		fvres 6320	. . . . . . . . . 10 ⊢ (𝑛 ∈ (^◡𝑓 “ 𝐴) → ((𝑓 ↾ (^◡𝑓 “ 𝐴))‘𝑛) = (𝑓‘𝑛))
101	100	adantl 473	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ (^◡𝑓 “ 𝐴)) → ((𝑓 ↾ (^◡𝑓 “ 𝐴))‘𝑛) = (𝑓‘𝑛))
102	80	sselda 3709	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑚 ∈ 𝐴) → 𝑚 ∈ 𝐵)
103	40	ffvelrnda 6474	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑚 ∈ 𝐵) → ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚) ∈ ℂ)
104	102, 103	syldan 488	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑚 ∈ 𝐴) → ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚) ∈ ℂ)
105	86, 88, 99, 101, 104	fprodf1o 14796	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚) = ∏𝑛 ∈ (^◡𝑓 “ 𝐴)((𝑘 ∈ 𝐵 ↦ 𝐶)‘(𝑓‘𝑛)))
106	85, 105	eqtrd 2758	. . . . . . 7 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚) = ∏𝑛 ∈ (^◡𝑓 “ 𝐴)((𝑘 ∈ 𝐵 ↦ 𝐶)‘(𝑓‘𝑛)))
107		eqidd 2725	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ (1...(♯‘𝐵))) → (𝑓‘𝑛) = (𝑓‘𝑛))
108	86, 87, 13, 107, 103	fprodf1o 14796	. . . . . . 7 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → ∏𝑚 ∈ 𝐵 ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚) = ∏𝑛 ∈ (1...(♯‘𝐵))((𝑘 ∈ 𝐵 ↦ 𝐶)‘(𝑓‘𝑛)))
109	79, 106, 108	3eqtr4d 2768	. . . . . 6 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚) = ∏𝑚 ∈ 𝐵 ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚))
110		prodfc 14795	. . . . . 6 ⊢ ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚) = ∏𝑘 ∈ 𝐴 𝐶
111		prodfc 14795	. . . . . 6 ⊢ ∏𝑚 ∈ 𝐵 ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚) = ∏𝑘 ∈ 𝐵 𝐶
112	109, 110, 111	3eqtr3g 2781	. . . . 5 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ 𝐵 𝐶)
113	112	expr 644	. . . 4 ⊢ ((𝜑 ∧ (♯‘𝐵) ∈ ℕ) → (𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵 → ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ 𝐵 𝐶))
114	113	exlimdv 1974	. . 3 ⊢ ((𝜑 ∧ (♯‘𝐵) ∈ ℕ) → (∃𝑓 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵 → ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ 𝐵 𝐶))
115	114	expimpd 630	. 2 ⊢ (𝜑 → (((♯‘𝐵) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵) → ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ 𝐵 𝐶))
116		fprodss.4	. . 3 ⊢ (𝜑 → 𝐵 ∈ Fin)
117		fz1f1o 14561	. . 3 ⊢ (𝐵 ∈ Fin → (𝐵 = ∅ ∨ ((♯‘𝐵) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)))
118	116, 117	syl 17	. 2 ⊢ (𝜑 → (𝐵 = ∅ ∨ ((♯‘𝐵) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)))
119	11, 115, 118	mpjaod 395	1 ⊢ (𝜑 → ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ 𝐵 𝐶)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 196 ∨ wo 382 ∧ wa 383 = wceq 1596 ∃wex 1817 ∈ wcel 2103 ∖ cdif 3677 ⊆ wss 3680 ∅c0 4023 {csn 4285 ↦ cmpt 4837 ^◡ccnv 5217 dom cdm 5218 ↾ cres 5220 “ cima 5221 Fn wfn 5996 ⟶wf 5997 –1-1→wf1 5998 –onto→wfo 5999 –1-1-onto→wf1o 6000 ‘cfv 6001 (class class class)co 6765 Fincfn 8072 ℂcc 10047 1c1 10050 ℕcn 11133 ℤ_≥cuz 11800 ...cfz 12440 ♯chash 13232 ∏cprod 14755

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1835 ax-4 1850 ax-5 1952 ax-6 2018 ax-7 2054 ax-8 2105 ax-9 2112 ax-10 2132 ax-11 2147 ax-12 2160 ax-13 2355 ax-ext 2704 ax-rep 4879 ax-sep 4889 ax-nul 4897 ax-pow 4948 ax-pr 5011 ax-un 7066 ax-inf2 8651 ax-cnex 10105 ax-resscn 10106 ax-1cn 10107 ax-icn 10108 ax-addcl 10109 ax-addrcl 10110 ax-mulcl 10111 ax-mulrcl 10112 ax-mulcom 10113 ax-addass 10114 ax-mulass 10115 ax-distr 10116 ax-i2m1 10117 ax-1ne0 10118 ax-1rid 10119 ax-rnegex 10120 ax-rrecex 10121 ax-cnre 10122 ax-pre-lttri 10123 ax-pre-lttrn 10124 ax-pre-ltadd 10125 ax-pre-mulgt0 10126 ax-pre-sup 10127

This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1073 df-3an 1074 df-tru 1599 df-fal 1602 df-ex 1818 df-nf 1823 df-sb 2011 df-eu 2575 df-mo 2576 df-clab 2711 df-cleq 2717 df-clel 2720 df-nfc 2855 df-ne 2897 df-nel 3000 df-ral 3019 df-rex 3020 df-reu 3021 df-rmo 3022 df-rab 3023 df-v 3306 df-sbc 3542 df-csb 3640 df-dif 3683 df-un 3685 df-in 3687 df-ss 3694 df-pss 3696 df-nul 4024 df-if 4195 df-pw 4268 df-sn 4286 df-pr 4288 df-tp 4290 df-op 4292 df-uni 4545 df-int 4584 df-iun 4630 df-br 4761 df-opab 4821 df-mpt 4838 df-tr 4861 df-id 5128 df-eprel 5133 df-po 5139 df-so 5140 df-fr 5177 df-se 5178 df-we 5179 df-xp 5224 df-rel 5225 df-cnv 5226 df-co 5227 df-dm 5228 df-rn 5229 df-res 5230 df-ima 5231 df-pred 5793 df-ord 5839 df-on 5840 df-lim 5841 df-suc 5842 df-iota 5964 df-fun 6003 df-fn 6004 df-f 6005 df-f1 6006 df-fo 6007 df-f1o 6008 df-fv 6009 df-isom 6010 df-riota 6726 df-ov 6768 df-oprab 6769 df-mpt2 6770 df-om 7183 df-1st 7285 df-2nd 7286 df-wrecs 7527 df-recs 7588 df-rdg 7626 df-1o 7680 df-oadd 7684 df-er 7862 df-en 8073 df-dom 8074 df-sdom 8075 df-fin 8076 df-sup 8464 df-oi 8531 df-card 8878 df-pnf 10189 df-mnf 10190 df-xr 10191 df-ltxr 10192 df-le 10193 df-sub 10381 df-neg 10382 df-div 10798 df-nn 11134 df-2 11192 df-3 11193 df-n0 11406 df-z 11491 df-uz 11801 df-rp 11947 df-fz 12441 df-fzo 12581 df-seq 12917 df-exp 12976 df-hash 13233 df-cj 13959 df-re 13960 df-im 13961 df-sqrt 14095 df-abs 14096 df-clim 14339 df-prod 14756

This theorem is referenced by: fprodsplit 14816

W3C validator