Theorem fmtnorec2 42476

Description: The second recurrence relation for Fermat numbers, see ProofWiki "Product of Sequence of Fermat Numbers plus 2", 29-Jul-2021, https://proofwiki.org/wiki/Product_of_Sequence_of_Fermat_Numbers_plus_2 or Wikipedia "Fermat number", 29-Jul-2021, https://en.wikipedia.org/wiki/Fermat_number#Basic_properties. (Contributed by AV, 29-Jul-2021.)

Assertion

Ref	Expression
fmtnorec2	⊢ (𝑁 ∈ ℕ0 → (FermatNo‘(𝑁 + 1)) = (∏𝑛 ∈ (0...𝑁)(FermatNo‘𝑛) + 2))

Distinct variable group:   𝑛,𝑁

Proof of Theorem fmtnorec2

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fvoveq1 6945	. . 3 ⊢ (𝑥 = 0 → (FermatNo‘(𝑥 + 1)) = (FermatNo‘(0 + 1)))
2		oveq2 6930	. . . . 5 ⊢ (𝑥 = 0 → (0...𝑥) = (0...0))
3	2	prodeq1d 15054	. . . 4 ⊢ (𝑥 = 0 → ∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) = ∏𝑛 ∈ (0...0)(FermatNo‘𝑛))
4	3	oveq1d 6937	. . 3 ⊢ (𝑥 = 0 → (∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) + 2) = (∏𝑛 ∈ (0...0)(FermatNo‘𝑛) + 2))
5	1, 4	eqeq12d 2793	. 2 ⊢ (𝑥 = 0 → ((FermatNo‘(𝑥 + 1)) = (∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) + 2) ↔ (FermatNo‘(0 + 1)) = (∏𝑛 ∈ (0...0)(FermatNo‘𝑛) + 2)))
6		fvoveq1 6945	. . 3 ⊢ (𝑥 = 𝑦 → (FermatNo‘(𝑥 + 1)) = (FermatNo‘(𝑦 + 1)))
7		oveq2 6930	. . . . 5 ⊢ (𝑥 = 𝑦 → (0...𝑥) = (0...𝑦))
8	7	prodeq1d 15054	. . . 4 ⊢ (𝑥 = 𝑦 → ∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) = ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛))
9	8	oveq1d 6937	. . 3 ⊢ (𝑥 = 𝑦 → (∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) + 2) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2))
10	6, 9	eqeq12d 2793	. 2 ⊢ (𝑥 = 𝑦 → ((FermatNo‘(𝑥 + 1)) = (∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) + 2) ↔ (FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2)))
11		fvoveq1 6945	. . 3 ⊢ (𝑥 = (𝑦 + 1) → (FermatNo‘(𝑥 + 1)) = (FermatNo‘((𝑦 + 1) + 1)))
12		oveq2 6930	. . . . 5 ⊢ (𝑥 = (𝑦 + 1) → (0...𝑥) = (0...(𝑦 + 1)))
13	12	prodeq1d 15054	. . . 4 ⊢ (𝑥 = (𝑦 + 1) → ∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) = ∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛))
14	13	oveq1d 6937	. . 3 ⊢ (𝑥 = (𝑦 + 1) → (∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) + 2) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + 2))
15	11, 14	eqeq12d 2793	. 2 ⊢ (𝑥 = (𝑦 + 1) → ((FermatNo‘(𝑥 + 1)) = (∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) + 2) ↔ (FermatNo‘((𝑦 + 1) + 1)) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + 2)))
16		fvoveq1 6945	. . 3 ⊢ (𝑥 = 𝑁 → (FermatNo‘(𝑥 + 1)) = (FermatNo‘(𝑁 + 1)))
17		oveq2 6930	. . . 4 ⊢ (𝑥 = 𝑁 → (0...𝑥) = (0...𝑁))
18		prodeq1 15042	. . . . 5 ⊢ ((0...𝑥) = (0...𝑁) → ∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) = ∏𝑛 ∈ (0...𝑁)(FermatNo‘𝑛))
19	18	oveq1d 6937	. . . 4 ⊢ ((0...𝑥) = (0...𝑁) → (∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) + 2) = (∏𝑛 ∈ (0...𝑁)(FermatNo‘𝑛) + 2))
20	17, 19	syl 17	. . 3 ⊢ (𝑥 = 𝑁 → (∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) + 2) = (∏𝑛 ∈ (0...𝑁)(FermatNo‘𝑛) + 2))
21	16, 20	eqeq12d 2793	. 2 ⊢ (𝑥 = 𝑁 → ((FermatNo‘(𝑥 + 1)) = (∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) + 2) ↔ (FermatNo‘(𝑁 + 1)) = (∏𝑛 ∈ (0...𝑁)(FermatNo‘𝑛) + 2)))
22		fmtno0 42473	. . . . 5 ⊢ (FermatNo‘0) = 3
23	22	oveq1i 6932	. . . 4 ⊢ ((FermatNo‘0) + 2) = (3 + 2)
24		3p2e5 11533	. . . 4 ⊢ (3 + 2) = 5
25	23, 24	eqtri 2802	. . 3 ⊢ ((FermatNo‘0) + 2) = 5
26		fz0sn 12758	. . . . . 6 ⊢ (0...0) = {0}
27	26	prodeq1i 15051	. . . . 5 ⊢ ∏𝑛 ∈ (0...0)(FermatNo‘𝑛) = ∏𝑛 ∈ {0} (FermatNo‘𝑛)
28		0z 11739	. . . . . 6 ⊢ 0 ∈ ℤ
29		0nn0 11659	. . . . . . 7 ⊢ 0 ∈ ℕ0
30		fmtnonn 42464	. . . . . . . 8 ⊢ (0 ∈ ℕ0 → (FermatNo‘0) ∈ ℕ)
31	30	nncnd 11392	. . . . . . 7 ⊢ (0 ∈ ℕ0 → (FermatNo‘0) ∈ ℂ)
32	29, 31	ax-mp 5	. . . . . 6 ⊢ (FermatNo‘0) ∈ ℂ
33		fveq2 6446	. . . . . . 7 ⊢ (𝑛 = 0 → (FermatNo‘𝑛) = (FermatNo‘0))
34	33	prodsn 15095	. . . . . 6 ⊢ ((0 ∈ ℤ ∧ (FermatNo‘0) ∈ ℂ) → ∏𝑛 ∈ {0} (FermatNo‘𝑛) = (FermatNo‘0))
35	28, 32, 34	mp2an 682	. . . . 5 ⊢ ∏𝑛 ∈ {0} (FermatNo‘𝑛) = (FermatNo‘0)
36	27, 35	eqtri 2802	. . . 4 ⊢ ∏𝑛 ∈ (0...0)(FermatNo‘𝑛) = (FermatNo‘0)
37	36	oveq1i 6932	. . 3 ⊢ (∏𝑛 ∈ (0...0)(FermatNo‘𝑛) + 2) = ((FermatNo‘0) + 2)
38		0p1e1 11504	. . . . 5 ⊢ (0 + 1) = 1
39	38	fveq2i 6449	. . . 4 ⊢ (FermatNo‘(0 + 1)) = (FermatNo‘1)
40		fmtno1 42474	. . . 4 ⊢ (FermatNo‘1) = 5
41	39, 40	eqtri 2802	. . 3 ⊢ (FermatNo‘(0 + 1)) = 5
42	25, 37, 41	3eqtr4ri 2813	. 2 ⊢ (FermatNo‘(0 + 1)) = (∏𝑛 ∈ (0...0)(FermatNo‘𝑛) + 2)
43		fmtnorec2lem 42475	. 2 ⊢ (𝑦 ∈ ℕ0 → ((FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) → (FermatNo‘((𝑦 + 1) + 1)) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + 2)))
44	5, 10, 15, 21, 42, 43	nn0ind 11824	1 ⊢ (𝑁 ∈ ℕ0 → (FermatNo‘(𝑁 + 1)) = (∏𝑛 ∈ (0...𝑁)(FermatNo‘𝑛) + 2))

Syntax hints:   → wi 4   = wceq 1601   ∈ wcel 2107  {csn 4398  ‘cfv 6135  (class class class)co 6922  ℂcc 10270  0cc0 10272  1c1 10273   + caddc 10275  2c2 11430  3c3 11431  5c5 11433  ℕ₀cn0 11642  ℤcz 11728  ...cfz 12643  ∏cprod 15038  FermatNocfmtno 42460

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1839  ax-4 1853  ax-5 1953  ax-6 2021  ax-7 2055  ax-8 2109  ax-9 2116  ax-10 2135  ax-11 2150  ax-12 2163  ax-13 2334  ax-ext 2754  ax-rep 5006  ax-sep 5017  ax-nul 5025  ax-pow 5077  ax-pr 5138  ax-un 7226  ax-inf2 8835  ax-cnex 10328  ax-resscn 10329  ax-1cn 10330  ax-icn 10331  ax-addcl 10332  ax-addrcl 10333  ax-mulcl 10334  ax-mulrcl 10335  ax-mulcom 10336  ax-addass 10337  ax-mulass 10338  ax-distr 10339  ax-i2m1 10340  ax-1ne0 10341  ax-1rid 10342  ax-rnegex 10343  ax-rrecex 10344  ax-cnre 10345  ax-pre-lttri 10346  ax-pre-lttrn 10347  ax-pre-ltadd 10348  ax-pre-mulgt0 10349  ax-pre-sup 10350

This theorem depends on definitions:  df-bi 199  df-an 387  df-or 837  df-3or 1072  df-3an 1073  df-tru 1605  df-fal 1615  df-ex 1824  df-nf 1828  df-sb 2012  df-mo 2551  df-eu 2587  df-clab 2764  df-cleq 2770  df-clel 2774  df-nfc 2921  df-ne 2970  df-nel 3076  df-ral 3095  df-rex 3096  df-reu 3097  df-rmo 3098  df-rab 3099  df-v 3400  df-sbc 3653  df-csb 3752  df-dif 3795  df-un 3797  df-in 3799  df-ss 3806  df-pss 3808  df-nul 4142  df-if 4308  df-pw 4381  df-sn 4399  df-pr 4401  df-tp 4403  df-op 4405  df-uni 4672  df-int 4711  df-iun 4755  df-br 4887  df-opab 4949  df-mpt 4966  df-tr 4988  df-id 5261  df-eprel 5266  df-po 5274  df-so 5275  df-fr 5314  df-se 5315  df-we 5316  df-xp 5361  df-rel 5362  df-cnv 5363  df-co 5364  df-dm 5365  df-rn 5366  df-res 5367  df-ima 5368  df-pred 5933  df-ord 5979  df-on 5980  df-lim 5981  df-suc 5982  df-iota 6099  df-fun 6137  df-fn 6138  df-f 6139  df-f1 6140  df-fo 6141  df-f1o 6142  df-fv 6143  df-isom 6144  df-riota 6883  df-ov 6925  df-oprab 6926  df-mpt2 6927  df-om 7344  df-1st 7445  df-2nd 7446  df-wrecs 7689  df-recs 7751  df-rdg 7789  df-1o 7843  df-oadd 7847  df-er 8026  df-en 8242  df-dom 8243  df-sdom 8244  df-fin 8245  df-sup 8636  df-oi 8704  df-card 9098  df-pnf 10413  df-mnf 10414  df-xr 10415  df-ltxr 10416  df-le 10417  df-sub 10608  df-neg 10609  df-div 11033  df-nn 11375  df-2 11438  df-3 11439  df-4 11440  df-5 11441  df-n0 11643  df-z 11729  df-uz 11993  df-rp 12138  df-fz 12644  df-fzo 12785  df-seq 13120  df-exp 13179  df-hash 13436  df-cj 14246  df-re 14247  df-im 14248  df-sqrt 14382  df-abs 14383  df-clim 14627  df-prod 15039  df-fmtno 42461

This theorem is referenced by:  fmtnodvds  42477  fmtnorec3  42481