Theorem fmtnorec2 48597

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 7441	. . 3 ⊢ (𝑥 = 0 → (FermatNo‘(𝑥 + 1)) = (FermatNo‘(0 + 1)))
2		oveq2 7426	. . . . 5 ⊢ (𝑥 = 0 → (0...𝑥) = (0...0))
3	2	prodeq1d 16081	. . . 4 ⊢ (𝑥 = 0 → ∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) = ∏𝑛 ∈ (0...0)(FermatNo‘𝑛))
4	3	oveq1d 7433	. . 3 ⊢ (𝑥 = 0 → (∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) + 2) = (∏𝑛 ∈ (0...0)(FermatNo‘𝑛) + 2))
5	1, 4	eqeq12d 2777	. 2 ⊢ (𝑥 = 0 → ((FermatNo‘(𝑥 + 1)) = (∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) + 2) ↔ (FermatNo‘(0 + 1)) = (∏𝑛 ∈ (0...0)(FermatNo‘𝑛) + 2)))
6		fvoveq1 7441	. . 3 ⊢ (𝑥 = 𝑦 → (FermatNo‘(𝑥 + 1)) = (FermatNo‘(𝑦 + 1)))
7		oveq2 7426	. . . . 5 ⊢ (𝑥 = 𝑦 → (0...𝑥) = (0...𝑦))
8	7	prodeq1d 16081	. . . 4 ⊢ (𝑥 = 𝑦 → ∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) = ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛))
9	8	oveq1d 7433	. . 3 ⊢ (𝑥 = 𝑦 → (∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) + 2) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2))
10	6, 9	eqeq12d 2777	. 2 ⊢ (𝑥 = 𝑦 → ((FermatNo‘(𝑥 + 1)) = (∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) + 2) ↔ (FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2)))
11		fvoveq1 7441	. . 3 ⊢ (𝑥 = (𝑦 + 1) → (FermatNo‘(𝑥 + 1)) = (FermatNo‘((𝑦 + 1) + 1)))
12		oveq2 7426	. . . . 5 ⊢ (𝑥 = (𝑦 + 1) → (0...𝑥) = (0...(𝑦 + 1)))
13	12	prodeq1d 16081	. . . 4 ⊢ (𝑥 = (𝑦 + 1) → ∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) = ∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛))
14	13	oveq1d 7433	. . 3 ⊢ (𝑥 = (𝑦 + 1) → (∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) + 2) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + 2))
15	11, 14	eqeq12d 2777	. 2 ⊢ (𝑥 = (𝑦 + 1) → ((FermatNo‘(𝑥 + 1)) = (∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) + 2) ↔ (FermatNo‘((𝑦 + 1) + 1)) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + 2)))
16		fvoveq1 7441	. . 3 ⊢ (𝑥 = 𝑁 → (FermatNo‘(𝑥 + 1)) = (FermatNo‘(𝑁 + 1)))
17		oveq2 7426	. . . 4 ⊢ (𝑥 = 𝑁 → (0...𝑥) = (0...𝑁))
18		prodeq1 16069	. . . . 5 ⊢ ((0...𝑥) = (0...𝑁) → ∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) = ∏𝑛 ∈ (0...𝑁)(FermatNo‘𝑛))
19	18	oveq1d 7433	. . . 4 ⊢ ((0...𝑥) = (0...𝑁) → (∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) + 2) = (∏𝑛 ∈ (0...𝑁)(FermatNo‘𝑛) + 2))
20	17, 19	syl 18	. . 3 ⊢ (𝑥 = 𝑁 → (∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) + 2) = (∏𝑛 ∈ (0...𝑁)(FermatNo‘𝑛) + 2))
21	16, 20	eqeq12d 2777	. 2 ⊢ (𝑥 = 𝑁 → ((FermatNo‘(𝑥 + 1)) = (∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) + 2) ↔ (FermatNo‘(𝑁 + 1)) = (∏𝑛 ∈ (0...𝑁)(FermatNo‘𝑛) + 2)))
22		fmtno0 48594	. . . . 5 ⊢ (FermatNo‘0) = 3
23	22	oveq1i 7428	. . . 4 ⊢ ((FermatNo‘0) + 2) = (3 + 2)
24		3p2e5 12486	. . . 4 ⊢ (3 + 2) = 5
25	23, 24	eqtri 2784	. . 3 ⊢ ((FermatNo‘0) + 2) = 5
26		fz0sn 13754	. . . . . 6 ⊢ (0...0) = {0}
27	26	prodeq1i 16078	. . . . 5 ⊢ ∏𝑛 ∈ (0...0)(FermatNo‘𝑛) = ∏𝑛 ∈ {0} (FermatNo‘𝑛)
28		0z 12697	. . . . . 6 ⊢ 0 ∈ ℤ
29		0nn0 12614	. . . . . . 7 ⊢ 0 ∈ ℕ0
30		fmtnonn 48585	. . . . . . . 8 ⊢ (0 ∈ ℕ0 → (FermatNo‘0) ∈ ℕ)
31	30	nncnd 12344	. . . . . . 7 ⊢ (0 ∈ ℕ0 → (FermatNo‘0) ∈ ℂ)
32	29, 31	ax-mp 5	. . . . . 6 ⊢ (FermatNo‘0) ∈ ℂ
33		fveq2 6883	. . . . . . 7 ⊢ (𝑛 = 0 → (FermatNo‘𝑛) = (FermatNo‘0))
34	33	prodsn 16122	. . . . . 6 ⊢ ((0 ∈ ℤ ∧ (FermatNo‘0) ∈ ℂ) → ∏𝑛 ∈ {0} (FermatNo‘𝑛) = (FermatNo‘0))
35	28, 32, 34	mp2an 705	. . . . 5 ⊢ ∏𝑛 ∈ {0} (FermatNo‘𝑛) = (FermatNo‘0)
36	27, 35	eqtri 2784	. . . 4 ⊢ ∏𝑛 ∈ (0...0)(FermatNo‘𝑛) = (FermatNo‘0)
37	36	oveq1i 7428	. . 3 ⊢ (∏𝑛 ∈ (0...0)(FermatNo‘𝑛) + 2) = ((FermatNo‘0) + 2)
38		0p1e1 12456	. . . . 5 ⊢ (0 + 1) = 1
39	38	fveq2i 6886	. . . 4 ⊢ (FermatNo‘(0 + 1)) = (FermatNo‘1)
40		fmtno1 48595	. . . 4 ⊢ (FermatNo‘1) = 5
41	39, 40	eqtri 2784	. . 3 ⊢ (FermatNo‘(0 + 1)) = 5
42	25, 37, 41	3eqtr4ri 2795	. 2 ⊢ (FermatNo‘(0 + 1)) = (∏𝑛 ∈ (0...0)(FermatNo‘𝑛) + 2)
43		fmtnorec2lem 48596	. 2 ⊢ (𝑦 ∈ ℕ0 → ((FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) → (FermatNo‘((𝑦 + 1) + 1)) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + 2)))
44	5, 10, 15, 21, 42, 43	nn0ind 12787	1 ⊢ (𝑁 ∈ ℕ0 → (FermatNo‘(𝑁 + 1)) = (∏𝑛 ∈ (0...𝑁)(FermatNo‘𝑛) + 2))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  {csn 4584  ‘cfv 6537  (class class class)co 7418  ℂcc 11191  0cc0 11193  1c1 11194   + caddc 11196  2c2 12390  3c3 12391  5c5 12393  ℕ₀cn0 12599  ℤcz 12686  ...cfz 13632  ∏cprod 16065  FermatNocfmtno 48581

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749  ax-inf2 9635  ax-cnex 11249  ax-resscn 11250  ax-1cn 11251  ax-icn 11252  ax-addcl 11253  ax-addrcl 11254  ax-mulcl 11255  ax-mulrcl 11256  ax-mulcom 11257  ax-addass 11258  ax-mulass 11259  ax-distr 11260  ax-i2m1 11261  ax-1ne0 11262  ax-1rid 11263  ax-rnegex 11264  ax-rrecex 11265  ax-cnre 11266  ax-pre-lttri 11267  ax-pre-lttrn 11268  ax-pre-ltadd 11269  ax-pre-mulgt0 11270  ax-pre-sup 11271

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-isom 6546  df-riota 7375  df-ov 7421  df-oprab 7422  df-mpo 7423  df-om 7876  df-1st 7999  df-2nd 8000  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-rdg 8411  df-1o 8469  df-er 8710  df-en 8967  df-dom 8968  df-sdom 8969  df-fin 8970  df-sup 9427  df-oi 9497  df-card 10013  df-pnf 11338  df-mnf 11339  df-xr 11340  df-ltxr 11341  df-le 11342  df-sub 11536  df-neg 11537  df-div 11967  df-nn 12329  df-2 12398  df-3 12399  df-4 12400  df-5 12401  df-n0 12600  df-z 12687  df-uz 12959  df-rp 13114  df-fz 13633  df-fzo 13782  df-seq 14138  df-exp 14198  df-hash 14468  df-cj 15259  df-re 15260  df-im 15261  df-sqrt 15395  df-abs 15396  df-clim 15648  df-prod 16066  df-fmtno 48582

This theorem is used by:  fmtnodvds  48598  fmtnorec3  48602