Theorem fprodf1o 15911

Description: Re-index a finite product using a bijection. (Contributed by Scott Fenton, 7-Dec-2017.)

Hypotheses

Ref	Expression
fprodf1o.1	⊢ (𝑘 = 𝐺 → 𝐵 = 𝐷)
fprodf1o.2	⊢ (𝜑 → 𝐶 ∈ Fin)
fprodf1o.3	⊢ (𝜑 → 𝐹:𝐶–1-1-onto→𝐴)
fprodf1o.4	⊢ ((𝜑 ∧ 𝑛 ∈ 𝐶) → (𝐹‘𝑛) = 𝐺)
fprodf1o.5	⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ)

Assertion

Ref	Expression
fprodf1o	⊢ (𝜑 → ∏𝑘 ∈ 𝐴 𝐵 = ∏𝑛 ∈ 𝐶 𝐷)

Distinct variable groups:   𝐴,𝑘,𝑛   𝐵,𝑛   𝐶,𝑛   𝐷,𝑘   𝑛,𝐹   𝑘,𝐺   𝑘,𝑛,𝜑

Allowed substitution hints:   𝐵(𝑘)   𝐶(𝑘)   𝐷(𝑛)   𝐹(𝑘)   𝐺(𝑛)

Proof of Theorem fprodf1o

Dummy variables 𝑓 𝑚 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		prod0 15908	. . . 4 ⊢ ∏𝑘 ∈ ∅ 𝐵 = 1
2		fprodf1o.3	. . . . . . . . 9 ⊢ (𝜑 → 𝐹:𝐶–1-1-onto→𝐴)
3	2	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐶 = ∅) → 𝐹:𝐶–1-1-onto→𝐴)
4		f1oeq2 6769	. . . . . . . . 9 ⊢ (𝐶 = ∅ → (𝐹:𝐶–1-1-onto→𝐴 ↔ 𝐹:∅–1-1-onto→𝐴))
5	4	adantl 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐶 = ∅) → (𝐹:𝐶–1-1-onto→𝐴 ↔ 𝐹:∅–1-1-onto→𝐴))
6	3, 5	mpbid 232	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐶 = ∅) → 𝐹:∅–1-1-onto→𝐴)
7		f1ofo 6787	. . . . . . 7 ⊢ (𝐹:∅–1-1-onto→𝐴 → 𝐹:∅–onto→𝐴)
8	6, 7	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 = ∅) → 𝐹:∅–onto→𝐴)
9		fo00 6816	. . . . . . 7 ⊢ (𝐹:∅–onto→𝐴 ↔ (𝐹 = ∅ ∧ 𝐴 = ∅))
10	9	simprbi 497	. . . . . 6 ⊢ (𝐹:∅–onto→𝐴 → 𝐴 = ∅)
11	8, 10	syl 17	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 = ∅) → 𝐴 = ∅)
12	11	prodeq1d 15885	. . . 4 ⊢ ((𝜑 ∧ 𝐶 = ∅) → ∏𝑘 ∈ 𝐴 𝐵 = ∏𝑘 ∈ ∅ 𝐵)
13		prodeq1 15872	. . . . . 6 ⊢ (𝐶 = ∅ → ∏𝑛 ∈ 𝐶 𝐷 = ∏𝑛 ∈ ∅ 𝐷)
14		prod0 15908	. . . . . 6 ⊢ ∏𝑛 ∈ ∅ 𝐷 = 1
15	13, 14	eqtrdi 2787	. . . . 5 ⊢ (𝐶 = ∅ → ∏𝑛 ∈ 𝐶 𝐷 = 1)
16	15	adantl 481	. . . 4 ⊢ ((𝜑 ∧ 𝐶 = ∅) → ∏𝑛 ∈ 𝐶 𝐷 = 1)
17	1, 12, 16	3eqtr4a 2797	. . 3 ⊢ ((𝜑 ∧ 𝐶 = ∅) → ∏𝑘 ∈ 𝐴 𝐵 = ∏𝑛 ∈ 𝐶 𝐷)
18	17	ex 412	. 2 ⊢ (𝜑 → (𝐶 = ∅ → ∏𝑘 ∈ 𝐴 𝐵 = ∏𝑛 ∈ 𝐶 𝐷))
19		2fveq3 6845	. . . . . . . 8 ⊢ (𝑚 = (𝑓‘𝑛) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚)) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘(𝑓‘𝑛))))
20		simprl 771	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) → (♯‘𝐶) ∈ ℕ)
21		simprr 773	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) → 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)
22		f1of 6780	. . . . . . . . . . . 12 ⊢ (𝐹:𝐶–1-1-onto→𝐴 → 𝐹:𝐶⟶𝐴)
23	2, 22	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹:𝐶⟶𝐴)
24	23	ffvelcdmda 7036	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐶) → (𝐹‘𝑚) ∈ 𝐴)
25		fprodf1o.5	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ)
26	25	fmpttd 7067	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ 𝐵):𝐴⟶ℂ)
27	26	ffvelcdmda 7036	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝐹‘𝑚) ∈ 𝐴) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚)) ∈ ℂ)
28	24, 27	syldan 592	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐶) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚)) ∈ ℂ)
29	28	adantlr 716	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) ∧ 𝑚 ∈ 𝐶) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚)) ∈ ℂ)
30		simpr 484	. . . . . . . . . . . 12 ⊢ (((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶) → 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)
31		f1oco 6803	. . . . . . . . . . . 12 ⊢ ((𝐹:𝐶–1-1-onto→𝐴 ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶) → (𝐹 ∘ 𝑓):(1...(♯‘𝐶))–1-1-onto→𝐴)
32	2, 30, 31	syl2an 597	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) → (𝐹 ∘ 𝑓):(1...(♯‘𝐶))–1-1-onto→𝐴)
33		f1of 6780	. . . . . . . . . . 11 ⊢ ((𝐹 ∘ 𝑓):(1...(♯‘𝐶))–1-1-onto→𝐴 → (𝐹 ∘ 𝑓):(1...(♯‘𝐶))⟶𝐴)
34	32, 33	syl 17	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) → (𝐹 ∘ 𝑓):(1...(♯‘𝐶))⟶𝐴)
35		fvco3 6939	. . . . . . . . . 10 ⊢ (((𝐹 ∘ 𝑓):(1...(♯‘𝐶))⟶𝐴 ∧ 𝑛 ∈ (1...(♯‘𝐶))) → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ (𝐹 ∘ 𝑓))‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘((𝐹 ∘ 𝑓)‘𝑛)))
36	34, 35	sylan 581	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) ∧ 𝑛 ∈ (1...(♯‘𝐶))) → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ (𝐹 ∘ 𝑓))‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘((𝐹 ∘ 𝑓)‘𝑛)))
37		f1of 6780	. . . . . . . . . . . . 13 ⊢ (𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶 → 𝑓:(1...(♯‘𝐶))⟶𝐶)
38	37	adantl 481	. . . . . . . . . . . 12 ⊢ (((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶) → 𝑓:(1...(♯‘𝐶))⟶𝐶)
39	38	adantl 481	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) → 𝑓:(1...(♯‘𝐶))⟶𝐶)
40		fvco3 6939	. . . . . . . . . . 11 ⊢ ((𝑓:(1...(♯‘𝐶))⟶𝐶 ∧ 𝑛 ∈ (1...(♯‘𝐶))) → ((𝐹 ∘ 𝑓)‘𝑛) = (𝐹‘(𝑓‘𝑛)))
41	39, 40	sylan 581	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) ∧ 𝑛 ∈ (1...(♯‘𝐶))) → ((𝐹 ∘ 𝑓)‘𝑛) = (𝐹‘(𝑓‘𝑛)))
42	41	fveq2d 6844	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) ∧ 𝑛 ∈ (1...(♯‘𝐶))) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘((𝐹 ∘ 𝑓)‘𝑛)) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘(𝑓‘𝑛))))
43	36, 42	eqtrd 2771	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) ∧ 𝑛 ∈ (1...(♯‘𝐶))) → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ (𝐹 ∘ 𝑓))‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘(𝑓‘𝑛))))
44	19, 20, 21, 29, 43	fprod 15906	. . . . . . 7 ⊢ ((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) → ∏𝑚 ∈ 𝐶 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚)) = (seq1( · , ((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ (𝐹 ∘ 𝑓)))‘(♯‘𝐶)))
45		fprodf1o.4	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐶) → (𝐹‘𝑛) = 𝐺)
46	23	ffvelcdmda 7036	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐶) → (𝐹‘𝑛) ∈ 𝐴)
47	45, 46	eqeltrrd 2837	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐶) → 𝐺 ∈ 𝐴)
48		fprodf1o.1	. . . . . . . . . . . . . 14 ⊢ (𝑘 = 𝐺 → 𝐵 = 𝐷)
49		eqid 2736	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ 𝐴 ↦ 𝐵) = (𝑘 ∈ 𝐴 ↦ 𝐵)
50	48, 49	fvmpti 6946	. . . . . . . . . . . . 13 ⊢ (𝐺 ∈ 𝐴 → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝐺) = ( I ‘𝐷))
51	47, 50	syl 17	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐶) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝐺) = ( I ‘𝐷))
52	45	fveq2d 6844	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐶) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑛)) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝐺))
53		eqid 2736	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ 𝐶 ↦ 𝐷) = (𝑛 ∈ 𝐶 ↦ 𝐷)
54	53	fvmpt2i 6958	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ 𝐶 → ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑛) = ( I ‘𝐷))
55	54	adantl 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐶) → ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑛) = ( I ‘𝐷))
56	51, 52, 55	3eqtr4rd 2782	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐶) → ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑛)))
57	56	ralrimiva 3129	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑛 ∈ 𝐶 ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑛)))
58		nffvmpt1 6851	. . . . . . . . . . . 12 ⊢ Ⅎ𝑛((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚)
59	58	nfeq1 2914	. . . . . . . . . . 11 ⊢ Ⅎ𝑛((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚))
60		fveq2 6840	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑚 → ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑛) = ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚))
61		2fveq3 6845	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑚 → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑛)) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚)))
62	60, 61	eqeq12d 2752	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑚 → (((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑛)) ↔ ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚))))
63	59, 62	rspc 3552	. . . . . . . . . 10 ⊢ (𝑚 ∈ 𝐶 → (∀𝑛 ∈ 𝐶 ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑛)) → ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚))))
64	57, 63	mpan9 506	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐶) → ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚)))
65	64	adantlr 716	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) ∧ 𝑚 ∈ 𝐶) → ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚)))
66	65	prodeq2dv 15887	. . . . . . 7 ⊢ ((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) → ∏𝑚 ∈ 𝐶 ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚) = ∏𝑚 ∈ 𝐶 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚)))
67		fveq2 6840	. . . . . . . 8 ⊢ (𝑚 = ((𝐹 ∘ 𝑓)‘𝑛) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘((𝐹 ∘ 𝑓)‘𝑛)))
68	26	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) → (𝑘 ∈ 𝐴 ↦ 𝐵):𝐴⟶ℂ)
69	68	ffvelcdmda 7036	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) ∧ 𝑚 ∈ 𝐴) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) ∈ ℂ)
70	67, 20, 32, 69, 36	fprod 15906	. . . . . . 7 ⊢ ((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) → ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = (seq1( · , ((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ (𝐹 ∘ 𝑓)))‘(♯‘𝐶)))
71	44, 66, 70	3eqtr4rd 2782	. . . . . 6 ⊢ ((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) → ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = ∏𝑚 ∈ 𝐶 ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚))
72		prodfc 15910	. . . . . 6 ⊢ ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = ∏𝑘 ∈ 𝐴 𝐵
73		prodfc 15910	. . . . . 6 ⊢ ∏𝑚 ∈ 𝐶 ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚) = ∏𝑛 ∈ 𝐶 𝐷
74	71, 72, 73	3eqtr3g 2794	. . . . 5 ⊢ ((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) → ∏𝑘 ∈ 𝐴 𝐵 = ∏𝑛 ∈ 𝐶 𝐷)
75	74	expr 456	. . . 4 ⊢ ((𝜑 ∧ (♯‘𝐶) ∈ ℕ) → (𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶 → ∏𝑘 ∈ 𝐴 𝐵 = ∏𝑛 ∈ 𝐶 𝐷))
76	75	exlimdv 1935	. . 3 ⊢ ((𝜑 ∧ (♯‘𝐶) ∈ ℕ) → (∃𝑓 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶 → ∏𝑘 ∈ 𝐴 𝐵 = ∏𝑛 ∈ 𝐶 𝐷))
77	76	expimpd 453	. 2 ⊢ (𝜑 → (((♯‘𝐶) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶) → ∏𝑘 ∈ 𝐴 𝐵 = ∏𝑛 ∈ 𝐶 𝐷))
78		fprodf1o.2	. . 3 ⊢ (𝜑 → 𝐶 ∈ Fin)
79		fz1f1o 15672	. . 3 ⊢ (𝐶 ∈ Fin → (𝐶 = ∅ ∨ ((♯‘𝐶) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)))
80	78, 79	syl 17	. 2 ⊢ (𝜑 → (𝐶 = ∅ ∨ ((♯‘𝐶) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)))
81	18, 77, 80	mpjaod 861	1 ⊢ (𝜑 → ∏𝑘 ∈ 𝐴 𝐵 = ∏𝑛 ∈ 𝐶 𝐷)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 848   = wceq 1542  ∃wex 1781   ∈ wcel 2114  ∀wral 3051  ∅c0 4273   ↦ cmpt 5166   I cid 5525   ∘ ccom 5635  ⟶wf 6494  –onto→wfo 6496  –1-1-onto→wf1o 6497  ‘cfv 6498  (class class class)co 7367  Fincfn 8893  ℂcc 11036  1c1 11039   · cmul 11043  ℕcn 12174  ...cfz 13461  seqcseq 13963  ♯chash 14292  ∏cprod 15868

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-inf2 9562  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115  ax-pre-sup 11116

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-se 5585  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-isom 6507  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-1st 7942  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-1o 8405  df-er 8643  df-en 8894  df-dom 8895  df-sdom 8896  df-fin 8897  df-sup 9355  df-oi 9425  df-card 9863  df-pnf 11181  df-mnf 11182  df-xr 11183  df-ltxr 11184  df-le 11185  df-sub 11379  df-neg 11380  df-div 11808  df-nn 12175  df-2 12244  df-3 12245  df-n0 12438  df-z 12525  df-uz 12789  df-rp 12943  df-fz 13462  df-fzo 13609  df-seq 13964  df-exp 14024  df-hash 14293  df-cj 15061  df-re 15062  df-im 15063  df-sqrt 15197  df-abs 15198  df-clim 15450  df-prod 15869

This theorem is referenced by:  fprodss  15913  fprodshft  15941  fprodrev  15942  fprod2dlem  15945  fprodcnv  15948  gausslemma2dlem1  27329  hgt750lemg  34798