nnsum4primesodd - Mathbox for Alexander van der Vekens

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

Theorem nnsum4primesodd 47199

Description: If the (weak) ternary Goldbach conjecture is valid, then every odd integer greater than 5 is the sum of 3 primes. (Contributed by AV, 2-Jul-2020.)

**Assertion**
Ref	Expression
nnsum4primesodd	⊢ (∀𝑚 ∈ Odd (5 < 𝑚 → 𝑚 ∈ GoldbachOddW ) → ((𝑁 ∈ (ℤ_≥‘6) ∧ 𝑁 ∈ Odd ) → ∃𝑓 ∈ (ℙ ↑_m (1...3))𝑁 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘)))

Distinct variable group: 𝑓,𝑁,𝑘,𝑚

Proof of Theorem nnsum4primesodd Dummy variables 𝑝 𝑞 𝑟 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		breq2 5152	. . . . . 6 ⊢ (𝑚 = 𝑁 → (5 < 𝑚 ↔ 5 < 𝑁))
2		eleq1 2813	. . . . . 6 ⊢ (𝑚 = 𝑁 → (𝑚 ∈ GoldbachOddW ↔ 𝑁 ∈ GoldbachOddW ))
3	1, 2	imbi12d 343	. . . . 5 ⊢ (𝑚 = 𝑁 → ((5 < 𝑚 → 𝑚 ∈ GoldbachOddW ) ↔ (5 < 𝑁 → 𝑁 ∈ GoldbachOddW )))
4	3	rspcv 3603	. . . 4 ⊢ (𝑁 ∈ Odd → (∀𝑚 ∈ Odd (5 < 𝑚 → 𝑚 ∈ GoldbachOddW ) → (5 < 𝑁 → 𝑁 ∈ GoldbachOddW )))
5	4	adantl 480	. . 3 ⊢ ((𝑁 ∈ (ℤ_≥‘6) ∧ 𝑁 ∈ Odd ) → (∀𝑚 ∈ Odd (5 < 𝑚 → 𝑚 ∈ GoldbachOddW ) → (5 < 𝑁 → 𝑁 ∈ GoldbachOddW )))
6		eluz2 12858	. . . . . 6 ⊢ (𝑁 ∈ (ℤ_≥‘6) ↔ (6 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 6 ≤ 𝑁))
7		5lt6 12423	. . . . . . . . 9 ⊢ 5 < 6
8		5re 12329	. . . . . . . . . . 11 ⊢ 5 ∈ ℝ
9	8	a1i 11	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℤ → 5 ∈ ℝ)
10		6re 12332	. . . . . . . . . . 11 ⊢ 6 ∈ ℝ
11	10	a1i 11	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℤ → 6 ∈ ℝ)
12		zre 12592	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ)
13		ltletr 11336	. . . . . . . . . 10 ⊢ ((5 ∈ ℝ ∧ 6 ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((5 < 6 ∧ 6 ≤ 𝑁) → 5 < 𝑁))
14	9, 11, 12, 13	syl3anc 1368	. . . . . . . . 9 ⊢ (𝑁 ∈ ℤ → ((5 < 6 ∧ 6 ≤ 𝑁) → 5 < 𝑁))
15	7, 14	mpani 694	. . . . . . . 8 ⊢ (𝑁 ∈ ℤ → (6 ≤ 𝑁 → 5 < 𝑁))
16	15	imp 405	. . . . . . 7 ⊢ ((𝑁 ∈ ℤ ∧ 6 ≤ 𝑁) → 5 < 𝑁)
17	16	3adant1 1127	. . . . . 6 ⊢ ((6 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 6 ≤ 𝑁) → 5 < 𝑁)
18	6, 17	sylbi 216	. . . . 5 ⊢ (𝑁 ∈ (ℤ_≥‘6) → 5 < 𝑁)
19	18	adantr 479	. . . 4 ⊢ ((𝑁 ∈ (ℤ_≥‘6) ∧ 𝑁 ∈ Odd ) → 5 < 𝑁)
20		pm2.27 42	. . . 4 ⊢ (5 < 𝑁 → ((5 < 𝑁 → 𝑁 ∈ GoldbachOddW ) → 𝑁 ∈ GoldbachOddW ))
21	19, 20	syl 17	. . 3 ⊢ ((𝑁 ∈ (ℤ_≥‘6) ∧ 𝑁 ∈ Odd ) → ((5 < 𝑁 → 𝑁 ∈ GoldbachOddW ) → 𝑁 ∈ GoldbachOddW ))
22		isgbow 47155	. . . . 5 ⊢ (𝑁 ∈ GoldbachOddW ↔ (𝑁 ∈ Odd ∧ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ ∃𝑟 ∈ ℙ 𝑁 = ((𝑝 + 𝑞) + 𝑟)))
23		1ex 11240	. . . . . . . . . . . . . . 15 ⊢ 1 ∈ V
24		2ex 12319	. . . . . . . . . . . . . . 15 ⊢ 2 ∈ V
25		3ex 12324	. . . . . . . . . . . . . . 15 ⊢ 3 ∈ V
26		vex 3467	. . . . . . . . . . . . . . 15 ⊢ 𝑝 ∈ V
27		vex 3467	. . . . . . . . . . . . . . 15 ⊢ 𝑞 ∈ V
28		vex 3467	. . . . . . . . . . . . . . 15 ⊢ 𝑟 ∈ V
29		1ne2 12450	. . . . . . . . . . . . . . 15 ⊢ 1 ≠ 2
30		1re 11244	. . . . . . . . . . . . . . . 16 ⊢ 1 ∈ ℝ
31		1lt3 12415	. . . . . . . . . . . . . . . 16 ⊢ 1 < 3
32	30, 31	ltneii 11357	. . . . . . . . . . . . . . 15 ⊢ 1 ≠ 3
33		2re 12316	. . . . . . . . . . . . . . . 16 ⊢ 2 ∈ ℝ
34		2lt3 12414	. . . . . . . . . . . . . . . 16 ⊢ 2 < 3
35	33, 34	ltneii 11357	. . . . . . . . . . . . . . 15 ⊢ 2 ≠ 3
36	23, 24, 25, 26, 27, 28, 29, 32, 35	ftp 7164	. . . . . . . . . . . . . 14 ⊢ {⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}:{1, 2, 3}⟶{𝑝, 𝑞, 𝑟}
37	36	a1i 11	. . . . . . . . . . . . 13 ⊢ (((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) ∧ 𝑟 ∈ ℙ) → {⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}:{1, 2, 3}⟶{𝑝, 𝑞, 𝑟})
38		1p2e3 12385	. . . . . . . . . . . . . . . . 17 ⊢ (1 + 2) = 3
39	38	eqcomi 2734	. . . . . . . . . . . . . . . 16 ⊢ 3 = (1 + 2)
40	39	oveq2i 7428	. . . . . . . . . . . . . . 15 ⊢ (1...3) = (1...(1 + 2))
41		1z 12622	. . . . . . . . . . . . . . . 16 ⊢ 1 ∈ ℤ
42		fztp 13589	. . . . . . . . . . . . . . . 16 ⊢ (1 ∈ ℤ → (1...(1 + 2)) = {1, (1 + 1), (1 + 2)})
43	41, 42	ax-mp 5	. . . . . . . . . . . . . . 15 ⊢ (1...(1 + 2)) = {1, (1 + 1), (1 + 2)}
44		eqid 2725	. . . . . . . . . . . . . . . 16 ⊢ 1 = 1
45		id 22	. . . . . . . . . . . . . . . . 17 ⊢ (1 = 1 → 1 = 1)
46		1p1e2 12367	. . . . . . . . . . . . . . . . . 18 ⊢ (1 + 1) = 2
47	46	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ (1 = 1 → (1 + 1) = 2)
48	38	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ (1 = 1 → (1 + 2) = 3)
49	45, 47, 48	tpeq123d 4753	. . . . . . . . . . . . . . . 16 ⊢ (1 = 1 → {1, (1 + 1), (1 + 2)} = {1, 2, 3})
50	44, 49	ax-mp 5	. . . . . . . . . . . . . . 15 ⊢ {1, (1 + 1), (1 + 2)} = {1, 2, 3}
51	40, 43, 50	3eqtri 2757	. . . . . . . . . . . . . 14 ⊢ (1...3) = {1, 2, 3}
52	51	feq2i 6713	. . . . . . . . . . . . 13 ⊢ ({⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}:(1...3)⟶{𝑝, 𝑞, 𝑟} ↔ {⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}:{1, 2, 3}⟶{𝑝, 𝑞, 𝑟})
53	37, 52	sylibr 233	. . . . . . . . . . . 12 ⊢ (((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) ∧ 𝑟 ∈ ℙ) → {⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}:(1...3)⟶{𝑝, 𝑞, 𝑟})
54		df-3an 1086	. . . . . . . . . . . . 13 ⊢ ((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ ∧ 𝑟 ∈ ℙ) ↔ ((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) ∧ 𝑟 ∈ ℙ))
55	26, 27, 28	tpss 4839	. . . . . . . . . . . . 13 ⊢ ((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ ∧ 𝑟 ∈ ℙ) ↔ {𝑝, 𝑞, 𝑟} ⊆ ℙ)
56	54, 55	sylbb1 236	. . . . . . . . . . . 12 ⊢ (((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) ∧ 𝑟 ∈ ℙ) → {𝑝, 𝑞, 𝑟} ⊆ ℙ)
57	53, 56	fssd 6738	. . . . . . . . . . 11 ⊢ (((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) ∧ 𝑟 ∈ ℙ) → {⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}:(1...3)⟶ℙ)
58		prmex 16647	. . . . . . . . . . . . 13 ⊢ ℙ ∈ V
59		ovex 7450	. . . . . . . . . . . . 13 ⊢ (1...3) ∈ V
60	58, 59	pm3.2i 469	. . . . . . . . . . . 12 ⊢ (ℙ ∈ V ∧ (1...3) ∈ V)
61		elmapg 8856	. . . . . . . . . . . 12 ⊢ ((ℙ ∈ V ∧ (1...3) ∈ V) → ({⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩} ∈ (ℙ ↑_m (1...3)) ↔ {⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}:(1...3)⟶ℙ))
62	60, 61	mp1i 13	. . . . . . . . . . 11 ⊢ (((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) ∧ 𝑟 ∈ ℙ) → ({⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩} ∈ (ℙ ↑_m (1...3)) ↔ {⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}:(1...3)⟶ℙ))
63	57, 62	mpbird 256	. . . . . . . . . 10 ⊢ (((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) ∧ 𝑟 ∈ ℙ) → {⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩} ∈ (ℙ ↑_m (1...3)))
64		fveq1 6893	. . . . . . . . . . . . 13 ⊢ (𝑓 = {⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩} → (𝑓‘𝑘) = ({⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}‘𝑘))
65	64	sumeq2sdv 15682	. . . . . . . . . . . 12 ⊢ (𝑓 = {⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩} → Σ𝑘 ∈ (1...3)(𝑓‘𝑘) = Σ𝑘 ∈ (1...3)({⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}‘𝑘))
66	65	eqeq2d 2736	. . . . . . . . . . 11 ⊢ (𝑓 = {⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩} → (((𝑝 + 𝑞) + 𝑟) = Σ𝑘 ∈ (1...3)(𝑓‘𝑘) ↔ ((𝑝 + 𝑞) + 𝑟) = Σ𝑘 ∈ (1...3)({⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}‘𝑘)))
67	66	adantl 480	. . . . . . . . . 10 ⊢ ((((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) ∧ 𝑟 ∈ ℙ) ∧ 𝑓 = {⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}) → (((𝑝 + 𝑞) + 𝑟) = Σ𝑘 ∈ (1...3)(𝑓‘𝑘) ↔ ((𝑝 + 𝑞) + 𝑟) = Σ𝑘 ∈ (1...3)({⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}‘𝑘)))
68	51	a1i 11	. . . . . . . . . . . 12 ⊢ (((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) ∧ 𝑟 ∈ ℙ) → (1...3) = {1, 2, 3})
69	68	sumeq1d 15679	. . . . . . . . . . 11 ⊢ (((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) ∧ 𝑟 ∈ ℙ) → Σ𝑘 ∈ (1...3)({⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}‘𝑘) = Σ𝑘 ∈ {1, 2, 3} ({⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}‘𝑘))
70		fveq2 6894	. . . . . . . . . . . . 13 ⊢ (𝑘 = 1 → ({⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}‘𝑘) = ({⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}‘1))
71	23, 26	fvtp1 7205	. . . . . . . . . . . . . 14 ⊢ ((1 ≠ 2 ∧ 1 ≠ 3) → ({⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}‘1) = 𝑝)
72	29, 32, 71	mp2an 690	. . . . . . . . . . . . 13 ⊢ ({⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}‘1) = 𝑝
73	70, 72	eqtrdi 2781	. . . . . . . . . . . 12 ⊢ (𝑘 = 1 → ({⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}‘𝑘) = 𝑝)
74		fveq2 6894	. . . . . . . . . . . . 13 ⊢ (𝑘 = 2 → ({⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}‘𝑘) = ({⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}‘2))
75	24, 27	fvtp2 7206	. . . . . . . . . . . . . 14 ⊢ ((1 ≠ 2 ∧ 2 ≠ 3) → ({⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}‘2) = 𝑞)
76	29, 35, 75	mp2an 690	. . . . . . . . . . . . 13 ⊢ ({⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}‘2) = 𝑞
77	74, 76	eqtrdi 2781	. . . . . . . . . . . 12 ⊢ (𝑘 = 2 → ({⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}‘𝑘) = 𝑞)
78		fveq2 6894	. . . . . . . . . . . . 13 ⊢ (𝑘 = 3 → ({⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}‘𝑘) = ({⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}‘3))
79	25, 28	fvtp3 7207	. . . . . . . . . . . . . 14 ⊢ ((1 ≠ 3 ∧ 2 ≠ 3) → ({⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}‘3) = 𝑟)
80	32, 35, 79	mp2an 690	. . . . . . . . . . . . 13 ⊢ ({⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}‘3) = 𝑟
81	78, 80	eqtrdi 2781	. . . . . . . . . . . 12 ⊢ (𝑘 = 3 → ({⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}‘𝑘) = 𝑟)
82		prmz 16645	. . . . . . . . . . . . . . 15 ⊢ (𝑝 ∈ ℙ → 𝑝 ∈ ℤ)
83	82	zcnd 12697	. . . . . . . . . . . . . 14 ⊢ (𝑝 ∈ ℙ → 𝑝 ∈ ℂ)
84		prmz 16645	. . . . . . . . . . . . . . 15 ⊢ (𝑞 ∈ ℙ → 𝑞 ∈ ℤ)
85	84	zcnd 12697	. . . . . . . . . . . . . 14 ⊢ (𝑞 ∈ ℙ → 𝑞 ∈ ℂ)
86		prmz 16645	. . . . . . . . . . . . . . 15 ⊢ (𝑟 ∈ ℙ → 𝑟 ∈ ℤ)
87	86	zcnd 12697	. . . . . . . . . . . . . 14 ⊢ (𝑟 ∈ ℙ → 𝑟 ∈ ℂ)
88	83, 85, 87	3anim123i 1148	. . . . . . . . . . . . 13 ⊢ ((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ ∧ 𝑟 ∈ ℙ) → (𝑝 ∈ ℂ ∧ 𝑞 ∈ ℂ ∧ 𝑟 ∈ ℂ))
89	88	3expa 1115	. . . . . . . . . . . 12 ⊢ (((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) ∧ 𝑟 ∈ ℙ) → (𝑝 ∈ ℂ ∧ 𝑞 ∈ ℂ ∧ 𝑟 ∈ ℂ))
90		2z 12624	. . . . . . . . . . . . . 14 ⊢ 2 ∈ ℤ
91		3z 12625	. . . . . . . . . . . . . 14 ⊢ 3 ∈ ℤ
92	41, 90, 91	3pm3.2i 1336	. . . . . . . . . . . . 13 ⊢ (1 ∈ ℤ ∧ 2 ∈ ℤ ∧ 3 ∈ ℤ)
93	92	a1i 11	. . . . . . . . . . . 12 ⊢ (((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) ∧ 𝑟 ∈ ℙ) → (1 ∈ ℤ ∧ 2 ∈ ℤ ∧ 3 ∈ ℤ))
94	29	a1i 11	. . . . . . . . . . . 12 ⊢ (((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) ∧ 𝑟 ∈ ℙ) → 1 ≠ 2)
95	32	a1i 11	. . . . . . . . . . . 12 ⊢ (((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) ∧ 𝑟 ∈ ℙ) → 1 ≠ 3)
96	35	a1i 11	. . . . . . . . . . . 12 ⊢ (((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) ∧ 𝑟 ∈ ℙ) → 2 ≠ 3)
97	73, 77, 81, 89, 93, 94, 95, 96	sumtp 15727	. . . . . . . . . . 11 ⊢ (((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) ∧ 𝑟 ∈ ℙ) → Σ𝑘 ∈ {1, 2, 3} ({⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}‘𝑘) = ((𝑝 + 𝑞) + 𝑟))
98	69, 97	eqtr2d 2766	. . . . . . . . . 10 ⊢ (((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) ∧ 𝑟 ∈ ℙ) → ((𝑝 + 𝑞) + 𝑟) = Σ𝑘 ∈ (1...3)({⟨1, 𝑝⟩, ⟨2, 𝑞⟩, ⟨3, 𝑟⟩}‘𝑘))
99	63, 67, 98	rspcedvd 3609	. . . . . . . . 9 ⊢ (((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) ∧ 𝑟 ∈ ℙ) → ∃𝑓 ∈ (ℙ ↑_m (1...3))((𝑝 + 𝑞) + 𝑟) = Σ𝑘 ∈ (1...3)(𝑓‘𝑘))
100		eqeq1 2729	. . . . . . . . . 10 ⊢ (𝑁 = ((𝑝 + 𝑞) + 𝑟) → (𝑁 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘) ↔ ((𝑝 + 𝑞) + 𝑟) = Σ𝑘 ∈ (1...3)(𝑓‘𝑘)))
101	100	rexbidv 3169	. . . . . . . . 9 ⊢ (𝑁 = ((𝑝 + 𝑞) + 𝑟) → (∃𝑓 ∈ (ℙ ↑_m (1...3))𝑁 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘) ↔ ∃𝑓 ∈ (ℙ ↑_m (1...3))((𝑝 + 𝑞) + 𝑟) = Σ𝑘 ∈ (1...3)(𝑓‘𝑘)))
102	99, 101	syl5ibrcom 246	. . . . . . . 8 ⊢ (((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) ∧ 𝑟 ∈ ℙ) → (𝑁 = ((𝑝 + 𝑞) + 𝑟) → ∃𝑓 ∈ (ℙ ↑_m (1...3))𝑁 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘)))
103	102	rexlimdva 3145	. . . . . . 7 ⊢ ((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) → (∃𝑟 ∈ ℙ 𝑁 = ((𝑝 + 𝑞) + 𝑟) → ∃𝑓 ∈ (ℙ ↑_m (1...3))𝑁 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘)))
104	103	rexlimivv 3190	. . . . . 6 ⊢ (∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ ∃𝑟 ∈ ℙ 𝑁 = ((𝑝 + 𝑞) + 𝑟) → ∃𝑓 ∈ (ℙ ↑_m (1...3))𝑁 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘))
105	104	adantl 480	. . . . 5 ⊢ ((𝑁 ∈ Odd ∧ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ ∃𝑟 ∈ ℙ 𝑁 = ((𝑝 + 𝑞) + 𝑟)) → ∃𝑓 ∈ (ℙ ↑_m (1...3))𝑁 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘))
106	22, 105	sylbi 216	. . . 4 ⊢ (𝑁 ∈ GoldbachOddW → ∃𝑓 ∈ (ℙ ↑_m (1...3))𝑁 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘))
107	106	a1i 11	. . 3 ⊢ ((𝑁 ∈ (ℤ_≥‘6) ∧ 𝑁 ∈ Odd ) → (𝑁 ∈ GoldbachOddW → ∃𝑓 ∈ (ℙ ↑_m (1...3))𝑁 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘)))
108	5, 21, 107	3syld 60	. 2 ⊢ ((𝑁 ∈ (ℤ_≥‘6) ∧ 𝑁 ∈ Odd ) → (∀𝑚 ∈ Odd (5 < 𝑚 → 𝑚 ∈ GoldbachOddW ) → ∃𝑓 ∈ (ℙ ↑_m (1...3))𝑁 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘)))
109	108	com12 32	1 ⊢ (∀𝑚 ∈ Odd (5 < 𝑚 → 𝑚 ∈ GoldbachOddW ) → ((𝑁 ∈ (ℤ_≥‘6) ∧ 𝑁 ∈ Odd ) → ∃𝑓 ∈ (ℙ ↑_m (1...3))𝑁 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 ≠ wne 2930 ∀wral 3051 ∃wrex 3060 Vcvv 3463 ⊆ wss 3945 {ctp 4633 ⟨cop 4635 class class class wbr 5148 ⟶wf 6543 ‘cfv 6547 (class class class)co 7417 ↑_m cmap 8843 ℂcc 11136 ℝcr 11137 1c1 11139 + caddc 11141 < clt 11278 ≤ cle 11279 2c2 12297 3c3 12298 5c5 12300 6c6 12301 ℤcz 12588 ℤ_≥cuz 12852 ...cfz 13516 Σcsu 15664 ℙcprime 16641 Odd codd 47028 GoldbachOddW cgbow 47149

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5364 ax-pr 5428 ax-un 7739 ax-inf2 9664 ax-cnex 11194 ax-resscn 11195 ax-1cn 11196 ax-icn 11197 ax-addcl 11198 ax-addrcl 11199 ax-mulcl 11200 ax-mulrcl 11201 ax-mulcom 11202 ax-addass 11203 ax-mulass 11204 ax-distr 11205 ax-i2m1 11206 ax-1ne0 11207 ax-1rid 11208 ax-rnegex 11209 ax-rrecex 11210 ax-cnre 11211 ax-pre-lttri 11212 ax-pre-lttrn 11213 ax-pre-ltadd 11214 ax-pre-mulgt0 11215 ax-pre-sup 11216

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3364 df-reu 3365 df-rab 3420 df-v 3465 df-sbc 3775 df-csb 3891 df-dif 3948 df-un 3950 df-in 3952 df-ss 3962 df-pss 3965 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-tp 4634 df-op 4636 df-uni 4909 df-int 4950 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-se 5633 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6305 df-ord 6372 df-on 6373 df-lim 6374 df-suc 6375 df-iota 6499 df-fun 6549 df-fn 6550 df-f 6551 df-f1 6552 df-fo 6553 df-f1o 6554 df-fv 6555 df-isom 6556 df-riota 7373 df-ov 7420 df-oprab 7421 df-mpo 7422 df-om 7870 df-1st 7992 df-2nd 7993 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-1o 8485 df-er 8723 df-map 8845 df-en 8963 df-dom 8964 df-sdom 8965 df-fin 8966 df-sup 9465 df-oi 9533 df-card 9962 df-pnf 11280 df-mnf 11281 df-xr 11282 df-ltxr 11283 df-le 11284 df-sub 11476 df-neg 11477 df-div 11902 df-nn 12243 df-2 12305 df-3 12306 df-4 12307 df-5 12308 df-6 12309 df-n0 12503 df-z 12589 df-uz 12853 df-rp 13007 df-fz 13517 df-fzo 13660 df-seq 13999 df-exp 14059 df-hash 14322 df-cj 15078 df-re 15079 df-im 15080 df-sqrt 15214 df-abs 15215 df-clim 15464 df-sum 15665 df-prm 16642 df-gbow 47152

This theorem is referenced by: nnsum4primeseven 47203 wtgoldbnnsum4prm 47205 bgoldbnnsum3prm 47207

W3C validator