Theorem bgoldbachlt 48827

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 48824. (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

Step	Hyp	Ref	Expression
1		4nn 12381	. . 3 ⊢ 4 ∈ ℕ
2		10nn 12789	. . . 4 ⊢ ;10 ∈ ℕ
3		1nn0 12577	. . . . 5 ⊢ 1 ∈ ℕ0
4		8nn0 12584	. . . . 5 ⊢ 8 ∈ ℕ0
5	3, 4	deccl 12784	. . . 4 ⊢ ;18 ∈ ℕ0
6		nnexpcl 14171	. . . 4 ⊢ ((;10 ∈ ℕ ∧ ;18 ∈ ℕ0) → (;10↑;18) ∈ ℕ)
7	2, 5, 6	mp2an 705	. . 3 ⊢ (;10↑;18) ∈ ℕ
8	1, 7	nnmulcli 12315	. 2 ⊢ (4 · (;10↑;18)) ∈ ℕ
9		id 23	. . 3 ⊢ ((4 · (;10↑;18)) ∈ ℕ → (4 · (;10↑;18)) ∈ ℕ)
10		breq2 5107	. . . . 5 ⊢ (𝑚 = (4 · (;10↑;18)) → ((4 · (;10↑;18)) ≤ 𝑚 ↔ (4 · (;10↑;18)) ≤ (4 · (;10↑;18))))
11		breq2 5107	. . . . . . . 8 ⊢ (𝑚 = (4 · (;10↑;18)) → (𝑛 < 𝑚 ↔ 𝑛 < (4 · (;10↑;18))))
12	11	anbi2d 642	. . . . . . 7 ⊢ (𝑚 = (4 · (;10↑;18)) → ((4 < 𝑛 ∧ 𝑛 < 𝑚) ↔ (4 < 𝑛 ∧ 𝑛 < (4 · (;10↑;18)))))
13	12	imbi1d 344	. . . . . 6 ⊢ (𝑚 = (4 · (;10↑;18)) → (((4 < 𝑛 ∧ 𝑛 < 𝑚) → 𝑛 ∈ GoldbachEven ) ↔ ((4 < 𝑛 ∧ 𝑛 < (4 · (;10↑;18))) → 𝑛 ∈ GoldbachEven )))
14	13	ralbidv 3185	. . . . 5 ⊢ (𝑚 = (4 · (;10↑;18)) → (∀𝑛 ∈ Even ((4 < 𝑛 ∧ 𝑛 < 𝑚) → 𝑛 ∈ GoldbachEven ) ↔ ∀𝑛 ∈ Even ((4 < 𝑛 ∧ 𝑛 < (4 · (;10↑;18))) → 𝑛 ∈ GoldbachEven )))
15	10, 14	anbi12d 644	. . . 4 ⊢ (𝑚 = (4 · (;10↑;18)) → (((4 · (;10↑;18)) ≤ 𝑚 ∧ ∀𝑛 ∈ Even ((4 < 𝑛 ∧ 𝑛 < 𝑚) → 𝑛 ∈ GoldbachEven )) ↔ ((4 · (;10↑;18)) ≤ (4 · (;10↑;18)) ∧ ∀𝑛 ∈ Even ((4 < 𝑛 ∧ 𝑛 < (4 · (;10↑;18))) → 𝑛 ∈ GoldbachEven ))))
16	15	adantl 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 12297	. . . . 5 ⊢ ((4 · (;10↑;18)) ∈ ℕ → (4 · (;10↑;18)) ∈ ℝ)
18	17	leidd 11837	. . . 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 48644	. . . . . . . . . . 11 ⊢ (𝑛 ∈ Even → 𝑛 ∈ ℤ)
22	21	zred 12758	. . . . . . . . . 10 ⊢ (𝑛 ∈ Even → 𝑛 ∈ ℝ)
23		ltle 11355	. . . . . . . . . 10 ⊢ ((𝑛 ∈ ℝ ∧ (4 · (;10↑;18)) ∈ ℝ) → (𝑛 < (4 · (;10↑;18)) → 𝑛 ≤ (4 · (;10↑;18))))
24	22, 17, 23	syl2anr 609	. . . . . . . . 9 ⊢ (((4 · (;10↑;18)) ∈ ℕ ∧ 𝑛 ∈ Even ) → (𝑛 < (4 · (;10↑;18)) → 𝑛 ≤ (4 · (;10↑;18))))
25	24	a1d 26	. . . . . . . 8 ⊢ (((4 · (;10↑;18)) ∈ ℕ ∧ 𝑛 ∈ Even ) → (4 < 𝑛 → (𝑛 < (4 · (;10↑;18)) → 𝑛 ≤ (4 · (;10↑;18)))))
26	25	imp32 424	. . . . . . 7 ⊢ ((((4 · (;10↑;18)) ∈ ℕ ∧ 𝑛 ∈ Even ) ∧ (4 < 𝑛 ∧ 𝑛 < (4 · (;10↑;18)))) → 𝑛 ≤ (4 · (;10↑;18)))
27		ax-bgbltosilva 48824	. . . . . . 7 ⊢ ((𝑛 ∈ Even ∧ 4 < 𝑛 ∧ 𝑛 ≤ (4 · (;10↑;18))) → 𝑛 ∈ GoldbachEven )
28	19, 20, 26, 27	syl3anc 1398	. . . . . 6 ⊢ ((((4 · (;10↑;18)) ∈ ℕ ∧ 𝑛 ∈ Even ) ∧ (4 < 𝑛 ∧ 𝑛 < (4 · (;10↑;18)))) → 𝑛 ∈ GoldbachEven )
29	28	ex 418	. . . . 5 ⊢ (((4 · (;10↑;18)) ∈ ℕ ∧ 𝑛 ∈ Even ) → ((4 < 𝑛 ∧ 𝑛 < (4 · (;10↑;18))) → 𝑛 ∈ GoldbachEven ))
30	29	ralrimiva 3154	. . . 4 ⊢ ((4 · (;10↑;18)) ∈ ℕ → ∀𝑛 ∈ Even ((4 < 𝑛 ∧ 𝑛 < (4 · (;10↑;18))) → 𝑛 ∈ GoldbachEven ))
31	18, 30	jca 521	. . 3 ⊢ ((4 · (;10↑;18)) ∈ ℕ → ((4 · (;10↑;18)) ≤ (4 · (;10↑;18)) ∧ ∀𝑛 ∈ Even ((4 < 𝑛 ∧ 𝑛 < (4 · (;10↑;18))) → 𝑛 ∈ GoldbachEven )))
32	9, 16, 31	rspcedvd 3578	. 2 ⊢ ((4 · (;10↑;18)) ∈ ℕ → ∃𝑚 ∈ ℕ ((4 · (;10↑;18)) ≤ 𝑚 ∧ ∀𝑛 ∈ Even ((4 < 𝑛 ∧ 𝑛 < 𝑚) → 𝑛 ∈ GoldbachEven )))
33	8, 32	ax-mp 5	1 ⊢ ∃𝑚 ∈ ℕ ((4 · (;10↑;18)) ≤ 𝑚 ∧ ∀𝑛 ∈ Even ((4 < 𝑛 ∧ 𝑛 < 𝑚) → 𝑛 ∈ GoldbachEven ))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3076  ∃wrex 3086   class class class wbr 5103  (class class class)co 7409  ℝcr 11156  0cc0 11157  1c1 11158   · cmul 11162   < clt 11300   ≤ cle 11301  ℕcn 12290  4c4 12354  8c8 12358  ℕ₀cn0 12561  ;cdc 12769  ↑cexp 14158   Even ceven 48638   GoldbachEven cgbe 48759

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 2732  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7735  ax-cnex 11213  ax-resscn 11214  ax-1cn 11215  ax-icn 11216  ax-addcl 11217  ax-addrcl 11218  ax-mulcl 11219  ax-mulrcl 11220  ax-mulcom 11221  ax-addass 11222  ax-mulass 11223  ax-distr 11224  ax-i2m1 11225  ax-1ne0 11226  ax-1rid 11227  ax-rnegex 11228  ax-rrecex 11229  ax-cnre 11230  ax-pre-lttri 11231  ax-pre-lttrn 11232  ax-pre-ltadd 11233  ax-pre-mulgt0 11234  ax-bgbltosilva 48824

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  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-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5543  df-eprel 5548  df-po 5556  df-so 5557  df-fr 5601  df-we 5603  df-xp 5654  df-rel 5655  df-cnv 5656  df-co 5657  df-dm 5658  df-rn 5659  df-res 5660  df-ima 5661  df-pred 6294  df-ord 6355  df-on 6356  df-lim 6357  df-suc 6358  df-iota 6484  df-fun 6530  df-fn 6531  df-f 6532  df-f1 6533  df-fo 6534  df-f1o 6535  df-fv 6536  df-riota 7366  df-ov 7412  df-oprab 7413  df-mpo 7414  df-om 7862  df-2nd 7986  df-frecs 8278  df-wrecs 8309  df-recs 8358  df-rdg 8397  df-er 8696  df-en 8953  df-dom 8954  df-sdom 8955  df-pnf 11302  df-mnf 11303  df-xr 11304  df-ltxr 11305  df-le 11306  df-sub 11500  df-neg 11501  df-nn 12291  df-2 12360  df-3 12361  df-4 12362  df-5 12363  df-6 12364  df-7 12365  df-8 12366  df-9 12367  df-n0 12562  df-z 12649  df-dec 12770  df-uz 12921  df-seq 14099  df-exp 14159  df-even 48640

This theorem is used by: (None)