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

Theorem bgoldbachlt 49244
Description: The binary Goldbach conjecture is valid for small even numbers (i.e. for all even numbers less than or equal to a fixed big 𝑚). This is verified for m = 4 x 10^18 by Oliveira e Silva, see ax-bgbltosilva 49241. (Contributed by AV, 3-Aug-2020.) (Revised by AV, 9-Sep-2021.)
Assertion
Ref Expression
bgoldbachlt ∃𝑚 ∈ ℕ ((4 · (10↑18)) ≤ 𝑚 ∧ ∀𝑛 ∈ Even ((4 < 𝑛 ∧ 𝑛 < 𝑚) → 𝑛 ∈ GoldbachEven ))
Distinct variable group:   𝑚,𝑛

Proof of Theorem bgoldbachlt
StepHypRef Expression
1 4nn 12465 . . 3 4 ∈ ℕ
2 10nn 12873 . . . 4 10 ∈ ℕ
3 1nn0 12661 . . . . 5 1 ∈ ℕ0
4 8nn0 12668 . . . . 5 8 ∈ ℕ0
53, 4deccl 12868 . . . 4 18 ∈ ℕ0
6 nnexpcl 14256 . . . 4 ((10 ∈ ℕ ∧ 18 ∈ ℕ0) → (10↑18) ∈ ℕ)
72, 5, 6mp2an 705 . . 3 (10↑18) ∈ ℕ
81, 7nnmulcli 12399 . 2 (4 · (10↑18)) ∈ ℕ
9 id 23 . . 3 ((4 · (10↑18)) ∈ ℕ → (4 · (10↑18)) ∈ ℕ)
10 breq2 5111 . . . . 5 (𝑚 = (4 · (10↑18)) → ((4 · (10↑18)) ≤ 𝑚 ↔ (4 · (10↑18)) ≤ (4 · (10↑18))))
11 breq2 5111 . . . . . . . 8 (𝑚 = (4 · (10↑18)) → (𝑛 < 𝑚 ↔ 𝑛 < (4 · (10↑18))))
1211anbi2d 642 . . . . . . 7 (𝑚 = (4 · (10↑18)) → ((4 < 𝑛 ∧ 𝑛 < 𝑚) ↔ (4 < 𝑛 ∧ 𝑛 < (4 · (10↑18)))))
1312imbi1d 344 . . . . . 6 (𝑚 = (4 · (10↑18)) → (((4 < 𝑛 ∧ 𝑛 < 𝑚) → 𝑛 ∈ GoldbachEven ) ↔ ((4 < 𝑛 ∧ 𝑛 < (4 · (10↑18))) → 𝑛 ∈ GoldbachEven )))
1413ralbidv 3192 . . . . 5 (𝑚 = (4 · (10↑18)) → (∀𝑛 ∈ Even ((4 < 𝑛 ∧ 𝑛 < 𝑚) → 𝑛 ∈ GoldbachEven ) ↔ ∀𝑛 ∈ Even ((4 < 𝑛 ∧ 𝑛 < (4 · (10↑18))) → 𝑛 ∈ GoldbachEven )))
1510, 14anbi12d 644 . . . 4 (𝑚 = (4 · (10↑18)) → (((4 · (10↑18)) ≤ 𝑚 ∧ ∀𝑛 ∈ Even ((4 < 𝑛 ∧ 𝑛 < 𝑚) → 𝑛 ∈ GoldbachEven )) ↔ ((4 · (10↑18)) ≤ (4 · (10↑18)) ∧ ∀𝑛 ∈ Even ((4 < 𝑛 ∧ 𝑛 < (4 · (10↑18))) → 𝑛 ∈ GoldbachEven ))))
1615adantl 487 . . 3 (((4 · (10↑18)) ∈ ℕ ∧ 𝑚 = (4 · (10↑18))) → (((4 · (10↑18)) ≤ 𝑚 ∧ ∀𝑛 ∈ Even ((4 < 𝑛 ∧ 𝑛 < 𝑚) → 𝑛 ∈ GoldbachEven )) ↔ ((4 · (10↑18)) ≤ (4 · (10↑18)) ∧ ∀𝑛 ∈ Even ((4 < 𝑛 ∧ 𝑛 < (4 · (10↑18))) → 𝑛 ∈ GoldbachEven ))))
17 nnre 12381 . . . . 5 ((4 · (10↑18)) ∈ ℕ → (4 · (10↑18)) ∈ ℝ)
1817leidd 11921 . . . 4 ((4 · (10↑18)) ∈ ℕ → (4 · (10↑18)) ≤ (4 · (10↑18)))
19 simplr 781 . . . . . . 7 ((((4 · (10↑18)) ∈ ℕ ∧ 𝑛 ∈ Even ) ∧ (4 < 𝑛 ∧ 𝑛 < (4 · (10↑18)))) → 𝑛 ∈ Even )
20 simprl 783 . . . . . . 7 ((((4 · (10↑18)) ∈ ℕ ∧ 𝑛 ∈ Even ) ∧ (4 < 𝑛 ∧ 𝑛 < (4 · (10↑18)))) → 4 < 𝑛)
21 evenz 49061 . . . . . . . . . . 11 (𝑛 ∈ Even → 𝑛 ∈ ℤ)
2221zred 12842 . . . . . . . . . 10 (𝑛 ∈ Even → 𝑛 ∈ ℝ)
23 ltle 11436 . . . . . . . . . 10 ((𝑛 ∈ ℝ ∧ (4 · (10↑18)) ∈ ℝ) → (𝑛 < (4 · (10↑18)) → 𝑛 ≤ (4 · (10↑18))))
2422, 17, 23syl2anr 609 . . . . . . . . 9 (((4 · (10↑18)) ∈ ℕ ∧ 𝑛 ∈ Even ) → (𝑛 < (4 · (10↑18)) → 𝑛 ≤ (4 · (10↑18))))
2524a1d 26 . . . . . . . 8 (((4 · (10↑18)) ∈ ℕ ∧ 𝑛 ∈ Even ) → (4 < 𝑛 → (𝑛 < (4 · (10↑18)) → 𝑛 ≤ (4 · (10↑18)))))
2625imp32 424 . . . . . . 7 ((((4 · (10↑18)) ∈ ℕ ∧ 𝑛 ∈ Even ) ∧ (4 < 𝑛 ∧ 𝑛 < (4 · (10↑18)))) → 𝑛 ≤ (4 · (10↑18)))
27 ax-bgbltosilva 49241 . . . . . . 7 ((𝑛 ∈ Even ∧ 4 < 𝑛 ∧ 𝑛 ≤ (4 · (10↑18))) → 𝑛 ∈ GoldbachEven )
2819, 20, 26, 27syl3anc 1401 . . . . . 6 ((((4 · (10↑18)) ∈ ℕ ∧ 𝑛 ∈ Even ) ∧ (4 < 𝑛 ∧ 𝑛 < (4 · (10↑18)))) → 𝑛 ∈ GoldbachEven )
2928ex 418 . . . . 5 (((4 · (10↑18)) ∈ ℕ ∧ 𝑛 ∈ Even ) → ((4 < 𝑛 ∧ 𝑛 < (4 · (10↑18))) → 𝑛 ∈ GoldbachEven ))
3029ralrimiva 3161 . . . 4 ((4 · (10↑18)) ∈ ℕ → ∀𝑛 ∈ Even ((4 < 𝑛 ∧ 𝑛 < (4 · (10↑18))) → 𝑛 ∈ GoldbachEven ))
3118, 30jca 521 . . 3 ((4 · (10↑18)) ∈ ℕ → ((4 · (10↑18)) ≤ (4 · (10↑18)) ∧ ∀𝑛 ∈ Even ((4 < 𝑛 ∧ 𝑛 < (4 · (10↑18))) → 𝑛 ∈ GoldbachEven )))
329, 16, 31rspcedvd 3581 . 2 ((4 · (10↑18)) ∈ ℕ → ∃𝑚 ∈ ℕ ((4 · (10↑18)) ≤ 𝑚 ∧ ∀𝑛 ∈ Even ((4 < 𝑛 ∧ 𝑛 < 𝑚) → 𝑛 ∈ GoldbachEven )))
338, 32ax-mp 5 1 ∃𝑚 ∈ ℕ ((4 · (10↑18)) ≤ 𝑚 ∧ ∀𝑛 ∈ Even ((4 < 𝑛 ∧ 𝑛 < 𝑚) → 𝑛 ∈ GoldbachEven ))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1572   ∈ wcel 2150  ∀wral 3083  ∃wrex 3093   class class class wbr 5107  (class class class)co 7450  ℝcr 11237  0cc0 11238  1c1 11239   · cmul 11243   < clt 11381   ≤ cle 11382  ℕcn 12374  4c4 12438  8c8 12442  ℕ0cn0 12645  cdc 12853  ↑cexp 14243   Even ceven 49055   GoldbachEven cgbe 49176
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782  ax-cnex 11294  ax-resscn 11295  ax-1cn 11296  ax-icn 11297  ax-addcl 11298  ax-addrcl 11299  ax-mulcl 11300  ax-mulrcl 11301  ax-mulcom 11302  ax-addass 11303  ax-mulass 11304  ax-distr 11305  ax-i2m1 11306  ax-1ne0 11307  ax-1rid 11308  ax-rnegex 11309  ax-rrecex 11310  ax-cnre 11311  ax-pre-lttri 11312  ax-pre-lttrn 11313  ax-pre-ltadd 11314  ax-pre-mulgt0 11315  ax-bgbltosilva 49241
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-nel 3069  df-ral 3084  df-rex 3094  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-pred 6329  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-om 7911  df-2nd 8035  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-rdg 8455  df-er 8754  df-en 9011  df-dom 9012  df-sdom 9013  df-pnf 11383  df-mnf 11384  df-xr 11385  df-ltxr 11386  df-le 11387  df-sub 11581  df-neg 11582  df-nn 12375  df-2 12444  df-3 12445  df-4 12446  df-5 12447  df-6 12448  df-7 12449  df-8 12450  df-9 12451  df-n0 12646  df-z 12733  df-dec 12854  df-uz 13005  df-seq 14184  df-exp 14244  df-even 49057
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator