fmtnorec2lem - Mathbox for Alexander van der Vekens

	Mathbox for Alexander van der Vekens		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > fmtnorec2lem		Structured version Visualization version GIF version

Theorem fmtnorec2lem 48005

Description: Lemma for fmtnorec2 48006 (induction step). (Contributed by AV, 29-Jul-2021.)

**Assertion**
Ref	Expression
fmtnorec2lem	⊢ (𝑦 ∈ ℕ₀ → ((FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) → (FermatNo‘((𝑦 + 1) + 1)) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + 2)))

Distinct variable group: 𝑦,𝑛

**Proof of Theorem fmtnorec2lem**
Step	Hyp	Ref	Expression
1		peano2nn0 12477	. . . . . 6 ⊢ (𝑦 ∈ ℕ₀ → (𝑦 + 1) ∈ ℕ₀)
2		peano2nn0 12477	. . . . . 6 ⊢ ((𝑦 + 1) ∈ ℕ₀ → ((𝑦 + 1) + 1) ∈ ℕ₀)
3		fmtno 47992	. . . . . 6 ⊢ (((𝑦 + 1) + 1) ∈ ℕ₀ → (FermatNo‘((𝑦 + 1) + 1)) = ((2↑(2↑((𝑦 + 1) + 1))) + 1))
4	1, 2, 3	3syl 18	. . . . 5 ⊢ (𝑦 ∈ ℕ₀ → (FermatNo‘((𝑦 + 1) + 1)) = ((2↑(2↑((𝑦 + 1) + 1))) + 1))
5		2cnd 12259	. . . . . . . . 9 ⊢ (𝑦 ∈ ℕ₀ → 2 ∈ ℂ)
6	5, 1	expp1d 14109	. . . . . . . 8 ⊢ (𝑦 ∈ ℕ₀ → (2↑((𝑦 + 1) + 1)) = ((2↑(𝑦 + 1)) · 2))
7	6	oveq2d 7383	. . . . . . 7 ⊢ (𝑦 ∈ ℕ₀ → (2↑(2↑((𝑦 + 1) + 1))) = (2↑((2↑(𝑦 + 1)) · 2)))
8		2nn0 12454	. . . . . . . . . . . 12 ⊢ 2 ∈ ℕ₀
9	8	a1i 11	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ℕ₀ → 2 ∈ ℕ₀)
10	9, 1	nn0expcld 14208	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ℕ₀ → (2↑(𝑦 + 1)) ∈ ℕ₀)
11	9, 10	nn0expcld 14208	. . . . . . . . . 10 ⊢ (𝑦 ∈ ℕ₀ → (2↑(2↑(𝑦 + 1))) ∈ ℕ₀)
12	11	nn0cnd 12500	. . . . . . . . 9 ⊢ (𝑦 ∈ ℕ₀ → (2↑(2↑(𝑦 + 1))) ∈ ℂ)
13	12	sqvald 14105	. . . . . . . 8 ⊢ (𝑦 ∈ ℕ₀ → ((2↑(2↑(𝑦 + 1)))↑2) = ((2↑(2↑(𝑦 + 1))) · (2↑(2↑(𝑦 + 1)))))
14	5, 9, 10	expmuld 14111	. . . . . . . 8 ⊢ (𝑦 ∈ ℕ₀ → (2↑((2↑(𝑦 + 1)) · 2)) = ((2↑(2↑(𝑦 + 1)))↑2))
15		fmtnom1nn 47995	. . . . . . . . . 10 ⊢ ((𝑦 + 1) ∈ ℕ₀ → ((FermatNo‘(𝑦 + 1)) − 1) = (2↑(2↑(𝑦 + 1))))
16	1, 15	syl 17	. . . . . . . . 9 ⊢ (𝑦 ∈ ℕ₀ → ((FermatNo‘(𝑦 + 1)) − 1) = (2↑(2↑(𝑦 + 1))))
17	16, 16	oveq12d 7385	. . . . . . . 8 ⊢ (𝑦 ∈ ℕ₀ → (((FermatNo‘(𝑦 + 1)) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)) = ((2↑(2↑(𝑦 + 1))) · (2↑(2↑(𝑦 + 1)))))
18	13, 14, 17	3eqtr4d 2781	. . . . . . 7 ⊢ (𝑦 ∈ ℕ₀ → (2↑((2↑(𝑦 + 1)) · 2)) = (((FermatNo‘(𝑦 + 1)) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)))
19	7, 18	eqtrd 2771	. . . . . 6 ⊢ (𝑦 ∈ ℕ₀ → (2↑(2↑((𝑦 + 1) + 1))) = (((FermatNo‘(𝑦 + 1)) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)))
20	19	oveq1d 7382	. . . . 5 ⊢ (𝑦 ∈ ℕ₀ → ((2↑(2↑((𝑦 + 1) + 1))) + 1) = ((((FermatNo‘(𝑦 + 1)) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)) + 1))
21	4, 20	eqtrd 2771	. . . 4 ⊢ (𝑦 ∈ ℕ₀ → (FermatNo‘((𝑦 + 1) + 1)) = ((((FermatNo‘(𝑦 + 1)) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)) + 1))
22	21	adantr 480	. . 3 ⊢ ((𝑦 ∈ ℕ₀ ∧ (FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2)) → (FermatNo‘((𝑦 + 1) + 1)) = ((((FermatNo‘(𝑦 + 1)) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)) + 1))
23		oveq1 7374	. . . . . 6 ⊢ ((FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) → ((FermatNo‘(𝑦 + 1)) − 1) = ((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) − 1))
24	23	oveq1d 7382	. . . . 5 ⊢ ((FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) → (((FermatNo‘(𝑦 + 1)) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)) = (((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)))
25	24	oveq1d 7382	. . . 4 ⊢ ((FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) → ((((FermatNo‘(𝑦 + 1)) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)) + 1) = ((((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)) + 1))
26	25	adantl 481	. . 3 ⊢ ((𝑦 ∈ ℕ₀ ∧ (FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2)) → ((((FermatNo‘(𝑦 + 1)) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)) + 1) = ((((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)) + 1))
27		fzfid 13935	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ℕ₀ → (0...𝑦) ∈ Fin)
28		elfznn0 13574	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ (0...𝑦) → 𝑛 ∈ ℕ₀)
29		fmtnonn 47994	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ ℕ₀ → (FermatNo‘𝑛) ∈ ℕ)
30	29	nncnd 12190	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℕ₀ → (FermatNo‘𝑛) ∈ ℂ)
31	28, 30	syl 17	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ (0...𝑦) → (FermatNo‘𝑛) ∈ ℂ)
32	31	adantl 481	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ ℕ₀ ∧ 𝑛 ∈ (0...𝑦)) → (FermatNo‘𝑛) ∈ ℂ)
33	27, 32	fprodcl 15917	. . . . . . . . . 10 ⊢ (𝑦 ∈ ℕ₀ → ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) ∈ ℂ)
34		1cnd 11139	. . . . . . . . . 10 ⊢ (𝑦 ∈ ℕ₀ → 1 ∈ ℂ)
35	33, 5, 34	addsubassd 11525	. . . . . . . . 9 ⊢ (𝑦 ∈ ℕ₀ → ((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) − 1) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + (2 − 1)))
36		2m1e1 12302	. . . . . . . . . 10 ⊢ (2 − 1) = 1
37	36	oveq2i 7378	. . . . . . . . 9 ⊢ (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + (2 − 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 1)
38	35, 37	eqtrdi 2787	. . . . . . . 8 ⊢ (𝑦 ∈ ℕ₀ → ((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) − 1) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 1))
39	38	oveq1d 7382	. . . . . . 7 ⊢ (𝑦 ∈ ℕ₀ → (((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)) = ((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 1) · ((FermatNo‘(𝑦 + 1)) − 1)))
40		fmtnonn 47994	. . . . . . . . . . 11 ⊢ ((𝑦 + 1) ∈ ℕ₀ → (FermatNo‘(𝑦 + 1)) ∈ ℕ)
41	1, 40	syl 17	. . . . . . . . . 10 ⊢ (𝑦 ∈ ℕ₀ → (FermatNo‘(𝑦 + 1)) ∈ ℕ)
42	41	nncnd 12190	. . . . . . . . 9 ⊢ (𝑦 ∈ ℕ₀ → (FermatNo‘(𝑦 + 1)) ∈ ℂ)
43	42, 34	subcld 11505	. . . . . . . 8 ⊢ (𝑦 ∈ ℕ₀ → ((FermatNo‘(𝑦 + 1)) − 1) ∈ ℂ)
44	33, 42	muls1d 11610	. . . . . . . . 9 ⊢ (𝑦 ∈ ℕ₀ → (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · ((FermatNo‘(𝑦 + 1)) − 1)) = ((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛)))
45	43	mullidd 11163	. . . . . . . . 9 ⊢ (𝑦 ∈ ℕ₀ → (1 · ((FermatNo‘(𝑦 + 1)) − 1)) = ((FermatNo‘(𝑦 + 1)) − 1))
46	44, 45	oveq12d 7385	. . . . . . . 8 ⊢ (𝑦 ∈ ℕ₀ → ((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · ((FermatNo‘(𝑦 + 1)) − 1)) + (1 · ((FermatNo‘(𝑦 + 1)) − 1))) = (((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛)) + ((FermatNo‘(𝑦 + 1)) − 1)))
47	33, 43, 34, 46	joinlmuladdmuld 11172	. . . . . . 7 ⊢ (𝑦 ∈ ℕ₀ → ((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 1) · ((FermatNo‘(𝑦 + 1)) − 1)) = (((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛)) + ((FermatNo‘(𝑦 + 1)) − 1)))
48	39, 47	eqtrd 2771	. . . . . 6 ⊢ (𝑦 ∈ ℕ₀ → (((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)) = (((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛)) + ((FermatNo‘(𝑦 + 1)) − 1)))
49	48	adantr 480	. . . . 5 ⊢ ((𝑦 ∈ ℕ₀ ∧ (FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2)) → (((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)) = (((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛)) + ((FermatNo‘(𝑦 + 1)) − 1)))
50	49	oveq1d 7382	. . . 4 ⊢ ((𝑦 ∈ ℕ₀ ∧ (FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2)) → ((((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)) + 1) = ((((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛)) + ((FermatNo‘(𝑦 + 1)) − 1)) + 1))
51		eqcom 2743	. . . . . . 7 ⊢ ((FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) ↔ (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) = (FermatNo‘(𝑦 + 1)))
52	42, 5, 33	subadd2d 11524	. . . . . . 7 ⊢ (𝑦 ∈ ℕ₀ → (((FermatNo‘(𝑦 + 1)) − 2) = ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) ↔ (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) = (FermatNo‘(𝑦 + 1))))
53	51, 52	bitr4id 290	. . . . . 6 ⊢ (𝑦 ∈ ℕ₀ → ((FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) ↔ ((FermatNo‘(𝑦 + 1)) − 2) = ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛)))
54		oveq2 7375	. . . . . . . . . . 11 ⊢ (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) = ((FermatNo‘(𝑦 + 1)) − 2) → ((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛)) = ((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ((FermatNo‘(𝑦 + 1)) − 2)))
55	54	oveq1d 7382	. . . . . . . . . 10 ⊢ (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) = ((FermatNo‘(𝑦 + 1)) − 2) → (((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛)) + ((FermatNo‘(𝑦 + 1)) − 1)) = (((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ((FermatNo‘(𝑦 + 1)) − 2)) + ((FermatNo‘(𝑦 + 1)) − 1)))
56	55	oveq1d 7382	. . . . . . . . 9 ⊢ (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) = ((FermatNo‘(𝑦 + 1)) − 2) → ((((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛)) + ((FermatNo‘(𝑦 + 1)) − 1)) + 1) = ((((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ((FermatNo‘(𝑦 + 1)) − 2)) + ((FermatNo‘(𝑦 + 1)) − 1)) + 1))
57	56	eqcoms 2744	. . . . . . . 8 ⊢ (((FermatNo‘(𝑦 + 1)) − 2) = ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) → ((((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛)) + ((FermatNo‘(𝑦 + 1)) − 1)) + 1) = ((((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ((FermatNo‘(𝑦 + 1)) − 2)) + ((FermatNo‘(𝑦 + 1)) − 1)) + 1))
58	33, 42	mulcld 11165	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ℕ₀ → (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) ∈ ℂ)
59	42, 5	subcld 11505	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ℕ₀ → ((FermatNo‘(𝑦 + 1)) − 2) ∈ ℂ)
60	58, 59	subcld 11505	. . . . . . . . . 10 ⊢ (𝑦 ∈ ℕ₀ → ((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ((FermatNo‘(𝑦 + 1)) − 2)) ∈ ℂ)
61	60, 43, 34	addassd 11167	. . . . . . . . 9 ⊢ (𝑦 ∈ ℕ₀ → ((((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ((FermatNo‘(𝑦 + 1)) − 2)) + ((FermatNo‘(𝑦 + 1)) − 1)) + 1) = (((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ((FermatNo‘(𝑦 + 1)) − 2)) + (((FermatNo‘(𝑦 + 1)) − 1) + 1)))
62		elnn0uz 12829	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∈ ℕ₀ ↔ 𝑦 ∈ (ℤ_≥‘0))
63	62	biimpi 216	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ ℕ₀ → 𝑦 ∈ (ℤ_≥‘0))
64		elfznn0 13574	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ (0...(𝑦 + 1)) → 𝑛 ∈ ℕ₀)
65	64, 30	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ (0...(𝑦 + 1)) → (FermatNo‘𝑛) ∈ ℂ)
66	65	adantl 481	. . . . . . . . . . . . . 14 ⊢ ((𝑦 ∈ ℕ₀ ∧ 𝑛 ∈ (0...(𝑦 + 1))) → (FermatNo‘𝑛) ∈ ℂ)
67		fveq2 6840	. . . . . . . . . . . . . 14 ⊢ (𝑛 = (𝑦 + 1) → (FermatNo‘𝑛) = (FermatNo‘(𝑦 + 1)))
68	63, 66, 67	fprodp1 15934	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ ℕ₀ → ∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))))
69	68	eqcomd 2742	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ ℕ₀ → (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) = ∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛))
70	69	oveq1d 7382	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ℕ₀ → ((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ((FermatNo‘(𝑦 + 1)) − 2)) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) − ((FermatNo‘(𝑦 + 1)) − 2)))
71		npcan1 11575	. . . . . . . . . . . 12 ⊢ ((FermatNo‘(𝑦 + 1)) ∈ ℂ → (((FermatNo‘(𝑦 + 1)) − 1) + 1) = (FermatNo‘(𝑦 + 1)))
72	42, 71	syl 17	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ℕ₀ → (((FermatNo‘(𝑦 + 1)) − 1) + 1) = (FermatNo‘(𝑦 + 1)))
73	70, 72	oveq12d 7385	. . . . . . . . . 10 ⊢ (𝑦 ∈ ℕ₀ → (((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ((FermatNo‘(𝑦 + 1)) − 2)) + (((FermatNo‘(𝑦 + 1)) − 1) + 1)) = ((∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) − ((FermatNo‘(𝑦 + 1)) − 2)) + (FermatNo‘(𝑦 + 1))))
74		fzfid 13935	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ ℕ₀ → (0...(𝑦 + 1)) ∈ Fin)
75	74, 66	fprodcl 15917	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ℕ₀ → ∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) ∈ ℂ)
76	75, 59, 42	subadd23d 11527	. . . . . . . . . 10 ⊢ (𝑦 ∈ ℕ₀ → ((∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) − ((FermatNo‘(𝑦 + 1)) − 2)) + (FermatNo‘(𝑦 + 1))) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + ((FermatNo‘(𝑦 + 1)) − ((FermatNo‘(𝑦 + 1)) − 2))))
77	73, 76	eqtrd 2771	. . . . . . . . 9 ⊢ (𝑦 ∈ ℕ₀ → (((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ((FermatNo‘(𝑦 + 1)) − 2)) + (((FermatNo‘(𝑦 + 1)) − 1) + 1)) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + ((FermatNo‘(𝑦 + 1)) − ((FermatNo‘(𝑦 + 1)) − 2))))
78	42, 5	nncand 11510	. . . . . . . . . 10 ⊢ (𝑦 ∈ ℕ₀ → ((FermatNo‘(𝑦 + 1)) − ((FermatNo‘(𝑦 + 1)) − 2)) = 2)
79	78	oveq2d 7383	. . . . . . . . 9 ⊢ (𝑦 ∈ ℕ₀ → (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + ((FermatNo‘(𝑦 + 1)) − ((FermatNo‘(𝑦 + 1)) − 2))) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + 2))
80	61, 77, 79	3eqtrd 2775	. . . . . . . 8 ⊢ (𝑦 ∈ ℕ₀ → ((((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ((FermatNo‘(𝑦 + 1)) − 2)) + ((FermatNo‘(𝑦 + 1)) − 1)) + 1) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + 2))
81	57, 80	sylan9eqr 2793	. . . . . . 7 ⊢ ((𝑦 ∈ ℕ₀ ∧ ((FermatNo‘(𝑦 + 1)) − 2) = ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛)) → ((((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛)) + ((FermatNo‘(𝑦 + 1)) − 1)) + 1) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + 2))
82	81	ex 412	. . . . . 6 ⊢ (𝑦 ∈ ℕ₀ → (((FermatNo‘(𝑦 + 1)) − 2) = ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) → ((((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛)) + ((FermatNo‘(𝑦 + 1)) − 1)) + 1) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + 2)))
83	53, 82	sylbid 240	. . . . 5 ⊢ (𝑦 ∈ ℕ₀ → ((FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) → ((((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛)) + ((FermatNo‘(𝑦 + 1)) − 1)) + 1) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + 2)))
84	83	imp 406	. . . 4 ⊢ ((𝑦 ∈ ℕ₀ ∧ (FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2)) → ((((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛)) + ((FermatNo‘(𝑦 + 1)) − 1)) + 1) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + 2))
85	50, 84	eqtrd 2771	. . 3 ⊢ ((𝑦 ∈ ℕ₀ ∧ (FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2)) → ((((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)) + 1) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + 2))
86	22, 26, 85	3eqtrd 2775	. 2 ⊢ ((𝑦 ∈ ℕ₀ ∧ (FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2)) → (FermatNo‘((𝑦 + 1) + 1)) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + 2))
87	86	ex 412	1 ⊢ (𝑦 ∈ ℕ₀ → ((FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) → (FermatNo‘((𝑦 + 1) + 1)) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + 2)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ‘cfv 6498 (class class class)co 7367 ℂcc 11036 0cc0 11038 1c1 11039 + caddc 11041 · cmul 11043 − cmin 11377 ℕcn 12174 2c2 12236 ℕ₀cn0 12437 ℤ_≥cuz 12788 ...cfz 13461 ↑cexp 14023 ∏cprod 15868 FermatNocfmtno 47990

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 df-fmtno 47991

This theorem is referenced by: fmtnorec2 48006

W3C validator