Theorem bgoldbnnsum3prm 49105

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)∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)))

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

Proof of Theorem bgoldbnnsum3prm

Dummy variable 𝑜 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		2z 12752	. . . . . . 7 ⊢ 2 ∈ ℤ
2		9nn 12465	. . . . . . . 8 ⊢ 9 ∈ ℕ
3	2	nnzi 12744	. . . . . . 7 ⊢ 9 ∈ ℤ
4		2re 12441	. . . . . . . 8 ⊢ 2 ∈ ℝ
5		9re 12466	. . . . . . . 8 ⊢ 9 ∈ ℝ
6		2lt9 12574	. . . . . . . 8 ⊢ 2 < 9
7	4, 5, 6	ltleii 11457	. . . . . . 7 ⊢ 2 ≤ 9
8		eluz2 12995	. . . . . . 7 ⊢ (9 ∈ (ℤ≥‘2) ↔ (2 ∈ ℤ ∧ 9 ∈ ℤ ∧ 2 ≤ 9))
9	1, 3, 7, 8	mpbir3an 1360	. . . . . 6 ⊢ 9 ∈ (ℤ≥‘2)
10		fzouzsplit 13853	. . . . . . 7 ⊢ (9 ∈ (ℤ≥‘2) → (ℤ≥‘2) = ((2..^9) ∪ (ℤ≥‘9)))
11	10	eleq2d 2850	. . . . . 6 ⊢ (9 ∈ (ℤ≥‘2) → (𝑛 ∈ (ℤ≥‘2) ↔ 𝑛 ∈ ((2..^9) ∪ (ℤ≥‘9))))
12	9, 11	ax-mp 5	. . . . 5 ⊢ (𝑛 ∈ (ℤ≥‘2) ↔ 𝑛 ∈ ((2..^9) ∪ (ℤ≥‘9)))
13		elun 4155	. . . . 5 ⊢ (𝑛 ∈ ((2..^9) ∪ (ℤ≥‘9)) ↔ (𝑛 ∈ (2..^9) ∨ 𝑛 ∈ (ℤ≥‘9)))
14	12, 13	bitri 278	. . . 4 ⊢ (𝑛 ∈ (ℤ≥‘2) ↔ (𝑛 ∈ (2..^9) ∨ 𝑛 ∈ (ℤ≥‘9)))
15		elfzo2 13820	. . . . . . . 8 ⊢ (𝑛 ∈ (2..^9) ↔ (𝑛 ∈ (ℤ≥‘2) ∧ 9 ∈ ℤ ∧ 𝑛 < 9))
16		simp1 1154	. . . . . . . . 9 ⊢ ((𝑛 ∈ (ℤ≥‘2) ∧ 9 ∈ ℤ ∧ 𝑛 < 9) → 𝑛 ∈ (ℤ≥‘2))
17		df-9 12436	. . . . . . . . . . . 12 ⊢ 9 = (8 + 1)
18	17	breq2i 5114	. . . . . . . . . . 11 ⊢ (𝑛 < 9 ↔ 𝑛 < (8 + 1))
19		eluz2nn 13039	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ (ℤ≥‘2) → 𝑛 ∈ ℕ)
20		8nn 12462	. . . . . . . . . . . . . . 15 ⊢ 8 ∈ ℕ
21	19, 20	jctir 530	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ (ℤ≥‘2) → (𝑛 ∈ ℕ ∧ 8 ∈ ℕ))
22	21	adantr 486	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ (ℤ≥‘2) ∧ 9 ∈ ℤ) → (𝑛 ∈ ℕ ∧ 8 ∈ ℕ))
23		nnleltp1 12778	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ ℕ ∧ 8 ∈ ℕ) → (𝑛 ≤ 8 ↔ 𝑛 < (8 + 1)))
24	22, 23	syl 18	. . . . . . . . . . . 12 ⊢ ((𝑛 ∈ (ℤ≥‘2) ∧ 9 ∈ ℤ) → (𝑛 ≤ 8 ↔ 𝑛 < (8 + 1)))
25	24	biimprd 251	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ (ℤ≥‘2) ∧ 9 ∈ ℤ) → (𝑛 < (8 + 1) → 𝑛 ≤ 8))
26	18, 25	biimtrid 245	. . . . . . . . . 10 ⊢ ((𝑛 ∈ (ℤ≥‘2) ∧ 9 ∈ ℤ) → (𝑛 < 9 → 𝑛 ≤ 8))
27	26	3impia 1135	. . . . . . . . 9 ⊢ ((𝑛 ∈ (ℤ≥‘2) ∧ 9 ∈ ℤ ∧ 𝑛 < 9) → 𝑛 ≤ 8)
28	16, 27	jca 521	. . . . . . . 8 ⊢ ((𝑛 ∈ (ℤ≥‘2) ∧ 9 ∈ ℤ ∧ 𝑛 < 9) → (𝑛 ∈ (ℤ≥‘2) ∧ 𝑛 ≤ 8))
29	15, 28	sylbi 220	. . . . . . 7 ⊢ (𝑛 ∈ (2..^9) → (𝑛 ∈ (ℤ≥‘2) ∧ 𝑛 ≤ 8))
30		nnsum3primesle9 49095	. . . . . . 7 ⊢ ((𝑛 ∈ (ℤ≥‘2) ∧ 𝑛 ≤ 8) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)))
31	29, 30	syl 18	. . . . . 6 ⊢ (𝑛 ∈ (2..^9) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)))
32	31	a1d 26	. . . . 5 ⊢ (𝑛 ∈ (2..^9) → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘))))
33		breq2 5110	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑛 → (4 < 𝑚 ↔ 4 < 𝑛))
34		eleq1w 2847	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑛 → (𝑚 ∈ GoldbachEven ↔ 𝑛 ∈ GoldbachEven ))
35	33, 34	imbi12d 347	. . . . . . . . . 10 ⊢ (𝑚 = 𝑛 → ((4 < 𝑚 → 𝑚 ∈ GoldbachEven ) ↔ (4 < 𝑛 → 𝑛 ∈ GoldbachEven )))
36	35	rspcv 3576	. . . . . . . . 9 ⊢ (𝑛 ∈ Even → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → (4 < 𝑛 → 𝑛 ∈ GoldbachEven )))
37		4re 12451	. . . . . . . . . . . . . . 15 ⊢ 4 ∈ ℝ
38	37	a1i 11	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ (ℤ≥‘9) → 4 ∈ ℝ)
39	5	a1i 11	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ (ℤ≥‘9) → 9 ∈ ℝ)
40		eluzelre 13000	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ (ℤ≥‘9) → 𝑛 ∈ ℝ)
41	38, 39, 40	3jca 1146	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ (ℤ≥‘9) → (4 ∈ ℝ ∧ 9 ∈ ℝ ∧ 𝑛 ∈ ℝ))
42	41	adantl 487	. . . . . . . . . . . 12 ⊢ ((𝑛 ∈ Even ∧ 𝑛 ∈ (ℤ≥‘9)) → (4 ∈ ℝ ∧ 9 ∈ ℝ ∧ 𝑛 ∈ ℝ))
43		eluzle 13002	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ (ℤ≥‘9) → 9 ≤ 𝑛)
44	43	adantl 487	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ Even ∧ 𝑛 ∈ (ℤ≥‘9)) → 9 ≤ 𝑛)
45		4lt9 12572	. . . . . . . . . . . . 13 ⊢ 4 < 9
46	44, 45	jctil 529	. . . . . . . . . . . 12 ⊢ ((𝑛 ∈ Even ∧ 𝑛 ∈ (ℤ≥‘9)) → (4 < 9 ∧ 9 ≤ 𝑛))
47		ltletr 11426	. . . . . . . . . . . 12 ⊢ ((4 ∈ ℝ ∧ 9 ∈ ℝ ∧ 𝑛 ∈ ℝ) → ((4 < 9 ∧ 9 ≤ 𝑛) → 4 < 𝑛))
48	42, 46, 47	sylc 66	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ Even ∧ 𝑛 ∈ (ℤ≥‘9)) → 4 < 𝑛)
49		pm2.27 43	. . . . . . . . . . 11 ⊢ (4 < 𝑛 → ((4 < 𝑛 → 𝑛 ∈ GoldbachEven ) → 𝑛 ∈ GoldbachEven ))
50	48, 49	syl 18	. . . . . . . . . 10 ⊢ ((𝑛 ∈ Even ∧ 𝑛 ∈ (ℤ≥‘9)) → ((4 < 𝑛 → 𝑛 ∈ GoldbachEven ) → 𝑛 ∈ GoldbachEven ))
51	50	ex 418	. . . . . . . . 9 ⊢ (𝑛 ∈ Even → (𝑛 ∈ (ℤ≥‘9) → ((4 < 𝑛 → 𝑛 ∈ GoldbachEven ) → 𝑛 ∈ GoldbachEven )))
52	36, 51	syl5d 74	. . . . . . . 8 ⊢ (𝑛 ∈ Even → (𝑛 ∈ (ℤ≥‘9) → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → 𝑛 ∈ GoldbachEven )))
53	52	impcom 413	. . . . . . 7 ⊢ ((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Even ) → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → 𝑛 ∈ GoldbachEven ))
54		nnsum3primesgbe 49093	. . . . . . 7 ⊢ (𝑛 ∈ GoldbachEven → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)))
55	53, 54	syl6 36	. . . . . 6 ⊢ ((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Even ) → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘))))
56		3nn 12446	. . . . . . . . . 10 ⊢ 3 ∈ ℕ
57	56	a1i 11	. . . . . . . . 9 ⊢ (((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW )) → 3 ∈ ℕ)
58		oveq2 7448	. . . . . . . . . . . 12 ⊢ (𝑑 = 3 → (1...𝑑) = (1...3))
59	58	oveq2d 7456	. . . . . . . . . . 11 ⊢ (𝑑 = 3 → (ℙ ↑m (1...𝑑)) = (ℙ ↑m (1...3)))
60		breq1 5109	. . . . . . . . . . . 12 ⊢ (𝑑 = 3 → (𝑑 ≤ 3 ↔ 3 ≤ 3))
61	58	sumeq1d 15893	. . . . . . . . . . . . 13 ⊢ (𝑑 = 3 → Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘) = Σ𝑘 ∈ (1...3)(𝑓‘𝑘))
62	61	eqeq2d 2774	. . . . . . . . . . . 12 ⊢ (𝑑 = 3 → (𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘) ↔ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘)))
63	60, 62	anbi12d 644	. . . . . . . . . . 11 ⊢ (𝑑 = 3 → ((𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)) ↔ (3 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘))))
64	59, 63	rexeqbidv 3339	. . . . . . . . . 10 ⊢ (𝑑 = 3 → (∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)) ↔ ∃𝑓 ∈ (ℙ ↑m (1...3))(3 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘))))
65	64	adantl 487	. . . . . . . . 9 ⊢ ((((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW )) ∧ 𝑑 = 3) → (∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)) ↔ ∃𝑓 ∈ (ℙ ↑m (1...3))(3 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘))))
66		3re 12447	. . . . . . . . . . . 12 ⊢ 3 ∈ ℝ
67	66	leidi 11874	. . . . . . . . . . 11 ⊢ 3 ≤ 3
68	67	a1i 11	. . . . . . . . . 10 ⊢ (((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW )) → 3 ≤ 3)
69		6nn 12456	. . . . . . . . . . . . . 14 ⊢ 6 ∈ ℕ
70	69	nnzi 12744	. . . . . . . . . . . . 13 ⊢ 6 ∈ ℤ
71		6re 12457	. . . . . . . . . . . . . 14 ⊢ 6 ∈ ℝ
72		6lt9 12570	. . . . . . . . . . . . . 14 ⊢ 6 < 9
73	71, 5, 72	ltleii 11457	. . . . . . . . . . . . 13 ⊢ 6 ≤ 9
74		eluzuzle 12998	. . . . . . . . . . . . 13 ⊢ ((6 ∈ ℤ ∧ 6 ≤ 9) → (𝑛 ∈ (ℤ≥‘9) → 𝑛 ∈ (ℤ≥‘6)))
75	70, 73, 74	mp2an 705	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ (ℤ≥‘9) → 𝑛 ∈ (ℤ≥‘6))
76	75	anim1i 627	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) → (𝑛 ∈ (ℤ≥‘6) ∧ 𝑛 ∈ Odd ))
77		nnsum4primesodd 49097	. . . . . . . . . . 11 ⊢ (∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW ) → ((𝑛 ∈ (ℤ≥‘6) ∧ 𝑛 ∈ Odd ) → ∃𝑓 ∈ (ℙ ↑m (1...3))𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘)))
78	76, 77	mpan9 516	. . . . . . . . . 10 ⊢ (((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW )) → ∃𝑓 ∈ (ℙ ↑m (1...3))𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘))
79		r19.42v 3198	. . . . . . . . . 10 ⊢ (∃𝑓 ∈ (ℙ ↑m (1...3))(3 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘)) ↔ (3 ≤ 3 ∧ ∃𝑓 ∈ (ℙ ↑m (1...3))𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘)))
80	68, 78, 79	sylanbrc 595	. . . . . . . . 9 ⊢ (((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW )) → ∃𝑓 ∈ (ℙ ↑m (1...3))(3 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘)))
81	57, 65, 80	rspcedvd 3582	. . . . . . . 8 ⊢ (((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW )) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)))
82	81	expcom 419	. . . . . . 7 ⊢ (∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW ) → ((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘))))
83		sbgoldbwt 49078	. . . . . . 7 ⊢ (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → ∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW ))
84	82, 83	syl11 34	. . . . . 6 ⊢ ((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘))))
85		eluzelz 12999	. . . . . . 7 ⊢ (𝑛 ∈ (ℤ≥‘9) → 𝑛 ∈ ℤ)
86		zeoALTV 48971	. . . . . . 7 ⊢ (𝑛 ∈ ℤ → (𝑛 ∈ Even ∨ 𝑛 ∈ Odd ))
87	85, 86	syl 18	. . . . . 6 ⊢ (𝑛 ∈ (ℤ≥‘9) → (𝑛 ∈ Even ∨ 𝑛 ∈ Odd ))
88	55, 84, 87	mpjaodan 973	. . . . 5 ⊢ (𝑛 ∈ (ℤ≥‘9) → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘))))
89	32, 88	jaoi 871	. . . 4 ⊢ ((𝑛 ∈ (2..^9) ∨ 𝑛 ∈ (ℤ≥‘9)) → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘))))
90	14, 89	sylbi 220	. . 3 ⊢ (𝑛 ∈ (ℤ≥‘2) → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘))))
91	90	impcom 413	. 2 ⊢ ((∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) ∧ 𝑛 ∈ (ℤ≥‘2)) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)))
92	91	ralrimiva 3158	1 ⊢ (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → ∀𝑛 ∈ (ℤ≥‘2)∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090   ∪ cun 4152   class class class wbr 5106  ‘cfv 6555  (class class class)co 7440   ↑_m cmap 8872  ℝcr 11223  1c1 11225   + caddc 11227   < clt 11367   ≤ cle 11368  ℕcn 12359  2c2 12421  3c3 12422  4c4 12423  5c5 12424  6c6 12425  8c8 12427  9c9 12428  ℤcz 12717  ℤ_≥cuz 12989  ...cfz 13663  ..^cfzo 13812  Σcsu 15879  ℙcprime 16872   Even ceven 48925   Odd codd 48926   GoldbachEven cgbe 49046   GoldbachOddW cgbow 49047

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772  ax-inf2 9666  ax-cnex 11280  ax-resscn 11281  ax-1cn 11282  ax-icn 11283  ax-addcl 11284  ax-addrcl 11285  ax-mulcl 11286  ax-mulrcl 11287  ax-mulcom 11288  ax-addass 11289  ax-mulass 11290  ax-distr 11291  ax-i2m1 11292  ax-1ne0 11293  ax-1rid 11294  ax-rnegex 11295  ax-rrecex 11296  ax-cnre 11297  ax-pre-lttri 11298  ax-pre-lttrn 11299  ax-pre-ltadd 11300  ax-pre-mulgt0 11301  ax-pre-sup 11302

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6319  df-ord 6380  df-on 6381  df-lim 6382  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-isom 6564  df-riota 7397  df-ov 7443  df-oprab 7444  df-mpo 7445  df-om 7899  df-1st 8022  df-2nd 8023  df-frecs 8324  df-wrecs 8355  df-recs 8404  df-rdg 8443  df-1o 8501  df-2o 8502  df-er 8742  df-map 8874  df-en 8999  df-dom 9000  df-sdom 9001  df-fin 9002  df-sup 9458  df-inf 9459  df-oi 9528  df-card 10044  df-pnf 11369  df-mnf 11370  df-xr 11371  df-ltxr 11372  df-le 11373  df-sub 11567  df-neg 11568  df-div 11998  df-nn 12360  df-2 12429  df-3 12430  df-4 12431  df-5 12432  df-6 12433  df-7 12434  df-8 12435  df-9 12436  df-n0 12631  df-z 12718  df-dec 12839  df-uz 12990  df-rp 13145  df-fz 13664  df-fzo 13813  df-seq 14169  df-exp 14229  df-hash 14499  df-cj 15292  df-re 15293  df-im 15294  df-sqrt 15428  df-abs 15429  df-clim 15681  df-sum 15880  df-dvds 16449  df-prm 16873  df-even 48927  df-odd 48928  df-gbe 49049  df-gbow 49050

This theorem is used by: (None)