Theorem fprodf1o 14515

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 14512	. . . 4 ⊢ ∏𝑘 ∈ ∅ 𝐵 = 1
2		fprodf1o.3	. . . . . . . . 9 ⊢ (𝜑 → 𝐹:𝐶–1-1-onto→𝐴)
3	2	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐶 = ∅) → 𝐹:𝐶–1-1-onto→𝐴)
4		f1oeq2 6041	. . . . . . . . 9 ⊢ (𝐶 = ∅ → (𝐹:𝐶–1-1-onto→𝐴 ↔ 𝐹:∅–1-1-onto→𝐴))
5	4	adantl 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐶 = ∅) → (𝐹:𝐶–1-1-onto→𝐴 ↔ 𝐹:∅–1-1-onto→𝐴))
6	3, 5	mpbid 221	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐶 = ∅) → 𝐹:∅–1-1-onto→𝐴)
7		f1ofo 6057	. . . . . . 7 ⊢ (𝐹:∅–1-1-onto→𝐴 → 𝐹:∅–onto→𝐴)
8	6, 7	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 = ∅) → 𝐹:∅–onto→𝐴)
9		fo00 6084	. . . . . . 7 ⊢ (𝐹:∅–onto→𝐴 ↔ (𝐹 = ∅ ∧ 𝐴 = ∅))
10	9	simprbi 479	. . . . . 6 ⊢ (𝐹:∅–onto→𝐴 → 𝐴 = ∅)
11	8, 10	syl 17	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 = ∅) → 𝐴 = ∅)
12	11	prodeq1d 14490	. . . 4 ⊢ ((𝜑 ∧ 𝐶 = ∅) → ∏𝑘 ∈ 𝐴 𝐵 = ∏𝑘 ∈ ∅ 𝐵)
13		prodeq1 14478	. . . . . 6 ⊢ (𝐶 = ∅ → ∏𝑛 ∈ 𝐶 𝐷 = ∏𝑛 ∈ ∅ 𝐷)
14		prod0 14512	. . . . . 6 ⊢ ∏𝑛 ∈ ∅ 𝐷 = 1
15	13, 14	syl6eq 2660	. . . . 5 ⊢ (𝐶 = ∅ → ∏𝑛 ∈ 𝐶 𝐷 = 1)
16	15	adantl 481	. . . 4 ⊢ ((𝜑 ∧ 𝐶 = ∅) → ∏𝑛 ∈ 𝐶 𝐷 = 1)
17	1, 12, 16	3eqtr4a 2670	. . 3 ⊢ ((𝜑 ∧ 𝐶 = ∅) → ∏𝑘 ∈ 𝐴 𝐵 = ∏𝑛 ∈ 𝐶 𝐷)
18	17	ex 449	. 2 ⊢ (𝜑 → (𝐶 = ∅ → ∏𝑘 ∈ 𝐴 𝐵 = ∏𝑛 ∈ 𝐶 𝐷))
19		fveq2 6103	. . . . . . . . 9 ⊢ (𝑚 = (𝑓‘𝑛) → (𝐹‘𝑚) = (𝐹‘(𝑓‘𝑛)))
20	19	fveq2d 6107	. . . . . . . 8 ⊢ (𝑚 = (𝑓‘𝑛) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚)) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘(𝑓‘𝑛))))
21		simprl 790	. . . . . . . 8 ⊢ ((𝜑 ∧ ((#‘𝐶) ∈ ℕ ∧ 𝑓:(1...(#‘𝐶))–1-1-onto→𝐶)) → (#‘𝐶) ∈ ℕ)
22		simprr 792	. . . . . . . 8 ⊢ ((𝜑 ∧ ((#‘𝐶) ∈ ℕ ∧ 𝑓:(1...(#‘𝐶))–1-1-onto→𝐶)) → 𝑓:(1...(#‘𝐶))–1-1-onto→𝐶)
23		f1of 6050	. . . . . . . . . . . 12 ⊢ (𝐹:𝐶–1-1-onto→𝐴 → 𝐹:𝐶⟶𝐴)
24	2, 23	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹:𝐶⟶𝐴)
25	24	ffvelrnda 6267	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐶) → (𝐹‘𝑚) ∈ 𝐴)
26		fprodf1o.5	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ)
27		eqid 2610	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ 𝐴 ↦ 𝐵) = (𝑘 ∈ 𝐴 ↦ 𝐵)
28	26, 27	fmptd 6292	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ 𝐵):𝐴⟶ℂ)
29	28	ffvelrnda 6267	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝐹‘𝑚) ∈ 𝐴) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚)) ∈ ℂ)
30	25, 29	syldan 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐶) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚)) ∈ ℂ)
31	30	adantlr 747	. . . . . . . 8 ⊢ (((𝜑 ∧ ((#‘𝐶) ∈ ℕ ∧ 𝑓:(1...(#‘𝐶))–1-1-onto→𝐶)) ∧ 𝑚 ∈ 𝐶) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚)) ∈ ℂ)
32		simpr 476	. . . . . . . . . . . 12 ⊢ (((#‘𝐶) ∈ ℕ ∧ 𝑓:(1...(#‘𝐶))–1-1-onto→𝐶) → 𝑓:(1...(#‘𝐶))–1-1-onto→𝐶)
33		f1oco 6072	. . . . . . . . . . . 12 ⊢ ((𝐹:𝐶–1-1-onto→𝐴 ∧ 𝑓:(1...(#‘𝐶))–1-1-onto→𝐶) → (𝐹 ∘ 𝑓):(1...(#‘𝐶))–1-1-onto→𝐴)
34	2, 32, 33	syl2an 493	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ((#‘𝐶) ∈ ℕ ∧ 𝑓:(1...(#‘𝐶))–1-1-onto→𝐶)) → (𝐹 ∘ 𝑓):(1...(#‘𝐶))–1-1-onto→𝐴)
35		f1of 6050	. . . . . . . . . . 11 ⊢ ((𝐹 ∘ 𝑓):(1...(#‘𝐶))–1-1-onto→𝐴 → (𝐹 ∘ 𝑓):(1...(#‘𝐶))⟶𝐴)
36	34, 35	syl 17	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((#‘𝐶) ∈ ℕ ∧ 𝑓:(1...(#‘𝐶))–1-1-onto→𝐶)) → (𝐹 ∘ 𝑓):(1...(#‘𝐶))⟶𝐴)
37		fvco3 6185	. . . . . . . . . 10 ⊢ (((𝐹 ∘ 𝑓):(1...(#‘𝐶))⟶𝐴 ∧ 𝑛 ∈ (1...(#‘𝐶))) → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ (𝐹 ∘ 𝑓))‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘((𝐹 ∘ 𝑓)‘𝑛)))
38	36, 37	sylan 487	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((#‘𝐶) ∈ ℕ ∧ 𝑓:(1...(#‘𝐶))–1-1-onto→𝐶)) ∧ 𝑛 ∈ (1...(#‘𝐶))) → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ (𝐹 ∘ 𝑓))‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘((𝐹 ∘ 𝑓)‘𝑛)))
39		f1of 6050	. . . . . . . . . . . . 13 ⊢ (𝑓:(1...(#‘𝐶))–1-1-onto→𝐶 → 𝑓:(1...(#‘𝐶))⟶𝐶)
40	39	adantl 481	. . . . . . . . . . . 12 ⊢ (((#‘𝐶) ∈ ℕ ∧ 𝑓:(1...(#‘𝐶))–1-1-onto→𝐶) → 𝑓:(1...(#‘𝐶))⟶𝐶)
41	40	adantl 481	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ((#‘𝐶) ∈ ℕ ∧ 𝑓:(1...(#‘𝐶))–1-1-onto→𝐶)) → 𝑓:(1...(#‘𝐶))⟶𝐶)
42		fvco3 6185	. . . . . . . . . . 11 ⊢ ((𝑓:(1...(#‘𝐶))⟶𝐶 ∧ 𝑛 ∈ (1...(#‘𝐶))) → ((𝐹 ∘ 𝑓)‘𝑛) = (𝐹‘(𝑓‘𝑛)))
43	41, 42	sylan 487	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((#‘𝐶) ∈ ℕ ∧ 𝑓:(1...(#‘𝐶))–1-1-onto→𝐶)) ∧ 𝑛 ∈ (1...(#‘𝐶))) → ((𝐹 ∘ 𝑓)‘𝑛) = (𝐹‘(𝑓‘𝑛)))
44	43	fveq2d 6107	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((#‘𝐶) ∈ ℕ ∧ 𝑓:(1...(#‘𝐶))–1-1-onto→𝐶)) ∧ 𝑛 ∈ (1...(#‘𝐶))) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘((𝐹 ∘ 𝑓)‘𝑛)) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘(𝑓‘𝑛))))
45	38, 44	eqtrd 2644	. . . . . . . 8 ⊢ (((𝜑 ∧ ((#‘𝐶) ∈ ℕ ∧ 𝑓:(1...(#‘𝐶))–1-1-onto→𝐶)) ∧ 𝑛 ∈ (1...(#‘𝐶))) → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ (𝐹 ∘ 𝑓))‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘(𝑓‘𝑛))))
46	20, 21, 22, 31, 45	fprod 14510	. . . . . . 7 ⊢ ((𝜑 ∧ ((#‘𝐶) ∈ ℕ ∧ 𝑓:(1...(#‘𝐶))–1-1-onto→𝐶)) → ∏𝑚 ∈ 𝐶 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚)) = (seq1( · , ((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ (𝐹 ∘ 𝑓)))‘(#‘𝐶)))
47		fprodf1o.4	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐶) → (𝐹‘𝑛) = 𝐺)
48	24	ffvelrnda 6267	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐶) → (𝐹‘𝑛) ∈ 𝐴)
49	47, 48	eqeltrrd 2689	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐶) → 𝐺 ∈ 𝐴)
50		fprodf1o.1	. . . . . . . . . . . . . 14 ⊢ (𝑘 = 𝐺 → 𝐵 = 𝐷)
51	50, 27	fvmpti 6190	. . . . . . . . . . . . 13 ⊢ (𝐺 ∈ 𝐴 → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝐺) = ( I ‘𝐷))
52	49, 51	syl 17	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐶) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝐺) = ( I ‘𝐷))
53	47	fveq2d 6107	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐶) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑛)) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝐺))
54		eqid 2610	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ 𝐶 ↦ 𝐷) = (𝑛 ∈ 𝐶 ↦ 𝐷)
55	54	fvmpt2i 6199	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ 𝐶 → ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑛) = ( I ‘𝐷))
56	55	adantl 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐶) → ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑛) = ( I ‘𝐷))
57	52, 53, 56	3eqtr4rd 2655	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐶) → ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑛)))
58	57	ralrimiva 2949	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑛 ∈ 𝐶 ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑛)))
59		nffvmpt1 6111	. . . . . . . . . . . 12 ⊢ Ⅎ𝑛((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚)
60	59	nfeq1 2764	. . . . . . . . . . 11 ⊢ Ⅎ𝑛((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚))
61		fveq2 6103	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑚 → ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑛) = ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚))
62		fveq2 6103	. . . . . . . . . . . . 13 ⊢ (𝑛 = 𝑚 → (𝐹‘𝑛) = (𝐹‘𝑚))
63	62	fveq2d 6107	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑚 → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑛)) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚)))
64	61, 63	eqeq12d 2625	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑚 → (((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑛)) ↔ ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚))))
65	60, 64	rspc 3276	. . . . . . . . . 10 ⊢ (𝑚 ∈ 𝐶 → (∀𝑛 ∈ 𝐶 ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑛)) → ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚))))
66	58, 65	mpan9 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐶) → ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚)))
67	66	adantlr 747	. . . . . . . 8 ⊢ (((𝜑 ∧ ((#‘𝐶) ∈ ℕ ∧ 𝑓:(1...(#‘𝐶))–1-1-onto→𝐶)) ∧ 𝑚 ∈ 𝐶) → ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚)))
68	67	prodeq2dv 14492	. . . . . . 7 ⊢ ((𝜑 ∧ ((#‘𝐶) ∈ ℕ ∧ 𝑓:(1...(#‘𝐶))–1-1-onto→𝐶)) → ∏𝑚 ∈ 𝐶 ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚) = ∏𝑚 ∈ 𝐶 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚)))
69		fveq2 6103	. . . . . . . 8 ⊢ (𝑚 = ((𝐹 ∘ 𝑓)‘𝑛) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘((𝐹 ∘ 𝑓)‘𝑛)))
70	28	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((#‘𝐶) ∈ ℕ ∧ 𝑓:(1...(#‘𝐶))–1-1-onto→𝐶)) → (𝑘 ∈ 𝐴 ↦ 𝐵):𝐴⟶ℂ)
71	70	ffvelrnda 6267	. . . . . . . 8 ⊢ (((𝜑 ∧ ((#‘𝐶) ∈ ℕ ∧ 𝑓:(1...(#‘𝐶))–1-1-onto→𝐶)) ∧ 𝑚 ∈ 𝐴) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) ∈ ℂ)
72	69, 21, 34, 71, 38	fprod 14510	. . . . . . 7 ⊢ ((𝜑 ∧ ((#‘𝐶) ∈ ℕ ∧ 𝑓:(1...(#‘𝐶))–1-1-onto→𝐶)) → ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = (seq1( · , ((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ (𝐹 ∘ 𝑓)))‘(#‘𝐶)))
73	46, 68, 72	3eqtr4rd 2655	. . . . . 6 ⊢ ((𝜑 ∧ ((#‘𝐶) ∈ ℕ ∧ 𝑓:(1...(#‘𝐶))–1-1-onto→𝐶)) → ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = ∏𝑚 ∈ 𝐶 ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚))
74		prodfc 14514	. . . . . 6 ⊢ ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = ∏𝑘 ∈ 𝐴 𝐵
75		prodfc 14514	. . . . . 6 ⊢ ∏𝑚 ∈ 𝐶 ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚) = ∏𝑛 ∈ 𝐶 𝐷
76	73, 74, 75	3eqtr3g 2667	. . . . 5 ⊢ ((𝜑 ∧ ((#‘𝐶) ∈ ℕ ∧ 𝑓:(1...(#‘𝐶))–1-1-onto→𝐶)) → ∏𝑘 ∈ 𝐴 𝐵 = ∏𝑛 ∈ 𝐶 𝐷)
77	76	expr 641	. . . 4 ⊢ ((𝜑 ∧ (#‘𝐶) ∈ ℕ) → (𝑓:(1...(#‘𝐶))–1-1-onto→𝐶 → ∏𝑘 ∈ 𝐴 𝐵 = ∏𝑛 ∈ 𝐶 𝐷))
78	77	exlimdv 1848	. . 3 ⊢ ((𝜑 ∧ (#‘𝐶) ∈ ℕ) → (∃𝑓 𝑓:(1...(#‘𝐶))–1-1-onto→𝐶 → ∏𝑘 ∈ 𝐴 𝐵 = ∏𝑛 ∈ 𝐶 𝐷))
79	78	expimpd 627	. 2 ⊢ (𝜑 → (((#‘𝐶) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(#‘𝐶))–1-1-onto→𝐶) → ∏𝑘 ∈ 𝐴 𝐵 = ∏𝑛 ∈ 𝐶 𝐷))
80		fprodf1o.2	. . 3 ⊢ (𝜑 → 𝐶 ∈ Fin)
81		fz1f1o 14288	. . 3 ⊢ (𝐶 ∈ Fin → (𝐶 = ∅ ∨ ((#‘𝐶) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(#‘𝐶))–1-1-onto→𝐶)))
82	80, 81	syl 17	. 2 ⊢ (𝜑 → (𝐶 = ∅ ∨ ((#‘𝐶) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(#‘𝐶))–1-1-onto→𝐶)))
83	18, 79, 82	mpjaod 395	1 ⊢ (𝜑 → ∏𝑘 ∈ 𝐴 𝐵 = ∏𝑛 ∈ 𝐶 𝐷)

Syntax hints:   → wi 4   ↔ wb 195   ∨ wo 382   ∧ wa 383   = wceq 1475  ∃wex 1695   ∈ wcel 1977  ∀wral 2896  ∅c0 3874   ↦ cmpt 4643   I cid 4948   ∘ ccom 5042  ⟶wf 5800  –onto→wfo 5802  –1-1-onto→wf1o 5803  ‘cfv 5804  (class class class)co 6549  Fincfn 7841  ℂcc 9813  1c1 9816   · cmul 9820  ℕcn 10897  ...cfz 12197  seqcseq 12663  #chash 12979  ∏cprod 14474

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-inf2 8421  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892  ax-pre-sup 9893

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-fal 1481  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-se 4998  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-isom 5813  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-oadd 7451  df-er 7629  df-en 7842  df-dom 7843  df-sdom 7844  df-fin 7845  df-sup 8231  df-oi 8298  df-card 8648  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-div 10564  df-nn 10898  df-2 10956  df-3 10957  df-n0 11170  df-z 11255  df-uz 11564  df-rp 11709  df-fz 12198  df-fzo 12335  df-seq 12664  df-exp 12723  df-hash 12980  df-cj 13687  df-re 13688  df-im 13689  df-sqrt 13823  df-abs 13824  df-clim 14067  df-prod 14475

This theorem is referenced by:  fprodss  14517  fprodshft  14545  fprodrev  14546  fprod2dlem  14549  fprodcnv  14552  gausslemma2dlem1  24891