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 43703

Description: Lemma for fmtnorec2 43704 (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 11936	. . . . . 6 ⊢ (𝑦 ∈ ℕ₀ → (𝑦 + 1) ∈ ℕ₀)
2		peano2nn0 11936	. . . . . 6 ⊢ ((𝑦 + 1) ∈ ℕ₀ → ((𝑦 + 1) + 1) ∈ ℕ₀)
3		fmtno 43690	. . . . . 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 11714	. . . . . . . . 9 ⊢ (𝑦 ∈ ℕ₀ → 2 ∈ ℂ)
6	5, 1	expp1d 13510	. . . . . . . 8 ⊢ (𝑦 ∈ ℕ₀ → (2↑((𝑦 + 1) + 1)) = ((2↑(𝑦 + 1)) · 2))
7	6	oveq2d 7171	. . . . . . 7 ⊢ (𝑦 ∈ ℕ₀ → (2↑(2↑((𝑦 + 1) + 1))) = (2↑((2↑(𝑦 + 1)) · 2)))
8		2nn0 11913	. . . . . . . . . . . 12 ⊢ 2 ∈ ℕ₀
9	8	a1i 11	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ℕ₀ → 2 ∈ ℕ₀)
10	9, 1	nn0expcld 13606	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ℕ₀ → (2↑(𝑦 + 1)) ∈ ℕ₀)
11	9, 10	nn0expcld 13606	. . . . . . . . . 10 ⊢ (𝑦 ∈ ℕ₀ → (2↑(2↑(𝑦 + 1))) ∈ ℕ₀)
12	11	nn0cnd 11956	. . . . . . . . 9 ⊢ (𝑦 ∈ ℕ₀ → (2↑(2↑(𝑦 + 1))) ∈ ℂ)
13	12	sqvald 13506	. . . . . . . 8 ⊢ (𝑦 ∈ ℕ₀ → ((2↑(2↑(𝑦 + 1)))↑2) = ((2↑(2↑(𝑦 + 1))) · (2↑(2↑(𝑦 + 1)))))
14	5, 9, 10	expmuld 13512	. . . . . . . 8 ⊢ (𝑦 ∈ ℕ₀ → (2↑((2↑(𝑦 + 1)) · 2)) = ((2↑(2↑(𝑦 + 1)))↑2))
15		fmtnom1nn 43693	. . . . . . . . . 10 ⊢ ((𝑦 + 1) ∈ ℕ₀ → ((FermatNo‘(𝑦 + 1)) − 1) = (2↑(2↑(𝑦 + 1))))
16	1, 15	syl 17	. . . . . . . . 9 ⊢ (𝑦 ∈ ℕ₀ → ((FermatNo‘(𝑦 + 1)) − 1) = (2↑(2↑(𝑦 + 1))))
17	16, 16	oveq12d 7173	. . . . . . . 8 ⊢ (𝑦 ∈ ℕ₀ → (((FermatNo‘(𝑦 + 1)) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)) = ((2↑(2↑(𝑦 + 1))) · (2↑(2↑(𝑦 + 1)))))
18	13, 14, 17	3eqtr4d 2866	. . . . . . 7 ⊢ (𝑦 ∈ ℕ₀ → (2↑((2↑(𝑦 + 1)) · 2)) = (((FermatNo‘(𝑦 + 1)) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)))
19	7, 18	eqtrd 2856	. . . . . 6 ⊢ (𝑦 ∈ ℕ₀ → (2↑(2↑((𝑦 + 1) + 1))) = (((FermatNo‘(𝑦 + 1)) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)))
20	19	oveq1d 7170	. . . . 5 ⊢ (𝑦 ∈ ℕ₀ → ((2↑(2↑((𝑦 + 1) + 1))) + 1) = ((((FermatNo‘(𝑦 + 1)) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)) + 1))
21	4, 20	eqtrd 2856	. . . 4 ⊢ (𝑦 ∈ ℕ₀ → (FermatNo‘((𝑦 + 1) + 1)) = ((((FermatNo‘(𝑦 + 1)) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)) + 1))
22	21	adantr 483	. . 3 ⊢ ((𝑦 ∈ ℕ₀ ∧ (FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2)) → (FermatNo‘((𝑦 + 1) + 1)) = ((((FermatNo‘(𝑦 + 1)) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)) + 1))
23		oveq1 7162	. . . . . 6 ⊢ ((FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) → ((FermatNo‘(𝑦 + 1)) − 1) = ((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) − 1))
24	23	oveq1d 7170	. . . . 5 ⊢ ((FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) → (((FermatNo‘(𝑦 + 1)) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)) = (((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)))
25	24	oveq1d 7170	. . . 4 ⊢ ((FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) → ((((FermatNo‘(𝑦 + 1)) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)) + 1) = ((((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)) + 1))
26	25	adantl 484	. . 3 ⊢ ((𝑦 ∈ ℕ₀ ∧ (FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2)) → ((((FermatNo‘(𝑦 + 1)) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)) + 1) = ((((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)) + 1))
27		fzfid 13340	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ℕ₀ → (0...𝑦) ∈ Fin)
28		elfznn0 12999	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ (0...𝑦) → 𝑛 ∈ ℕ₀)
29		fmtnonn 43692	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ ℕ₀ → (FermatNo‘𝑛) ∈ ℕ)
30	29	nncnd 11653	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℕ₀ → (FermatNo‘𝑛) ∈ ℂ)
31	28, 30	syl 17	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ (0...𝑦) → (FermatNo‘𝑛) ∈ ℂ)
32	31	adantl 484	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ ℕ₀ ∧ 𝑛 ∈ (0...𝑦)) → (FermatNo‘𝑛) ∈ ℂ)
33	27, 32	fprodcl 15305	. . . . . . . . . 10 ⊢ (𝑦 ∈ ℕ₀ → ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) ∈ ℂ)
34		1cnd 10635	. . . . . . . . . 10 ⊢ (𝑦 ∈ ℕ₀ → 1 ∈ ℂ)
35	33, 5, 34	addsubassd 11016	. . . . . . . . 9 ⊢ (𝑦 ∈ ℕ₀ → ((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) − 1) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + (2 − 1)))
36		2m1e1 11762	. . . . . . . . . 10 ⊢ (2 − 1) = 1
37	36	oveq2i 7166	. . . . . . . . 9 ⊢ (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + (2 − 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 1)
38	35, 37	syl6eq 2872	. . . . . . . 8 ⊢ (𝑦 ∈ ℕ₀ → ((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) − 1) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 1))
39	38	oveq1d 7170	. . . . . . 7 ⊢ (𝑦 ∈ ℕ₀ → (((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)) = ((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 1) · ((FermatNo‘(𝑦 + 1)) − 1)))
40		fmtnonn 43692	. . . . . . . . . . 11 ⊢ ((𝑦 + 1) ∈ ℕ₀ → (FermatNo‘(𝑦 + 1)) ∈ ℕ)
41	1, 40	syl 17	. . . . . . . . . 10 ⊢ (𝑦 ∈ ℕ₀ → (FermatNo‘(𝑦 + 1)) ∈ ℕ)
42	41	nncnd 11653	. . . . . . . . 9 ⊢ (𝑦 ∈ ℕ₀ → (FermatNo‘(𝑦 + 1)) ∈ ℂ)
43	42, 34	subcld 10996	. . . . . . . 8 ⊢ (𝑦 ∈ ℕ₀ → ((FermatNo‘(𝑦 + 1)) − 1) ∈ ℂ)
44	33, 42	muls1d 11099	. . . . . . . . 9 ⊢ (𝑦 ∈ ℕ₀ → (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · ((FermatNo‘(𝑦 + 1)) − 1)) = ((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛)))
45	43	mulid2d 10658	. . . . . . . . 9 ⊢ (𝑦 ∈ ℕ₀ → (1 · ((FermatNo‘(𝑦 + 1)) − 1)) = ((FermatNo‘(𝑦 + 1)) − 1))
46	44, 45	oveq12d 7173	. . . . . . . 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 10667	. . . . . . 7 ⊢ (𝑦 ∈ ℕ₀ → ((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 1) · ((FermatNo‘(𝑦 + 1)) − 1)) = (((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛)) + ((FermatNo‘(𝑦 + 1)) − 1)))
48	39, 47	eqtrd 2856	. . . . . 6 ⊢ (𝑦 ∈ ℕ₀ → (((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)) = (((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛)) + ((FermatNo‘(𝑦 + 1)) − 1)))
49	48	adantr 483	. . . . 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 7170	. . . 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	42, 5, 33	subadd2d 11015	. . . . . . 7 ⊢ (𝑦 ∈ ℕ₀ → (((FermatNo‘(𝑦 + 1)) − 2) = ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) ↔ (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) = (FermatNo‘(𝑦 + 1))))
52		eqcom 2828	. . . . . . 7 ⊢ ((FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) ↔ (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) = (FermatNo‘(𝑦 + 1)))
53	51, 52	syl6rbbr 292	. . . . . 6 ⊢ (𝑦 ∈ ℕ₀ → ((FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) ↔ ((FermatNo‘(𝑦 + 1)) − 2) = ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛)))
54		oveq2 7163	. . . . . . . . . . 11 ⊢ (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) = ((FermatNo‘(𝑦 + 1)) − 2) → ((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛)) = ((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ((FermatNo‘(𝑦 + 1)) − 2)))
55	54	oveq1d 7170	. . . . . . . . . 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 7170	. . . . . . . . 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 2829	. . . . . . . 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 10660	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ℕ₀ → (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) ∈ ℂ)
59	42, 5	subcld 10996	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ℕ₀ → ((FermatNo‘(𝑦 + 1)) − 2) ∈ ℂ)
60	58, 59	subcld 10996	. . . . . . . . . 10 ⊢ (𝑦 ∈ ℕ₀ → ((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ((FermatNo‘(𝑦 + 1)) − 2)) ∈ ℂ)
61	60, 43, 34	addassd 10662	. . . . . . . . 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 12282	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∈ ℕ₀ ↔ 𝑦 ∈ (ℤ_≥‘0))
63	62	biimpi 218	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ ℕ₀ → 𝑦 ∈ (ℤ_≥‘0))
64		elfznn0 12999	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ (0...(𝑦 + 1)) → 𝑛 ∈ ℕ₀)
65	64, 30	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ (0...(𝑦 + 1)) → (FermatNo‘𝑛) ∈ ℂ)
66	65	adantl 484	. . . . . . . . . . . . . 14 ⊢ ((𝑦 ∈ ℕ₀ ∧ 𝑛 ∈ (0...(𝑦 + 1))) → (FermatNo‘𝑛) ∈ ℂ)
67		fveq2 6669	. . . . . . . . . . . . . 14 ⊢ (𝑛 = (𝑦 + 1) → (FermatNo‘𝑛) = (FermatNo‘(𝑦 + 1)))
68	63, 66, 67	fprodp1 15322	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ ℕ₀ → ∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))))
69	68	eqcomd 2827	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ ℕ₀ → (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) = ∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛))
70	69	oveq1d 7170	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ℕ₀ → ((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ((FermatNo‘(𝑦 + 1)) − 2)) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) − ((FermatNo‘(𝑦 + 1)) − 2)))
71		npcan1 11064	. . . . . . . . . . . 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 7173	. . . . . . . . . 10 ⊢ (𝑦 ∈ ℕ₀ → (((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ((FermatNo‘(𝑦 + 1)) − 2)) + (((FermatNo‘(𝑦 + 1)) − 1) + 1)) = ((∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) − ((FermatNo‘(𝑦 + 1)) − 2)) + (FermatNo‘(𝑦 + 1))))
74		fzfid 13340	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ ℕ₀ → (0...(𝑦 + 1)) ∈ Fin)
75	74, 66	fprodcl 15305	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ℕ₀ → ∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) ∈ ℂ)
76	75, 59, 42	subadd23d 11018	. . . . . . . . . 10 ⊢ (𝑦 ∈ ℕ₀ → ((∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) − ((FermatNo‘(𝑦 + 1)) − 2)) + (FermatNo‘(𝑦 + 1))) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + ((FermatNo‘(𝑦 + 1)) − ((FermatNo‘(𝑦 + 1)) − 2))))
77	73, 76	eqtrd 2856	. . . . . . . . 9 ⊢ (𝑦 ∈ ℕ₀ → (((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ((FermatNo‘(𝑦 + 1)) − 2)) + (((FermatNo‘(𝑦 + 1)) − 1) + 1)) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + ((FermatNo‘(𝑦 + 1)) − ((FermatNo‘(𝑦 + 1)) − 2))))
78	42, 5	nncand 11001	. . . . . . . . . 10 ⊢ (𝑦 ∈ ℕ₀ → ((FermatNo‘(𝑦 + 1)) − ((FermatNo‘(𝑦 + 1)) − 2)) = 2)
79	78	oveq2d 7171	. . . . . . . . 9 ⊢ (𝑦 ∈ ℕ₀ → (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + ((FermatNo‘(𝑦 + 1)) − ((FermatNo‘(𝑦 + 1)) − 2))) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + 2))
80	61, 77, 79	3eqtrd 2860	. . . . . . . 8 ⊢ (𝑦 ∈ ℕ₀ → ((((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ((FermatNo‘(𝑦 + 1)) − 2)) + ((FermatNo‘(𝑦 + 1)) − 1)) + 1) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + 2))
81	57, 80	sylan9eqr 2878	. . . . . . 7 ⊢ ((𝑦 ∈ ℕ₀ ∧ ((FermatNo‘(𝑦 + 1)) − 2) = ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛)) → ((((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛)) + ((FermatNo‘(𝑦 + 1)) − 1)) + 1) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + 2))
82	81	ex 415	. . . . . 6 ⊢ (𝑦 ∈ ℕ₀ → (((FermatNo‘(𝑦 + 1)) − 2) = ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) → ((((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛)) + ((FermatNo‘(𝑦 + 1)) − 1)) + 1) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + 2)))
83	53, 82	sylbid 242	. . . . 5 ⊢ (𝑦 ∈ ℕ₀ → ((FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) → ((((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛)) + ((FermatNo‘(𝑦 + 1)) − 1)) + 1) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + 2)))
84	83	imp 409	. . . 4 ⊢ ((𝑦 ∈ ℕ₀ ∧ (FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2)) → ((((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) · (FermatNo‘(𝑦 + 1))) − ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛)) + ((FermatNo‘(𝑦 + 1)) − 1)) + 1) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + 2))
85	50, 84	eqtrd 2856	. . 3 ⊢ ((𝑦 ∈ ℕ₀ ∧ (FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2)) → ((((∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) − 1) · ((FermatNo‘(𝑦 + 1)) − 1)) + 1) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + 2))
86	22, 26, 85	3eqtrd 2860	. 2 ⊢ ((𝑦 ∈ ℕ₀ ∧ (FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2)) → (FermatNo‘((𝑦 + 1) + 1)) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + 2))
87	86	ex 415	1 ⊢ (𝑦 ∈ ℕ₀ → ((FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) → (FermatNo‘((𝑦 + 1) + 1)) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + 2)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 398 = wceq 1533 ∈ wcel 2110 ‘cfv 6354 (class class class)co 7155 ℂcc 10534 0cc0 10536 1c1 10537 + caddc 10539 · cmul 10541 − cmin 10869 ℕcn 11637 2c2 11691 ℕ₀cn0 11896 ℤ_≥cuz 12242 ...cfz 12891 ↑cexp 13428 ∏cprod 15258 FermatNocfmtno 43688

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 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5189 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 ax-inf2 9103 ax-cnex 10592 ax-resscn 10593 ax-1cn 10594 ax-icn 10595 ax-addcl 10596 ax-addrcl 10597 ax-mulcl 10598 ax-mulrcl 10599 ax-mulcom 10600 ax-addass 10601 ax-mulass 10602 ax-distr 10603 ax-i2m1 10604 ax-1ne0 10605 ax-1rid 10606 ax-rnegex 10607 ax-rrecex 10608 ax-cnre 10609 ax-pre-lttri 10610 ax-pre-lttrn 10611 ax-pre-ltadd 10612 ax-pre-mulgt0 10613 ax-pre-sup 10614

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-fal 1546 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-tp 4571 df-op 4573 df-uni 4838 df-int 4876 df-iun 4920 df-br 5066 df-opab 5128 df-mpt 5146 df-tr 5172 df-id 5459 df-eprel 5464 df-po 5473 df-so 5474 df-fr 5513 df-se 5514 df-we 5515 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-pred 6147 df-ord 6193 df-on 6194 df-lim 6195 df-suc 6196 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-f1 6359 df-fo 6360 df-f1o 6361 df-fv 6362 df-isom 6363 df-riota 7113 df-ov 7158 df-oprab 7159 df-mpo 7160 df-om 7580 df-1st 7688 df-2nd 7689 df-wrecs 7946 df-recs 8007 df-rdg 8045 df-1o 8101 df-oadd 8105 df-er 8288 df-en 8509 df-dom 8510 df-sdom 8511 df-fin 8512 df-sup 8905 df-oi 8973 df-card 9367 df-pnf 10676 df-mnf 10677 df-xr 10678 df-ltxr 10679 df-le 10680 df-sub 10871 df-neg 10872 df-div 11297 df-nn 11638 df-2 11699 df-3 11700 df-n0 11897 df-z 11981 df-uz 12243 df-rp 12389 df-fz 12892 df-fzo 13033 df-seq 13369 df-exp 13429 df-hash 13690 df-cj 14457 df-re 14458 df-im 14459 df-sqrt 14593 df-abs 14594 df-clim 14844 df-prod 15259 df-fmtno 43689

This theorem is referenced by: fmtnorec2 43704

W3C validator