bcprod - Mathbox for Scott Fenton

	Mathbox for Scott Fenton		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > bcprod		Structured version Visualization version GIF version

Theorem bcprod 35718

Description: A product identity for binomial coefficients. (Contributed by Scott Fenton, 23-Jun-2020.)

**Assertion**
Ref	Expression
bcprod	⊢ (𝑁 ∈ ℕ → ∏𝑘 ∈ (1...(𝑁 − 1))((𝑁 − 1)C𝑘) = ∏𝑘 ∈ (1...(𝑁 − 1))(𝑘↑((2 · 𝑘) − 𝑁)))

Distinct variable group: 𝑘,𝑁

Proof of Theorem bcprod Dummy variables 𝑛 𝑚 𝑗 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		oveq1 7438	. . . . . . 7 ⊢ (𝑚 = 1 → (𝑚 − 1) = (1 − 1))
2		1m1e0 12336	. . . . . . 7 ⊢ (1 − 1) = 0
3	1, 2	eqtrdi 2791	. . . . . 6 ⊢ (𝑚 = 1 → (𝑚 − 1) = 0)
4	3	oveq2d 7447	. . . . 5 ⊢ (𝑚 = 1 → (1...(𝑚 − 1)) = (1...0))
5		fz10 13582	. . . . 5 ⊢ (1...0) = ∅
6	4, 5	eqtrdi 2791	. . . 4 ⊢ (𝑚 = 1 → (1...(𝑚 − 1)) = ∅)
7	3	oveq1d 7446	. . . . 5 ⊢ (𝑚 = 1 → ((𝑚 − 1)C𝑘) = (0C𝑘))
8	7	adantr 480	. . . 4 ⊢ ((𝑚 = 1 ∧ 𝑘 ∈ (1...(𝑚 − 1))) → ((𝑚 − 1)C𝑘) = (0C𝑘))
9	6, 8	prodeq12dv 15959	. . 3 ⊢ (𝑚 = 1 → ∏𝑘 ∈ (1...(𝑚 − 1))((𝑚 − 1)C𝑘) = ∏𝑘 ∈ ∅ (0C𝑘))
10		oveq2 7439	. . . . . 6 ⊢ (𝑚 = 1 → ((2 · 𝑘) − 𝑚) = ((2 · 𝑘) − 1))
11	10	oveq2d 7447	. . . . 5 ⊢ (𝑚 = 1 → (𝑘↑((2 · 𝑘) − 𝑚)) = (𝑘↑((2 · 𝑘) − 1)))
12	11	adantr 480	. . . 4 ⊢ ((𝑚 = 1 ∧ 𝑘 ∈ (1...(𝑚 − 1))) → (𝑘↑((2 · 𝑘) − 𝑚)) = (𝑘↑((2 · 𝑘) − 1)))
13	6, 12	prodeq12dv 15959	. . 3 ⊢ (𝑚 = 1 → ∏𝑘 ∈ (1...(𝑚 − 1))(𝑘↑((2 · 𝑘) − 𝑚)) = ∏𝑘 ∈ ∅ (𝑘↑((2 · 𝑘) − 1)))
14	9, 13	eqeq12d 2751	. 2 ⊢ (𝑚 = 1 → (∏𝑘 ∈ (1...(𝑚 − 1))((𝑚 − 1)C𝑘) = ∏𝑘 ∈ (1...(𝑚 − 1))(𝑘↑((2 · 𝑘) − 𝑚)) ↔ ∏𝑘 ∈ ∅ (0C𝑘) = ∏𝑘 ∈ ∅ (𝑘↑((2 · 𝑘) − 1))))
15		oveq1 7438	. . . . 5 ⊢ (𝑚 = 𝑛 → (𝑚 − 1) = (𝑛 − 1))
16	15	oveq2d 7447	. . . 4 ⊢ (𝑚 = 𝑛 → (1...(𝑚 − 1)) = (1...(𝑛 − 1)))
17	15	oveq1d 7446	. . . . 5 ⊢ (𝑚 = 𝑛 → ((𝑚 − 1)C𝑘) = ((𝑛 − 1)C𝑘))
18	17	adantr 480	. . . 4 ⊢ ((𝑚 = 𝑛 ∧ 𝑘 ∈ (1...(𝑚 − 1))) → ((𝑚 − 1)C𝑘) = ((𝑛 − 1)C𝑘))
19	16, 18	prodeq12dv 15959	. . 3 ⊢ (𝑚 = 𝑛 → ∏𝑘 ∈ (1...(𝑚 − 1))((𝑚 − 1)C𝑘) = ∏𝑘 ∈ (1...(𝑛 − 1))((𝑛 − 1)C𝑘))
20		oveq2 7439	. . . . . 6 ⊢ (𝑚 = 𝑛 → ((2 · 𝑘) − 𝑚) = ((2 · 𝑘) − 𝑛))
21	20	oveq2d 7447	. . . . 5 ⊢ (𝑚 = 𝑛 → (𝑘↑((2 · 𝑘) − 𝑚)) = (𝑘↑((2 · 𝑘) − 𝑛)))
22	21	adantr 480	. . . 4 ⊢ ((𝑚 = 𝑛 ∧ 𝑘 ∈ (1...(𝑚 − 1))) → (𝑘↑((2 · 𝑘) − 𝑚)) = (𝑘↑((2 · 𝑘) − 𝑛)))
23	16, 22	prodeq12dv 15959	. . 3 ⊢ (𝑚 = 𝑛 → ∏𝑘 ∈ (1...(𝑚 − 1))(𝑘↑((2 · 𝑘) − 𝑚)) = ∏𝑘 ∈ (1...(𝑛 − 1))(𝑘↑((2 · 𝑘) − 𝑛)))
24	19, 23	eqeq12d 2751	. 2 ⊢ (𝑚 = 𝑛 → (∏𝑘 ∈ (1...(𝑚 − 1))((𝑚 − 1)C𝑘) = ∏𝑘 ∈ (1...(𝑚 − 1))(𝑘↑((2 · 𝑘) − 𝑚)) ↔ ∏𝑘 ∈ (1...(𝑛 − 1))((𝑛 − 1)C𝑘) = ∏𝑘 ∈ (1...(𝑛 − 1))(𝑘↑((2 · 𝑘) − 𝑛))))
25		oveq1 7438	. . . . 5 ⊢ (𝑚 = (𝑛 + 1) → (𝑚 − 1) = ((𝑛 + 1) − 1))
26	25	oveq2d 7447	. . . 4 ⊢ (𝑚 = (𝑛 + 1) → (1...(𝑚 − 1)) = (1...((𝑛 + 1) − 1)))
27	25	oveq1d 7446	. . . . 5 ⊢ (𝑚 = (𝑛 + 1) → ((𝑚 − 1)C𝑘) = (((𝑛 + 1) − 1)C𝑘))
28	27	adantr 480	. . . 4 ⊢ ((𝑚 = (𝑛 + 1) ∧ 𝑘 ∈ (1...(𝑚 − 1))) → ((𝑚 − 1)C𝑘) = (((𝑛 + 1) − 1)C𝑘))
29	26, 28	prodeq12dv 15959	. . 3 ⊢ (𝑚 = (𝑛 + 1) → ∏𝑘 ∈ (1...(𝑚 − 1))((𝑚 − 1)C𝑘) = ∏𝑘 ∈ (1...((𝑛 + 1) − 1))(((𝑛 + 1) − 1)C𝑘))
30		oveq2 7439	. . . . . 6 ⊢ (𝑚 = (𝑛 + 1) → ((2 · 𝑘) − 𝑚) = ((2 · 𝑘) − (𝑛 + 1)))
31	30	oveq2d 7447	. . . . 5 ⊢ (𝑚 = (𝑛 + 1) → (𝑘↑((2 · 𝑘) − 𝑚)) = (𝑘↑((2 · 𝑘) − (𝑛 + 1))))
32	31	adantr 480	. . . 4 ⊢ ((𝑚 = (𝑛 + 1) ∧ 𝑘 ∈ (1...(𝑚 − 1))) → (𝑘↑((2 · 𝑘) − 𝑚)) = (𝑘↑((2 · 𝑘) − (𝑛 + 1))))
33	26, 32	prodeq12dv 15959	. . 3 ⊢ (𝑚 = (𝑛 + 1) → ∏𝑘 ∈ (1...(𝑚 − 1))(𝑘↑((2 · 𝑘) − 𝑚)) = ∏𝑘 ∈ (1...((𝑛 + 1) − 1))(𝑘↑((2 · 𝑘) − (𝑛 + 1))))
34	29, 33	eqeq12d 2751	. 2 ⊢ (𝑚 = (𝑛 + 1) → (∏𝑘 ∈ (1...(𝑚 − 1))((𝑚 − 1)C𝑘) = ∏𝑘 ∈ (1...(𝑚 − 1))(𝑘↑((2 · 𝑘) − 𝑚)) ↔ ∏𝑘 ∈ (1...((𝑛 + 1) − 1))(((𝑛 + 1) − 1)C𝑘) = ∏𝑘 ∈ (1...((𝑛 + 1) − 1))(𝑘↑((2 · 𝑘) − (𝑛 + 1)))))
35		oveq1 7438	. . . . 5 ⊢ (𝑚 = 𝑁 → (𝑚 − 1) = (𝑁 − 1))
36	35	oveq2d 7447	. . . 4 ⊢ (𝑚 = 𝑁 → (1...(𝑚 − 1)) = (1...(𝑁 − 1)))
37	35	oveq1d 7446	. . . . 5 ⊢ (𝑚 = 𝑁 → ((𝑚 − 1)C𝑘) = ((𝑁 − 1)C𝑘))
38	37	adantr 480	. . . 4 ⊢ ((𝑚 = 𝑁 ∧ 𝑘 ∈ (1...(𝑚 − 1))) → ((𝑚 − 1)C𝑘) = ((𝑁 − 1)C𝑘))
39	36, 38	prodeq12dv 15959	. . 3 ⊢ (𝑚 = 𝑁 → ∏𝑘 ∈ (1...(𝑚 − 1))((𝑚 − 1)C𝑘) = ∏𝑘 ∈ (1...(𝑁 − 1))((𝑁 − 1)C𝑘))
40		oveq2 7439	. . . . . 6 ⊢ (𝑚 = 𝑁 → ((2 · 𝑘) − 𝑚) = ((2 · 𝑘) − 𝑁))
41	40	oveq2d 7447	. . . . 5 ⊢ (𝑚 = 𝑁 → (𝑘↑((2 · 𝑘) − 𝑚)) = (𝑘↑((2 · 𝑘) − 𝑁)))
42	41	adantr 480	. . . 4 ⊢ ((𝑚 = 𝑁 ∧ 𝑘 ∈ (1...(𝑚 − 1))) → (𝑘↑((2 · 𝑘) − 𝑚)) = (𝑘↑((2 · 𝑘) − 𝑁)))
43	36, 42	prodeq12dv 15959	. . 3 ⊢ (𝑚 = 𝑁 → ∏𝑘 ∈ (1...(𝑚 − 1))(𝑘↑((2 · 𝑘) − 𝑚)) = ∏𝑘 ∈ (1...(𝑁 − 1))(𝑘↑((2 · 𝑘) − 𝑁)))
44	39, 43	eqeq12d 2751	. 2 ⊢ (𝑚 = 𝑁 → (∏𝑘 ∈ (1...(𝑚 − 1))((𝑚 − 1)C𝑘) = ∏𝑘 ∈ (1...(𝑚 − 1))(𝑘↑((2 · 𝑘) − 𝑚)) ↔ ∏𝑘 ∈ (1...(𝑁 − 1))((𝑁 − 1)C𝑘) = ∏𝑘 ∈ (1...(𝑁 − 1))(𝑘↑((2 · 𝑘) − 𝑁))))
45		prod0 15976	. . 3 ⊢ ∏𝑘 ∈ ∅ (0C𝑘) = 1
46		prod0 15976	. . 3 ⊢ ∏𝑘 ∈ ∅ (𝑘↑((2 · 𝑘) − 1)) = 1
47	45, 46	eqtr4i 2766	. 2 ⊢ ∏𝑘 ∈ ∅ (0C𝑘) = ∏𝑘 ∈ ∅ (𝑘↑((2 · 𝑘) − 1))
48		simpr 484	. . . . 5 ⊢ ((𝑛 ∈ ℕ ∧ ∏𝑘 ∈ (1...(𝑛 − 1))((𝑛 − 1)C𝑘) = ∏𝑘 ∈ (1...(𝑛 − 1))(𝑘↑((2 · 𝑘) − 𝑛))) → ∏𝑘 ∈ (1...(𝑛 − 1))((𝑛 − 1)C𝑘) = ∏𝑘 ∈ (1...(𝑛 − 1))(𝑘↑((2 · 𝑘) − 𝑛)))
49	48	oveq1d 7446	. . . 4 ⊢ ((𝑛 ∈ ℕ ∧ ∏𝑘 ∈ (1...(𝑛 − 1))((𝑛 − 1)C𝑘) = ∏𝑘 ∈ (1...(𝑛 − 1))(𝑘↑((2 · 𝑘) − 𝑛))) → (∏𝑘 ∈ (1...(𝑛 − 1))((𝑛 − 1)C𝑘) · ((𝑛↑(𝑛 − 1)) / (!‘(𝑛 − 1)))) = (∏𝑘 ∈ (1...(𝑛 − 1))(𝑘↑((2 · 𝑘) − 𝑛)) · ((𝑛↑(𝑛 − 1)) / (!‘(𝑛 − 1)))))
50		nncn 12272	. . . . . . . . 9 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℂ)
51		1cnd 11254	. . . . . . . . 9 ⊢ (𝑛 ∈ ℕ → 1 ∈ ℂ)
52	50, 51	pncand 11619	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ → ((𝑛 + 1) − 1) = 𝑛)
53	52	oveq2d 7447	. . . . . . 7 ⊢ (𝑛 ∈ ℕ → (1...((𝑛 + 1) − 1)) = (1...𝑛))
54	52	oveq1d 7446	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ → (((𝑛 + 1) − 1)C𝑘) = (𝑛C𝑘))
55	54	adantr 480	. . . . . . 7 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...((𝑛 + 1) − 1))) → (((𝑛 + 1) − 1)C𝑘) = (𝑛C𝑘))
56	53, 55	prodeq12dv 15959	. . . . . 6 ⊢ (𝑛 ∈ ℕ → ∏𝑘 ∈ (1...((𝑛 + 1) − 1))(((𝑛 + 1) − 1)C𝑘) = ∏𝑘 ∈ (1...𝑛)(𝑛C𝑘))
57		elnnuz 12920	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ ↔ 𝑛 ∈ (ℤ_≥‘1))
58	57	biimpi 216	. . . . . . 7 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ (ℤ_≥‘1))
59		nnnn0 12531	. . . . . . . . 9 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℕ₀)
60		elfzelz 13561	. . . . . . . . 9 ⊢ (𝑘 ∈ (1...𝑛) → 𝑘 ∈ ℤ)
61		bccl 14358	. . . . . . . . 9 ⊢ ((𝑛 ∈ ℕ₀ ∧ 𝑘 ∈ ℤ) → (𝑛C𝑘) ∈ ℕ₀)
62	59, 60, 61	syl2an 596	. . . . . . . 8 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...𝑛)) → (𝑛C𝑘) ∈ ℕ₀)
63	62	nn0cnd 12587	. . . . . . 7 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...𝑛)) → (𝑛C𝑘) ∈ ℂ)
64		oveq2 7439	. . . . . . 7 ⊢ (𝑘 = 𝑛 → (𝑛C𝑘) = (𝑛C𝑛))
65	58, 63, 64	fprodm1 16000	. . . . . 6 ⊢ (𝑛 ∈ ℕ → ∏𝑘 ∈ (1...𝑛)(𝑛C𝑘) = (∏𝑘 ∈ (1...(𝑛 − 1))(𝑛C𝑘) · (𝑛C𝑛)))
66		bcnn 14348	. . . . . . . . 9 ⊢ (𝑛 ∈ ℕ₀ → (𝑛C𝑛) = 1)
67	59, 66	syl 17	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ → (𝑛C𝑛) = 1)
68	67	oveq2d 7447	. . . . . . 7 ⊢ (𝑛 ∈ ℕ → (∏𝑘 ∈ (1...(𝑛 − 1))(𝑛C𝑘) · (𝑛C𝑛)) = (∏𝑘 ∈ (1...(𝑛 − 1))(𝑛C𝑘) · 1))
69		fzfid 14011	. . . . . . . . 9 ⊢ (𝑛 ∈ ℕ → (1...(𝑛 − 1)) ∈ Fin)
70		elfzelz 13561	. . . . . . . . . . 11 ⊢ (𝑘 ∈ (1...(𝑛 − 1)) → 𝑘 ∈ ℤ)
71	59, 70, 61	syl2an 596	. . . . . . . . . 10 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → (𝑛C𝑘) ∈ ℕ₀)
72	71	nn0cnd 12587	. . . . . . . . 9 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → (𝑛C𝑘) ∈ ℂ)
73	69, 72	fprodcl 15985	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ → ∏𝑘 ∈ (1...(𝑛 − 1))(𝑛C𝑘) ∈ ℂ)
74	73	mulridd 11276	. . . . . . 7 ⊢ (𝑛 ∈ ℕ → (∏𝑘 ∈ (1...(𝑛 − 1))(𝑛C𝑘) · 1) = ∏𝑘 ∈ (1...(𝑛 − 1))(𝑛C𝑘))
75		fz1ssfz0 13660	. . . . . . . . . . 11 ⊢ (1...(𝑛 − 1)) ⊆ (0...(𝑛 − 1))
76	75	sseli 3991	. . . . . . . . . 10 ⊢ (𝑘 ∈ (1...(𝑛 − 1)) → 𝑘 ∈ (0...(𝑛 − 1)))
77		bcm1nt 35717	. . . . . . . . . 10 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (0...(𝑛 − 1))) → (𝑛C𝑘) = (((𝑛 − 1)C𝑘) · (𝑛 / (𝑛 − 𝑘))))
78	76, 77	sylan2 593	. . . . . . . . 9 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → (𝑛C𝑘) = (((𝑛 − 1)C𝑘) · (𝑛 / (𝑛 − 𝑘))))
79	78	prodeq2dv 15955	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ → ∏𝑘 ∈ (1...(𝑛 − 1))(𝑛C𝑘) = ∏𝑘 ∈ (1...(𝑛 − 1))(((𝑛 − 1)C𝑘) · (𝑛 / (𝑛 − 𝑘))))
80		nnm1nn0 12565	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ℕ → (𝑛 − 1) ∈ ℕ₀)
81		bccl 14358	. . . . . . . . . . 11 ⊢ (((𝑛 − 1) ∈ ℕ₀ ∧ 𝑘 ∈ ℤ) → ((𝑛 − 1)C𝑘) ∈ ℕ₀)
82	80, 70, 81	syl2an 596	. . . . . . . . . 10 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → ((𝑛 − 1)C𝑘) ∈ ℕ₀)
83	82	nn0cnd 12587	. . . . . . . . 9 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → ((𝑛 − 1)C𝑘) ∈ ℂ)
84	50	adantr 480	. . . . . . . . . 10 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → 𝑛 ∈ ℂ)
85		elfznn 13590	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ (1...(𝑛 − 1)) → 𝑘 ∈ ℕ)
86	85	adantl 481	. . . . . . . . . . . . . 14 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → 𝑘 ∈ ℕ)
87	86	nnred 12279	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → 𝑘 ∈ ℝ)
88	80	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → (𝑛 − 1) ∈ ℕ₀)
89	88	nn0red 12586	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → (𝑛 − 1) ∈ ℝ)
90		nnre 12271	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℝ)
91	90	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → 𝑛 ∈ ℝ)
92		elfzle2 13565	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ (1...(𝑛 − 1)) → 𝑘 ≤ (𝑛 − 1))
93	92	adantl 481	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → 𝑘 ≤ (𝑛 − 1))
94	91	ltm1d 12198	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → (𝑛 − 1) < 𝑛)
95	87, 89, 91, 93, 94	lelttrd 11417	. . . . . . . . . . . 12 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → 𝑘 < 𝑛)
96		simpl 482	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → 𝑛 ∈ ℕ)
97		nnsub 12308	. . . . . . . . . . . . 13 ⊢ ((𝑘 ∈ ℕ ∧ 𝑛 ∈ ℕ) → (𝑘 < 𝑛 ↔ (𝑛 − 𝑘) ∈ ℕ))
98	86, 96, 97	syl2anc 584	. . . . . . . . . . . 12 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → (𝑘 < 𝑛 ↔ (𝑛 − 𝑘) ∈ ℕ))
99	95, 98	mpbid 232	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → (𝑛 − 𝑘) ∈ ℕ)
100	99	nncnd 12280	. . . . . . . . . 10 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → (𝑛 − 𝑘) ∈ ℂ)
101	99	nnne0d 12314	. . . . . . . . . 10 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → (𝑛 − 𝑘) ≠ 0)
102	84, 100, 101	divcld 12041	. . . . . . . . 9 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → (𝑛 / (𝑛 − 𝑘)) ∈ ℂ)
103	69, 83, 102	fprodmul 15993	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ → ∏𝑘 ∈ (1...(𝑛 − 1))(((𝑛 − 1)C𝑘) · (𝑛 / (𝑛 − 𝑘))) = (∏𝑘 ∈ (1...(𝑛 − 1))((𝑛 − 1)C𝑘) · ∏𝑘 ∈ (1...(𝑛 − 1))(𝑛 / (𝑛 − 𝑘))))
104	69, 84, 100, 101	fproddiv 15994	. . . . . . . . . 10 ⊢ (𝑛 ∈ ℕ → ∏𝑘 ∈ (1...(𝑛 − 1))(𝑛 / (𝑛 − 𝑘)) = (∏𝑘 ∈ (1...(𝑛 − 1))𝑛 / ∏𝑘 ∈ (1...(𝑛 − 1))(𝑛 − 𝑘)))
105		fzfi 14010	. . . . . . . . . . . . 13 ⊢ (1...(𝑛 − 1)) ∈ Fin
106		fprodconst 16011	. . . . . . . . . . . . 13 ⊢ (((1...(𝑛 − 1)) ∈ Fin ∧ 𝑛 ∈ ℂ) → ∏𝑘 ∈ (1...(𝑛 − 1))𝑛 = (𝑛↑(♯‘(1...(𝑛 − 1)))))
107	105, 50, 106	sylancr 587	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ ℕ → ∏𝑘 ∈ (1...(𝑛 − 1))𝑛 = (𝑛↑(♯‘(1...(𝑛 − 1)))))
108		hashfz1 14382	. . . . . . . . . . . . . 14 ⊢ ((𝑛 − 1) ∈ ℕ₀ → (♯‘(1...(𝑛 − 1))) = (𝑛 − 1))
109	80, 108	syl 17	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℕ → (♯‘(1...(𝑛 − 1))) = (𝑛 − 1))
110	109	oveq2d 7447	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ ℕ → (𝑛↑(♯‘(1...(𝑛 − 1)))) = (𝑛↑(𝑛 − 1)))
111	107, 110	eqtr2d 2776	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ℕ → (𝑛↑(𝑛 − 1)) = ∏𝑘 ∈ (1...(𝑛 − 1))𝑛)
112		fprodfac 16006	. . . . . . . . . . . . 13 ⊢ ((𝑛 − 1) ∈ ℕ₀ → (!‘(𝑛 − 1)) = ∏𝑗 ∈ (1...(𝑛 − 1))𝑗)
113	80, 112	syl 17	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ ℕ → (!‘(𝑛 − 1)) = ∏𝑗 ∈ (1...(𝑛 − 1))𝑗)
114		nnz 12632	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℤ)
115		1zzd 12646	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℕ → 1 ∈ ℤ)
116	80	nn0zd 12637	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℕ → (𝑛 − 1) ∈ ℤ)
117		elfznn 13590	. . . . . . . . . . . . . . 15 ⊢ (𝑗 ∈ (1...(𝑛 − 1)) → 𝑗 ∈ ℕ)
118	117	adantl 481	. . . . . . . . . . . . . 14 ⊢ ((𝑛 ∈ ℕ ∧ 𝑗 ∈ (1...(𝑛 − 1))) → 𝑗 ∈ ℕ)
119	118	nncnd 12280	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ ℕ ∧ 𝑗 ∈ (1...(𝑛 − 1))) → 𝑗 ∈ ℂ)
120		id 22	. . . . . . . . . . . . 13 ⊢ (𝑗 = (𝑛 − 𝑘) → 𝑗 = (𝑛 − 𝑘))
121	114, 115, 116, 119, 120	fprodrev 16010	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ ℕ → ∏𝑗 ∈ (1...(𝑛 − 1))𝑗 = ∏𝑘 ∈ ((𝑛 − (𝑛 − 1))...(𝑛 − 1))(𝑛 − 𝑘))
122	50, 51	nncand 11623	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ ℕ → (𝑛 − (𝑛 − 1)) = 1)
123	122	oveq1d 7446	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℕ → ((𝑛 − (𝑛 − 1))...(𝑛 − 1)) = (1...(𝑛 − 1)))
124	123	prodeq1d 15953	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ ℕ → ∏𝑘 ∈ ((𝑛 − (𝑛 − 1))...(𝑛 − 1))(𝑛 − 𝑘) = ∏𝑘 ∈ (1...(𝑛 − 1))(𝑛 − 𝑘))
125	113, 121, 124	3eqtrd 2779	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ℕ → (!‘(𝑛 − 1)) = ∏𝑘 ∈ (1...(𝑛 − 1))(𝑛 − 𝑘))
126	111, 125	oveq12d 7449	. . . . . . . . . 10 ⊢ (𝑛 ∈ ℕ → ((𝑛↑(𝑛 − 1)) / (!‘(𝑛 − 1))) = (∏𝑘 ∈ (1...(𝑛 − 1))𝑛 / ∏𝑘 ∈ (1...(𝑛 − 1))(𝑛 − 𝑘)))
127	104, 126	eqtr4d 2778	. . . . . . . . 9 ⊢ (𝑛 ∈ ℕ → ∏𝑘 ∈ (1...(𝑛 − 1))(𝑛 / (𝑛 − 𝑘)) = ((𝑛↑(𝑛 − 1)) / (!‘(𝑛 − 1))))
128	127	oveq2d 7447	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ → (∏𝑘 ∈ (1...(𝑛 − 1))((𝑛 − 1)C𝑘) · ∏𝑘 ∈ (1...(𝑛 − 1))(𝑛 / (𝑛 − 𝑘))) = (∏𝑘 ∈ (1...(𝑛 − 1))((𝑛 − 1)C𝑘) · ((𝑛↑(𝑛 − 1)) / (!‘(𝑛 − 1)))))
129	79, 103, 128	3eqtrd 2779	. . . . . . 7 ⊢ (𝑛 ∈ ℕ → ∏𝑘 ∈ (1...(𝑛 − 1))(𝑛C𝑘) = (∏𝑘 ∈ (1...(𝑛 − 1))((𝑛 − 1)C𝑘) · ((𝑛↑(𝑛 − 1)) / (!‘(𝑛 − 1)))))
130	68, 74, 129	3eqtrd 2779	. . . . . 6 ⊢ (𝑛 ∈ ℕ → (∏𝑘 ∈ (1...(𝑛 − 1))(𝑛C𝑘) · (𝑛C𝑛)) = (∏𝑘 ∈ (1...(𝑛 − 1))((𝑛 − 1)C𝑘) · ((𝑛↑(𝑛 − 1)) / (!‘(𝑛 − 1)))))
131	56, 65, 130	3eqtrd 2779	. . . . 5 ⊢ (𝑛 ∈ ℕ → ∏𝑘 ∈ (1...((𝑛 + 1) − 1))(((𝑛 + 1) − 1)C𝑘) = (∏𝑘 ∈ (1...(𝑛 − 1))((𝑛 − 1)C𝑘) · ((𝑛↑(𝑛 − 1)) / (!‘(𝑛 − 1)))))
132	131	adantr 480	. . . 4 ⊢ ((𝑛 ∈ ℕ ∧ ∏𝑘 ∈ (1...(𝑛 − 1))((𝑛 − 1)C𝑘) = ∏𝑘 ∈ (1...(𝑛 − 1))(𝑘↑((2 · 𝑘) − 𝑛))) → ∏𝑘 ∈ (1...((𝑛 + 1) − 1))(((𝑛 + 1) − 1)C𝑘) = (∏𝑘 ∈ (1...(𝑛 − 1))((𝑛 − 1)C𝑘) · ((𝑛↑(𝑛 − 1)) / (!‘(𝑛 − 1)))))
133	53	prodeq1d 15953	. . . . . 6 ⊢ (𝑛 ∈ ℕ → ∏𝑘 ∈ (1...((𝑛 + 1) − 1))(𝑘↑((2 · 𝑘) − (𝑛 + 1))) = ∏𝑘 ∈ (1...𝑛)(𝑘↑((2 · 𝑘) − (𝑛 + 1))))
134		elfznn 13590	. . . . . . . . . 10 ⊢ (𝑘 ∈ (1...𝑛) → 𝑘 ∈ ℕ)
135	134	adantl 481	. . . . . . . . 9 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...𝑛)) → 𝑘 ∈ ℕ)
136	135	nncnd 12280	. . . . . . . 8 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...𝑛)) → 𝑘 ∈ ℂ)
137	135	nnne0d 12314	. . . . . . . 8 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...𝑛)) → 𝑘 ≠ 0)
138		2nn 12337	. . . . . . . . . . . 12 ⊢ 2 ∈ ℕ
139	138	a1i 11	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...𝑛)) → 2 ∈ ℕ)
140	139, 135	nnmulcld 12317	. . . . . . . . . 10 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...𝑛)) → (2 · 𝑘) ∈ ℕ)
141	140	nnzd 12638	. . . . . . . . 9 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...𝑛)) → (2 · 𝑘) ∈ ℤ)
142		peano2nn 12276	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ℕ → (𝑛 + 1) ∈ ℕ)
143	142	adantr 480	. . . . . . . . . 10 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...𝑛)) → (𝑛 + 1) ∈ ℕ)
144	143	nnzd 12638	. . . . . . . . 9 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...𝑛)) → (𝑛 + 1) ∈ ℤ)
145	141, 144	zsubcld 12725	. . . . . . . 8 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...𝑛)) → ((2 · 𝑘) − (𝑛 + 1)) ∈ ℤ)
146	136, 137, 145	expclzd 14188	. . . . . . 7 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...𝑛)) → (𝑘↑((2 · 𝑘) − (𝑛 + 1))) ∈ ℂ)
147		id 22	. . . . . . . 8 ⊢ (𝑘 = 𝑛 → 𝑘 = 𝑛)
148		oveq2 7439	. . . . . . . . 9 ⊢ (𝑘 = 𝑛 → (2 · 𝑘) = (2 · 𝑛))
149	148	oveq1d 7446	. . . . . . . 8 ⊢ (𝑘 = 𝑛 → ((2 · 𝑘) − (𝑛 + 1)) = ((2 · 𝑛) − (𝑛 + 1)))
150	147, 149	oveq12d 7449	. . . . . . 7 ⊢ (𝑘 = 𝑛 → (𝑘↑((2 · 𝑘) − (𝑛 + 1))) = (𝑛↑((2 · 𝑛) − (𝑛 + 1))))
151	58, 146, 150	fprodm1 16000	. . . . . 6 ⊢ (𝑛 ∈ ℕ → ∏𝑘 ∈ (1...𝑛)(𝑘↑((2 · 𝑘) − (𝑛 + 1))) = (∏𝑘 ∈ (1...(𝑛 − 1))(𝑘↑((2 · 𝑘) − (𝑛 + 1))) · (𝑛↑((2 · 𝑛) − (𝑛 + 1)))))
152	86	nncnd 12280	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → 𝑘 ∈ ℂ)
153	86	nnne0d 12314	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → 𝑘 ≠ 0)
154	138	a1i 11	. . . . . . . . . . . . . 14 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → 2 ∈ ℕ)
155	154, 86	nnmulcld 12317	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → (2 · 𝑘) ∈ ℕ)
156	155	nnzd 12638	. . . . . . . . . . . 12 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → (2 · 𝑘) ∈ ℤ)
157	114	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → 𝑛 ∈ ℤ)
158	156, 157	zsubcld 12725	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → ((2 · 𝑘) − 𝑛) ∈ ℤ)
159	152, 153, 158	expclzd 14188	. . . . . . . . . 10 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → (𝑘↑((2 · 𝑘) − 𝑛)) ∈ ℂ)
160	69, 159, 152, 153	fproddiv 15994	. . . . . . . . 9 ⊢ (𝑛 ∈ ℕ → ∏𝑘 ∈ (1...(𝑛 − 1))((𝑘↑((2 · 𝑘) − 𝑛)) / 𝑘) = (∏𝑘 ∈ (1...(𝑛 − 1))(𝑘↑((2 · 𝑘) − 𝑛)) / ∏𝑘 ∈ (1...(𝑛 − 1))𝑘))
161	155	nncnd 12280	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → (2 · 𝑘) ∈ ℂ)
162		1cnd 11254	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → 1 ∈ ℂ)
163	161, 84, 162	subsub4d 11649	. . . . . . . . . . . 12 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → (((2 · 𝑘) − 𝑛) − 1) = ((2 · 𝑘) − (𝑛 + 1)))
164	163	oveq2d 7447	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → (𝑘↑(((2 · 𝑘) − 𝑛) − 1)) = (𝑘↑((2 · 𝑘) − (𝑛 + 1))))
165	152, 153, 158	expm1d 14193	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → (𝑘↑(((2 · 𝑘) − 𝑛) − 1)) = ((𝑘↑((2 · 𝑘) − 𝑛)) / 𝑘))
166	164, 165	eqtr3d 2777	. . . . . . . . . 10 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑛 − 1))) → (𝑘↑((2 · 𝑘) − (𝑛 + 1))) = ((𝑘↑((2 · 𝑘) − 𝑛)) / 𝑘))
167	166	prodeq2dv 15955	. . . . . . . . 9 ⊢ (𝑛 ∈ ℕ → ∏𝑘 ∈ (1...(𝑛 − 1))(𝑘↑((2 · 𝑘) − (𝑛 + 1))) = ∏𝑘 ∈ (1...(𝑛 − 1))((𝑘↑((2 · 𝑘) − 𝑛)) / 𝑘))
168		fprodfac 16006	. . . . . . . . . . 11 ⊢ ((𝑛 − 1) ∈ ℕ₀ → (!‘(𝑛 − 1)) = ∏𝑘 ∈ (1...(𝑛 − 1))𝑘)
169	80, 168	syl 17	. . . . . . . . . 10 ⊢ (𝑛 ∈ ℕ → (!‘(𝑛 − 1)) = ∏𝑘 ∈ (1...(𝑛 − 1))𝑘)
170	169	oveq2d 7447	. . . . . . . . 9 ⊢ (𝑛 ∈ ℕ → (∏𝑘 ∈ (1...(𝑛 − 1))(𝑘↑((2 · 𝑘) − 𝑛)) / (!‘(𝑛 − 1))) = (∏𝑘 ∈ (1...(𝑛 − 1))(𝑘↑((2 · 𝑘) − 𝑛)) / ∏𝑘 ∈ (1...(𝑛 − 1))𝑘))
171	160, 167, 170	3eqtr4d 2785	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ → ∏𝑘 ∈ (1...(𝑛 − 1))(𝑘↑((2 · 𝑘) − (𝑛 + 1))) = (∏𝑘 ∈ (1...(𝑛 − 1))(𝑘↑((2 · 𝑘) − 𝑛)) / (!‘(𝑛 − 1))))
172	138	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℕ → 2 ∈ ℕ)
173		id 22	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℕ)
174	172, 173	nnmulcld 12317	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ ℕ → (2 · 𝑛) ∈ ℕ)
175	174	nncnd 12280	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ℕ → (2 · 𝑛) ∈ ℂ)
176	175, 50, 51	subsub4d 11649	. . . . . . . . . 10 ⊢ (𝑛 ∈ ℕ → (((2 · 𝑛) − 𝑛) − 1) = ((2 · 𝑛) − (𝑛 + 1)))
177	50	2timesd 12507	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ ℕ → (2 · 𝑛) = (𝑛 + 𝑛))
178	50, 50, 177	mvrladdd 11674	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ℕ → ((2 · 𝑛) − 𝑛) = 𝑛)
179	178	oveq1d 7446	. . . . . . . . . 10 ⊢ (𝑛 ∈ ℕ → (((2 · 𝑛) − 𝑛) − 1) = (𝑛 − 1))
180	176, 179	eqtr3d 2777	. . . . . . . . 9 ⊢ (𝑛 ∈ ℕ → ((2 · 𝑛) − (𝑛 + 1)) = (𝑛 − 1))
181	180	oveq2d 7447	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ → (𝑛↑((2 · 𝑛) − (𝑛 + 1))) = (𝑛↑(𝑛 − 1)))
182	171, 181	oveq12d 7449	. . . . . . 7 ⊢ (𝑛 ∈ ℕ → (∏𝑘 ∈ (1...(𝑛 − 1))(𝑘↑((2 · 𝑘) − (𝑛 + 1))) · (𝑛↑((2 · 𝑛) − (𝑛 + 1)))) = ((∏𝑘 ∈ (1...(𝑛 − 1))(𝑘↑((2 · 𝑘) − 𝑛)) / (!‘(𝑛 − 1))) · (𝑛↑(𝑛 − 1))))
183	69, 159	fprodcl 15985	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ → ∏𝑘 ∈ (1...(𝑛 − 1))(𝑘↑((2 · 𝑘) − 𝑛)) ∈ ℂ)
184		faccl 14319	. . . . . . . . . 10 ⊢ ((𝑛 − 1) ∈ ℕ₀ → (!‘(𝑛 − 1)) ∈ ℕ)
185	80, 184	syl 17	. . . . . . . . 9 ⊢ (𝑛 ∈ ℕ → (!‘(𝑛 − 1)) ∈ ℕ)
186	185	nncnd 12280	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ → (!‘(𝑛 − 1)) ∈ ℂ)
187	50, 80	expcld 14183	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ → (𝑛↑(𝑛 − 1)) ∈ ℂ)
188	185	nnne0d 12314	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ → (!‘(𝑛 − 1)) ≠ 0)
189	183, 186, 187, 188	div32d 12064	. . . . . . 7 ⊢ (𝑛 ∈ ℕ → ((∏𝑘 ∈ (1...(𝑛 − 1))(𝑘↑((2 · 𝑘) − 𝑛)) / (!‘(𝑛 − 1))) · (𝑛↑(𝑛 − 1))) = (∏𝑘 ∈ (1...(𝑛 − 1))(𝑘↑((2 · 𝑘) − 𝑛)) · ((𝑛↑(𝑛 − 1)) / (!‘(𝑛 − 1)))))
190	182, 189	eqtrd 2775	. . . . . 6 ⊢ (𝑛 ∈ ℕ → (∏𝑘 ∈ (1...(𝑛 − 1))(𝑘↑((2 · 𝑘) − (𝑛 + 1))) · (𝑛↑((2 · 𝑛) − (𝑛 + 1)))) = (∏𝑘 ∈ (1...(𝑛 − 1))(𝑘↑((2 · 𝑘) − 𝑛)) · ((𝑛↑(𝑛 − 1)) / (!‘(𝑛 − 1)))))
191	133, 151, 190	3eqtrd 2779	. . . . 5 ⊢ (𝑛 ∈ ℕ → ∏𝑘 ∈ (1...((𝑛 + 1) − 1))(𝑘↑((2 · 𝑘) − (𝑛 + 1))) = (∏𝑘 ∈ (1...(𝑛 − 1))(𝑘↑((2 · 𝑘) − 𝑛)) · ((𝑛↑(𝑛 − 1)) / (!‘(𝑛 − 1)))))
192	191	adantr 480	. . . 4 ⊢ ((𝑛 ∈ ℕ ∧ ∏𝑘 ∈ (1...(𝑛 − 1))((𝑛 − 1)C𝑘) = ∏𝑘 ∈ (1...(𝑛 − 1))(𝑘↑((2 · 𝑘) − 𝑛))) → ∏𝑘 ∈ (1...((𝑛 + 1) − 1))(𝑘↑((2 · 𝑘) − (𝑛 + 1))) = (∏𝑘 ∈ (1...(𝑛 − 1))(𝑘↑((2 · 𝑘) − 𝑛)) · ((𝑛↑(𝑛 − 1)) / (!‘(𝑛 − 1)))))
193	49, 132, 192	3eqtr4d 2785	. . 3 ⊢ ((𝑛 ∈ ℕ ∧ ∏𝑘 ∈ (1...(𝑛 − 1))((𝑛 − 1)C𝑘) = ∏𝑘 ∈ (1...(𝑛 − 1))(𝑘↑((2 · 𝑘) − 𝑛))) → ∏𝑘 ∈ (1...((𝑛 + 1) − 1))(((𝑛 + 1) − 1)C𝑘) = ∏𝑘 ∈ (1...((𝑛 + 1) − 1))(𝑘↑((2 · 𝑘) − (𝑛 + 1))))
194	193	ex 412	. 2 ⊢ (𝑛 ∈ ℕ → (∏𝑘 ∈ (1...(𝑛 − 1))((𝑛 − 1)C𝑘) = ∏𝑘 ∈ (1...(𝑛 − 1))(𝑘↑((2 · 𝑘) − 𝑛)) → ∏𝑘 ∈ (1...((𝑛 + 1) − 1))(((𝑛 + 1) − 1)C𝑘) = ∏𝑘 ∈ (1...((𝑛 + 1) − 1))(𝑘↑((2 · 𝑘) − (𝑛 + 1)))))
195	14, 24, 34, 44, 47, 194	nnind 12282	1 ⊢ (𝑁 ∈ ℕ → ∏𝑘 ∈ (1...(𝑁 − 1))((𝑁 − 1)C𝑘) = ∏𝑘 ∈ (1...(𝑁 − 1))(𝑘↑((2 · 𝑘) − 𝑁)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1537 ∈ wcel 2106 ∅c0 4339 class class class wbr 5148 ‘cfv 6563 (class class class)co 7431 Fincfn 8984 ℂcc 11151 ℝcr 11152 0cc0 11153 1c1 11154 + caddc 11156 · cmul 11158 < clt 11293 ≤ cle 11294 − cmin 11490 / cdiv 11918 ℕcn 12264 2c2 12319 ℕ₀cn0 12524 ℤcz 12611 ℤ_≥cuz 12876 ...cfz 13544 ↑cexp 14099 !cfa 14309 Ccbc 14338 ♯chash 14366 ∏cprod 15936

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-inf2 9679 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230 ax-pre-sup 11231

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3378 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-int 4952 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-se 5642 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-isom 6572 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8013 df-2nd 8014 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-1o 8505 df-er 8744 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 df-sup 9480 df-oi 9548 df-card 9977 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-div 11919 df-nn 12265 df-2 12327 df-3 12328 df-n0 12525 df-z 12612 df-uz 12877 df-rp 13033 df-fz 13545 df-fzo 13692 df-seq 14040 df-exp 14100 df-fac 14310 df-bc 14339 df-hash 14367 df-cj 15135 df-re 15136 df-im 15137 df-sqrt 15271 df-abs 15272 df-clim 15521 df-prod 15937

This theorem is referenced by: (None)

W3C validator