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

Theorem fmtnorec2 41780
 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.
StepHypRef Expression
1 oveq1 6697 . . . 4 (𝑥 = 0 → (𝑥 + 1) = (0 + 1))
21fveq2d 6233 . . 3 (𝑥 = 0 → (FermatNo‘(𝑥 + 1)) = (FermatNo‘(0 + 1)))
3 oveq2 6698 . . . . 5 (𝑥 = 0 → (0...𝑥) = (0...0))
43prodeq1d 14695 . . . 4 (𝑥 = 0 → ∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) = ∏𝑛 ∈ (0...0)(FermatNo‘𝑛))
54oveq1d 6705 . . 3 (𝑥 = 0 → (∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) + 2) = (∏𝑛 ∈ (0...0)(FermatNo‘𝑛) + 2))
62, 5eqeq12d 2666 . 2 (𝑥 = 0 → ((FermatNo‘(𝑥 + 1)) = (∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) + 2) ↔ (FermatNo‘(0 + 1)) = (∏𝑛 ∈ (0...0)(FermatNo‘𝑛) + 2)))
7 oveq1 6697 . . . 4 (𝑥 = 𝑦 → (𝑥 + 1) = (𝑦 + 1))
87fveq2d 6233 . . 3 (𝑥 = 𝑦 → (FermatNo‘(𝑥 + 1)) = (FermatNo‘(𝑦 + 1)))
9 oveq2 6698 . . . . 5 (𝑥 = 𝑦 → (0...𝑥) = (0...𝑦))
109prodeq1d 14695 . . . 4 (𝑥 = 𝑦 → ∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) = ∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛))
1110oveq1d 6705 . . 3 (𝑥 = 𝑦 → (∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) + 2) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2))
128, 11eqeq12d 2666 . 2 (𝑥 = 𝑦 → ((FermatNo‘(𝑥 + 1)) = (∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) + 2) ↔ (FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2)))
13 oveq1 6697 . . . 4 (𝑥 = (𝑦 + 1) → (𝑥 + 1) = ((𝑦 + 1) + 1))
1413fveq2d 6233 . . 3 (𝑥 = (𝑦 + 1) → (FermatNo‘(𝑥 + 1)) = (FermatNo‘((𝑦 + 1) + 1)))
15 oveq2 6698 . . . . 5 (𝑥 = (𝑦 + 1) → (0...𝑥) = (0...(𝑦 + 1)))
1615prodeq1d 14695 . . . 4 (𝑥 = (𝑦 + 1) → ∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) = ∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛))
1716oveq1d 6705 . . 3 (𝑥 = (𝑦 + 1) → (∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) + 2) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + 2))
1814, 17eqeq12d 2666 . 2 (𝑥 = (𝑦 + 1) → ((FermatNo‘(𝑥 + 1)) = (∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) + 2) ↔ (FermatNo‘((𝑦 + 1) + 1)) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + 2)))
19 oveq1 6697 . . . 4 (𝑥 = 𝑁 → (𝑥 + 1) = (𝑁 + 1))
2019fveq2d 6233 . . 3 (𝑥 = 𝑁 → (FermatNo‘(𝑥 + 1)) = (FermatNo‘(𝑁 + 1)))
21 oveq2 6698 . . . 4 (𝑥 = 𝑁 → (0...𝑥) = (0...𝑁))
22 prodeq1 14683 . . . . 5 ((0...𝑥) = (0...𝑁) → ∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) = ∏𝑛 ∈ (0...𝑁)(FermatNo‘𝑛))
2322oveq1d 6705 . . . 4 ((0...𝑥) = (0...𝑁) → (∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) + 2) = (∏𝑛 ∈ (0...𝑁)(FermatNo‘𝑛) + 2))
2421, 23syl 17 . . 3 (𝑥 = 𝑁 → (∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) + 2) = (∏𝑛 ∈ (0...𝑁)(FermatNo‘𝑛) + 2))
2520, 24eqeq12d 2666 . 2 (𝑥 = 𝑁 → ((FermatNo‘(𝑥 + 1)) = (∏𝑛 ∈ (0...𝑥)(FermatNo‘𝑛) + 2) ↔ (FermatNo‘(𝑁 + 1)) = (∏𝑛 ∈ (0...𝑁)(FermatNo‘𝑛) + 2)))
26 fmtno0 41777 . . . . 5 (FermatNo‘0) = 3
2726oveq1i 6700 . . . 4 ((FermatNo‘0) + 2) = (3 + 2)
28 3p2e5 11198 . . . 4 (3 + 2) = 5
2927, 28eqtri 2673 . . 3 ((FermatNo‘0) + 2) = 5
30 fz0sn 12478 . . . . . 6 (0...0) = {0}
3130prodeq1i 14692 . . . . 5 𝑛 ∈ (0...0)(FermatNo‘𝑛) = ∏𝑛 ∈ {0} (FermatNo‘𝑛)
32 0z 11426 . . . . . 6 0 ∈ ℤ
33 0nn0 11345 . . . . . . 7 0 ∈ ℕ0
34 fmtnonn 41768 . . . . . . . 8 (0 ∈ ℕ0 → (FermatNo‘0) ∈ ℕ)
3534nncnd 11074 . . . . . . 7 (0 ∈ ℕ0 → (FermatNo‘0) ∈ ℂ)
3633, 35ax-mp 5 . . . . . 6 (FermatNo‘0) ∈ ℂ
37 fveq2 6229 . . . . . . 7 (𝑛 = 0 → (FermatNo‘𝑛) = (FermatNo‘0))
3837prodsn 14736 . . . . . 6 ((0 ∈ ℤ ∧ (FermatNo‘0) ∈ ℂ) → ∏𝑛 ∈ {0} (FermatNo‘𝑛) = (FermatNo‘0))
3932, 36, 38mp2an 708 . . . . 5 𝑛 ∈ {0} (FermatNo‘𝑛) = (FermatNo‘0)
4031, 39eqtri 2673 . . . 4 𝑛 ∈ (0...0)(FermatNo‘𝑛) = (FermatNo‘0)
4140oveq1i 6700 . . 3 (∏𝑛 ∈ (0...0)(FermatNo‘𝑛) + 2) = ((FermatNo‘0) + 2)
42 0p1e1 11170 . . . . 5 (0 + 1) = 1
4342fveq2i 6232 . . . 4 (FermatNo‘(0 + 1)) = (FermatNo‘1)
44 fmtno1 41778 . . . 4 (FermatNo‘1) = 5
4543, 44eqtri 2673 . . 3 (FermatNo‘(0 + 1)) = 5
4629, 41, 453eqtr4ri 2684 . 2 (FermatNo‘(0 + 1)) = (∏𝑛 ∈ (0...0)(FermatNo‘𝑛) + 2)
47 fmtnorec2lem 41779 . 2 (𝑦 ∈ ℕ0 → ((FermatNo‘(𝑦 + 1)) = (∏𝑛 ∈ (0...𝑦)(FermatNo‘𝑛) + 2) → (FermatNo‘((𝑦 + 1) + 1)) = (∏𝑛 ∈ (0...(𝑦 + 1))(FermatNo‘𝑛) + 2)))
486, 12, 18, 25, 46, 47nn0ind 11510 1 (𝑁 ∈ ℕ0 → (FermatNo‘(𝑁 + 1)) = (∏𝑛 ∈ (0...𝑁)(FermatNo‘𝑛) + 2))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   = wceq 1523   ∈ wcel 2030  {csn 4210  ‘cfv 5926  (class class class)co 6690  ℂcc 9972  0cc0 9974  1c1 9975   + caddc 9977  2c2 11108  3c3 11109  5c5 11111  ℕ0cn0 11330  ℤcz 11415  ...cfz 12364  ∏cprod 14679  FermatNocfmtno 41764 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-rep 4804  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991  ax-inf2 8576  ax-cnex 10030  ax-resscn 10031  ax-1cn 10032  ax-icn 10033  ax-addcl 10034  ax-addrcl 10035  ax-mulcl 10036  ax-mulrcl 10037  ax-mulcom 10038  ax-addass 10039  ax-mulass 10040  ax-distr 10041  ax-i2m1 10042  ax-1ne0 10043  ax-1rid 10044  ax-rnegex 10045  ax-rrecex 10046  ax-cnre 10047  ax-pre-lttri 10048  ax-pre-lttrn 10049  ax-pre-ltadd 10050  ax-pre-mulgt0 10051  ax-pre-sup 10052 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1055  df-3an 1056  df-tru 1526  df-fal 1529  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-nel 2927  df-ral 2946  df-rex 2947  df-reu 2948  df-rmo 2949  df-rab 2950  df-v 3233  df-sbc 3469  df-csb 3567  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-pss 3623  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-tp 4215  df-op 4217  df-uni 4469  df-int 4508  df-iun 4554  df-br 4686  df-opab 4746  df-mpt 4763  df-tr 4786  df-id 5053  df-eprel 5058  df-po 5064  df-so 5065  df-fr 5102  df-se 5103  df-we 5104  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-pred 5718  df-ord 5764  df-on 5765  df-lim 5766  df-suc 5767  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-f1 5931  df-fo 5932  df-f1o 5933  df-fv 5934  df-isom 5935  df-riota 6651  df-ov 6693  df-oprab 6694  df-mpt2 6695  df-om 7108  df-1st 7210  df-2nd 7211  df-wrecs 7452  df-recs 7513  df-rdg 7551  df-1o 7605  df-oadd 7609  df-er 7787  df-en 7998  df-dom 7999  df-sdom 8000  df-fin 8001  df-sup 8389  df-oi 8456  df-card 8803  df-pnf 10114  df-mnf 10115  df-xr 10116  df-ltxr 10117  df-le 10118  df-sub 10306  df-neg 10307  df-div 10723  df-nn 11059  df-2 11117  df-3 11118  df-4 11119  df-5 11120  df-n0 11331  df-z 11416  df-uz 11726  df-rp 11871  df-fz 12365  df-fzo 12505  df-seq 12842  df-exp 12901  df-hash 13158  df-cj 13883  df-re 13884  df-im 13885  df-sqrt 14019  df-abs 14020  df-clim 14263  df-prod 14680  df-fmtno 41765 This theorem is referenced by:  fmtnodvds  41781  fmtnorec3  41785
 Copyright terms: Public domain W3C validator