Theorem bgoldbnnsum3prm 42699

Description: If the binary Goldbach conjecture is valid, then every integer greater than 1 is the sum of at most 3 primes, showing that Schnirelmann's constant would be equal to 3. (Contributed by AV, 2-Aug-2020.)

Assertion

Ref	Expression
bgoldbnnsum3prm	⊢ (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → ∀𝑛 ∈ (ℤ≥‘2)∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑𝑚 (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)))

Distinct variable group:   𝑓,𝑘,𝑚,𝑑,𝑛

Proof of Theorem bgoldbnnsum3prm

Dummy variable 𝑜 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		2z 11761	. . . . . . 7 ⊢ 2 ∈ ℤ
2		9nn 11479	. . . . . . . 8 ⊢ 9 ∈ ℕ
3	2	nnzi 11753	. . . . . . 7 ⊢ 9 ∈ ℤ
4		2re 11449	. . . . . . . 8 ⊢ 2 ∈ ℝ
5		9re 11480	. . . . . . . 8 ⊢ 9 ∈ ℝ
6		2lt9 11587	. . . . . . . 8 ⊢ 2 < 9
7	4, 5, 6	ltleii 10499	. . . . . . 7 ⊢ 2 ≤ 9
8		eluz2 11998	. . . . . . 7 ⊢ (9 ∈ (ℤ≥‘2) ↔ (2 ∈ ℤ ∧ 9 ∈ ℤ ∧ 2 ≤ 9))
9	1, 3, 7, 8	mpbir3an 1398	. . . . . 6 ⊢ 9 ∈ (ℤ≥‘2)
10		fzouzsplit 12822	. . . . . . 7 ⊢ (9 ∈ (ℤ≥‘2) → (ℤ≥‘2) = ((2..^9) ∪ (ℤ≥‘9)))
11	10	eleq2d 2844	. . . . . 6 ⊢ (9 ∈ (ℤ≥‘2) → (𝑛 ∈ (ℤ≥‘2) ↔ 𝑛 ∈ ((2..^9) ∪ (ℤ≥‘9))))
12	9, 11	ax-mp 5	. . . . 5 ⊢ (𝑛 ∈ (ℤ≥‘2) ↔ 𝑛 ∈ ((2..^9) ∪ (ℤ≥‘9)))
13		elun 3975	. . . . 5 ⊢ (𝑛 ∈ ((2..^9) ∪ (ℤ≥‘9)) ↔ (𝑛 ∈ (2..^9) ∨ 𝑛 ∈ (ℤ≥‘9)))
14	12, 13	bitri 267	. . . 4 ⊢ (𝑛 ∈ (ℤ≥‘2) ↔ (𝑛 ∈ (2..^9) ∨ 𝑛 ∈ (ℤ≥‘9)))
15		elfzo2 12792	. . . . . . . 8 ⊢ (𝑛 ∈ (2..^9) ↔ (𝑛 ∈ (ℤ≥‘2) ∧ 9 ∈ ℤ ∧ 𝑛 < 9))
16		simp1 1127	. . . . . . . . 9 ⊢ ((𝑛 ∈ (ℤ≥‘2) ∧ 9 ∈ ℤ ∧ 𝑛 < 9) → 𝑛 ∈ (ℤ≥‘2))
17		df-9 11445	. . . . . . . . . . . 12 ⊢ 9 = (8 + 1)
18	17	breq2i 4894	. . . . . . . . . . 11 ⊢ (𝑛 < 9 ↔ 𝑛 < (8 + 1))
19		eluz2nn 12032	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ (ℤ≥‘2) → 𝑛 ∈ ℕ)
20		8nn 11475	. . . . . . . . . . . . . . 15 ⊢ 8 ∈ ℕ
21	19, 20	jctir 516	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ (ℤ≥‘2) → (𝑛 ∈ ℕ ∧ 8 ∈ ℕ))
22	21	adantr 474	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ (ℤ≥‘2) ∧ 9 ∈ ℤ) → (𝑛 ∈ ℕ ∧ 8 ∈ ℕ))
23		nnleltp1 11784	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ ℕ ∧ 8 ∈ ℕ) → (𝑛 ≤ 8 ↔ 𝑛 < (8 + 1)))
24	22, 23	syl 17	. . . . . . . . . . . 12 ⊢ ((𝑛 ∈ (ℤ≥‘2) ∧ 9 ∈ ℤ) → (𝑛 ≤ 8 ↔ 𝑛 < (8 + 1)))
25	24	biimprd 240	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ (ℤ≥‘2) ∧ 9 ∈ ℤ) → (𝑛 < (8 + 1) → 𝑛 ≤ 8))
26	18, 25	syl5bi 234	. . . . . . . . . 10 ⊢ ((𝑛 ∈ (ℤ≥‘2) ∧ 9 ∈ ℤ) → (𝑛 < 9 → 𝑛 ≤ 8))
27	26	3impia 1106	. . . . . . . . 9 ⊢ ((𝑛 ∈ (ℤ≥‘2) ∧ 9 ∈ ℤ ∧ 𝑛 < 9) → 𝑛 ≤ 8)
28	16, 27	jca 507	. . . . . . . 8 ⊢ ((𝑛 ∈ (ℤ≥‘2) ∧ 9 ∈ ℤ ∧ 𝑛 < 9) → (𝑛 ∈ (ℤ≥‘2) ∧ 𝑛 ≤ 8))
29	15, 28	sylbi 209	. . . . . . 7 ⊢ (𝑛 ∈ (2..^9) → (𝑛 ∈ (ℤ≥‘2) ∧ 𝑛 ≤ 8))
30		nnsum3primesle9 42689	. . . . . . 7 ⊢ ((𝑛 ∈ (ℤ≥‘2) ∧ 𝑛 ≤ 8) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑𝑚 (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)))
31	29, 30	syl 17	. . . . . 6 ⊢ (𝑛 ∈ (2..^9) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑𝑚 (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)))
32	31	a1d 25	. . . . 5 ⊢ (𝑛 ∈ (2..^9) → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑𝑚 (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘))))
33		breq2 4890	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑛 → (4 < 𝑚 ↔ 4 < 𝑛))
34		eleq1w 2841	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑛 → (𝑚 ∈ GoldbachEven ↔ 𝑛 ∈ GoldbachEven ))
35	33, 34	imbi12d 336	. . . . . . . . . 10 ⊢ (𝑚 = 𝑛 → ((4 < 𝑚 → 𝑚 ∈ GoldbachEven ) ↔ (4 < 𝑛 → 𝑛 ∈ GoldbachEven )))
36	35	rspcv 3506	. . . . . . . . 9 ⊢ (𝑛 ∈ Even → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → (4 < 𝑛 → 𝑛 ∈ GoldbachEven )))
37		4re 11460	. . . . . . . . . . . . . . 15 ⊢ 4 ∈ ℝ
38	37	a1i 11	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ (ℤ≥‘9) → 4 ∈ ℝ)
39	5	a1i 11	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ (ℤ≥‘9) → 9 ∈ ℝ)
40		eluzelre 12003	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ (ℤ≥‘9) → 𝑛 ∈ ℝ)
41	38, 39, 40	3jca 1119	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ (ℤ≥‘9) → (4 ∈ ℝ ∧ 9 ∈ ℝ ∧ 𝑛 ∈ ℝ))
42	41	adantl 475	. . . . . . . . . . . 12 ⊢ ((𝑛 ∈ Even ∧ 𝑛 ∈ (ℤ≥‘9)) → (4 ∈ ℝ ∧ 9 ∈ ℝ ∧ 𝑛 ∈ ℝ))
43		eluzle 12005	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ (ℤ≥‘9) → 9 ≤ 𝑛)
44	43	adantl 475	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ Even ∧ 𝑛 ∈ (ℤ≥‘9)) → 9 ≤ 𝑛)
45		4lt9 11585	. . . . . . . . . . . . 13 ⊢ 4 < 9
46	44, 45	jctil 515	. . . . . . . . . . . 12 ⊢ ((𝑛 ∈ Even ∧ 𝑛 ∈ (ℤ≥‘9)) → (4 < 9 ∧ 9 ≤ 𝑛))
47		ltletr 10468	. . . . . . . . . . . 12 ⊢ ((4 ∈ ℝ ∧ 9 ∈ ℝ ∧ 𝑛 ∈ ℝ) → ((4 < 9 ∧ 9 ≤ 𝑛) → 4 < 𝑛))
48	42, 46, 47	sylc 65	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ Even ∧ 𝑛 ∈ (ℤ≥‘9)) → 4 < 𝑛)
49		pm2.27 42	. . . . . . . . . . 11 ⊢ (4 < 𝑛 → ((4 < 𝑛 → 𝑛 ∈ GoldbachEven ) → 𝑛 ∈ GoldbachEven ))
50	48, 49	syl 17	. . . . . . . . . 10 ⊢ ((𝑛 ∈ Even ∧ 𝑛 ∈ (ℤ≥‘9)) → ((4 < 𝑛 → 𝑛 ∈ GoldbachEven ) → 𝑛 ∈ GoldbachEven ))
51	50	ex 403	. . . . . . . . 9 ⊢ (𝑛 ∈ Even → (𝑛 ∈ (ℤ≥‘9) → ((4 < 𝑛 → 𝑛 ∈ GoldbachEven ) → 𝑛 ∈ GoldbachEven )))
52	36, 51	syl5d 73	. . . . . . . 8 ⊢ (𝑛 ∈ Even → (𝑛 ∈ (ℤ≥‘9) → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → 𝑛 ∈ GoldbachEven )))
53	52	impcom 398	. . . . . . 7 ⊢ ((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Even ) → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → 𝑛 ∈ GoldbachEven ))
54		nnsum3primesgbe 42687	. . . . . . 7 ⊢ (𝑛 ∈ GoldbachEven → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑𝑚 (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)))
55	53, 54	syl6 35	. . . . . 6 ⊢ ((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Even ) → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑𝑚 (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘))))
56		3nn 11454	. . . . . . . . . 10 ⊢ 3 ∈ ℕ
57	56	a1i 11	. . . . . . . . 9 ⊢ (((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW )) → 3 ∈ ℕ)
58		oveq2 6930	. . . . . . . . . . . 12 ⊢ (𝑑 = 3 → (1...𝑑) = (1...3))
59	58	oveq2d 6938	. . . . . . . . . . 11 ⊢ (𝑑 = 3 → (ℙ ↑𝑚 (1...𝑑)) = (ℙ ↑𝑚 (1...3)))
60		breq1 4889	. . . . . . . . . . . 12 ⊢ (𝑑 = 3 → (𝑑 ≤ 3 ↔ 3 ≤ 3))
61	58	sumeq1d 14839	. . . . . . . . . . . . 13 ⊢ (𝑑 = 3 → Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘) = Σ𝑘 ∈ (1...3)(𝑓‘𝑘))
62	61	eqeq2d 2787	. . . . . . . . . . . 12 ⊢ (𝑑 = 3 → (𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘) ↔ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘)))
63	60, 62	anbi12d 624	. . . . . . . . . . 11 ⊢ (𝑑 = 3 → ((𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)) ↔ (3 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘))))
64	59, 63	rexeqbidv 3326	. . . . . . . . . 10 ⊢ (𝑑 = 3 → (∃𝑓 ∈ (ℙ ↑𝑚 (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)) ↔ ∃𝑓 ∈ (ℙ ↑𝑚 (1...3))(3 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘))))
65	64	adantl 475	. . . . . . . . 9 ⊢ ((((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW )) ∧ 𝑑 = 3) → (∃𝑓 ∈ (ℙ ↑𝑚 (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)) ↔ ∃𝑓 ∈ (ℙ ↑𝑚 (1...3))(3 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘))))
66		3re 11455	. . . . . . . . . . . 12 ⊢ 3 ∈ ℝ
67	66	leidi 10909	. . . . . . . . . . 11 ⊢ 3 ≤ 3
68	67	a1i 11	. . . . . . . . . 10 ⊢ (((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW )) → 3 ≤ 3)
69		6nn 11467	. . . . . . . . . . . . . 14 ⊢ 6 ∈ ℕ
70	69	nnzi 11753	. . . . . . . . . . . . 13 ⊢ 6 ∈ ℤ
71		6re 11468	. . . . . . . . . . . . . 14 ⊢ 6 ∈ ℝ
72		6lt9 11583	. . . . . . . . . . . . . 14 ⊢ 6 < 9
73	71, 5, 72	ltleii 10499	. . . . . . . . . . . . 13 ⊢ 6 ≤ 9
74		eluzuzle 12001	. . . . . . . . . . . . 13 ⊢ ((6 ∈ ℤ ∧ 6 ≤ 9) → (𝑛 ∈ (ℤ≥‘9) → 𝑛 ∈ (ℤ≥‘6)))
75	70, 73, 74	mp2an 682	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ (ℤ≥‘9) → 𝑛 ∈ (ℤ≥‘6))
76	75	anim1i 608	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) → (𝑛 ∈ (ℤ≥‘6) ∧ 𝑛 ∈ Odd ))
77		nnsum4primesodd 42691	. . . . . . . . . . 11 ⊢ (∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW ) → ((𝑛 ∈ (ℤ≥‘6) ∧ 𝑛 ∈ Odd ) → ∃𝑓 ∈ (ℙ ↑𝑚 (1...3))𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘)))
78	76, 77	mpan9 502	. . . . . . . . . 10 ⊢ (((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW )) → ∃𝑓 ∈ (ℙ ↑𝑚 (1...3))𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘))
79		r19.42v 3277	. . . . . . . . . 10 ⊢ (∃𝑓 ∈ (ℙ ↑𝑚 (1...3))(3 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘)) ↔ (3 ≤ 3 ∧ ∃𝑓 ∈ (ℙ ↑𝑚 (1...3))𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘)))
80	68, 78, 79	sylanbrc 578	. . . . . . . . 9 ⊢ (((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW )) → ∃𝑓 ∈ (ℙ ↑𝑚 (1...3))(3 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘)))
81	57, 65, 80	rspcedvd 3517	. . . . . . . 8 ⊢ (((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW )) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑𝑚 (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)))
82	81	expcom 404	. . . . . . 7 ⊢ (∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW ) → ((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑𝑚 (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘))))
83		sbgoldbwt 42672	. . . . . . 7 ⊢ (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → ∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW ))
84	82, 83	syl11 33	. . . . . 6 ⊢ ((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑𝑚 (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘))))
85		eluzelz 12002	. . . . . . 7 ⊢ (𝑛 ∈ (ℤ≥‘9) → 𝑛 ∈ ℤ)
86		zeoALTV 42588	. . . . . . 7 ⊢ (𝑛 ∈ ℤ → (𝑛 ∈ Even ∨ 𝑛 ∈ Odd ))
87	85, 86	syl 17	. . . . . 6 ⊢ (𝑛 ∈ (ℤ≥‘9) → (𝑛 ∈ Even ∨ 𝑛 ∈ Odd ))
88	55, 84, 87	mpjaodan 944	. . . . 5 ⊢ (𝑛 ∈ (ℤ≥‘9) → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑𝑚 (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘))))
89	32, 88	jaoi 846	. . . 4 ⊢ ((𝑛 ∈ (2..^9) ∨ 𝑛 ∈ (ℤ≥‘9)) → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑𝑚 (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘))))
90	14, 89	sylbi 209	. . 3 ⊢ (𝑛 ∈ (ℤ≥‘2) → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑𝑚 (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘))))
91	90	impcom 398	. 2 ⊢ ((∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) ∧ 𝑛 ∈ (ℤ≥‘2)) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑𝑚 (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)))
92	91	ralrimiva 3147	1 ⊢ (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → ∀𝑛 ∈ (ℤ≥‘2)∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑𝑚 (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)))

Syntax hints:   → wi 4   ↔ wb 198   ∧ wa 386   ∨ wo 836   ∧ w3a 1071   = wceq 1601   ∈ wcel 2106  ∀wral 3089  ∃wrex 3090   ∪ cun 3789   class class class wbr 4886  ‘cfv 6135  (class class class)co 6922   ↑_𝑚 cmap 8140  ℝcr 10271  1c1 10273   + caddc 10275   < clt 10411   ≤ cle 10412  ℕcn 11374  2c2 11430  3c3 11431  4c4 11432  5c5 11433  6c6 11434  8c8 11436  9c9 11437  ℤcz 11728  ℤ_≥cuz 11992  ...cfz 12643  ..^cfzo 12784  Σcsu 14824  ℙcprime 15790   Even ceven 42544   Odd codd 42545   GoldbachEven cgbe 42640   GoldbachOddW cgbow 42641

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1839  ax-4 1853  ax-5 1953  ax-6 2021  ax-7 2054  ax-8 2108  ax-9 2115  ax-10 2134  ax-11 2149  ax-12 2162  ax-13 2333  ax-ext 2753  ax-rep 5006  ax-sep 5017  ax-nul 5025  ax-pow 5077  ax-pr 5138  ax-un 7226  ax-inf2 8835  ax-cnex 10328  ax-resscn 10329  ax-1cn 10330  ax-icn 10331  ax-addcl 10332  ax-addrcl 10333  ax-mulcl 10334  ax-mulrcl 10335  ax-mulcom 10336  ax-addass 10337  ax-mulass 10338  ax-distr 10339  ax-i2m1 10340  ax-1ne0 10341  ax-1rid 10342  ax-rnegex 10343  ax-rrecex 10344  ax-cnre 10345  ax-pre-lttri 10346  ax-pre-lttrn 10347  ax-pre-ltadd 10348  ax-pre-mulgt0 10349  ax-pre-sup 10350

This theorem depends on definitions:  df-bi 199  df-an 387  df-or 837  df-3or 1072  df-3an 1073  df-tru 1605  df-fal 1615  df-ex 1824  df-nf 1828  df-sb 2012  df-mo 2550  df-eu 2586  df-clab 2763  df-cleq 2769  df-clel 2773  df-nfc 2920  df-ne 2969  df-nel 3075  df-ral 3094  df-rex 3095  df-reu 3096  df-rmo 3097  df-rab 3098  df-v 3399  df-sbc 3652  df-csb 3751  df-dif 3794  df-un 3796  df-in 3798  df-ss 3805  df-pss 3807  df-nul 4141  df-if 4307  df-pw 4380  df-sn 4398  df-pr 4400  df-tp 4402  df-op 4404  df-uni 4672  df-int 4711  df-iun 4755  df-br 4887  df-opab 4949  df-mpt 4966  df-tr 4988  df-id 5261  df-eprel 5266  df-po 5274  df-so 5275  df-fr 5314  df-se 5315  df-we 5316  df-xp 5361  df-rel 5362  df-cnv 5363  df-co 5364  df-dm 5365  df-rn 5366  df-res 5367  df-ima 5368  df-pred 5933  df-ord 5979  df-on 5980  df-lim 5981  df-suc 5982  df-iota 6099  df-fun 6137  df-fn 6138  df-f 6139  df-f1 6140  df-fo 6141  df-f1o 6142  df-fv 6143  df-isom 6144  df-riota 6883  df-ov 6925  df-oprab 6926  df-mpt2 6927  df-om 7344  df-1st 7445  df-2nd 7446  df-wrecs 7689  df-recs 7751  df-rdg 7789  df-1o 7843  df-2o 7844  df-oadd 7847  df-er 8026  df-map 8142  df-en 8242  df-dom 8243  df-sdom 8244  df-fin 8245  df-sup 8636  df-inf 8637  df-oi 8704  df-card 9098  df-pnf 10413  df-mnf 10414  df-xr 10415  df-ltxr 10416  df-le 10417  df-sub 10608  df-neg 10609  df-div 11033  df-nn 11375  df-2 11438  df-3 11439  df-4 11440  df-5 11441  df-6 11442  df-7 11443  df-8 11444  df-9 11445  df-n0 11643  df-z 11729  df-dec 11846  df-uz 11993  df-rp 12138  df-fz 12644  df-fzo 12785  df-seq 13120  df-exp 13179  df-hash 13436  df-cj 14246  df-re 14247  df-im 14248  df-sqrt 14382  df-abs 14383  df-clim 14627  df-sum 14825  df-dvds 15388  df-prm 15791  df-even 42546  df-odd 42547  df-gbe 42643  df-gbow 42644

This theorem is referenced by: (None)