Theorem bgoldbnnsum3prm 47928

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 12510	. . . . . . 7 ⊢ 2 ∈ ℤ
2		9nn 12230	. . . . . . . 8 ⊢ 9 ∈ ℕ
3	2	nnzi 12502	. . . . . . 7 ⊢ 9 ∈ ℤ
4		2re 12206	. . . . . . . 8 ⊢ 2 ∈ ℝ
5		9re 12231	. . . . . . . 8 ⊢ 9 ∈ ℝ
6		2lt9 12332	. . . . . . . 8 ⊢ 2 < 9
7	4, 5, 6	ltleii 11243	. . . . . . 7 ⊢ 2 ≤ 9
8		eluz2 12744	. . . . . . 7 ⊢ (9 ∈ (ℤ≥‘2) ↔ (2 ∈ ℤ ∧ 9 ∈ ℤ ∧ 2 ≤ 9))
9	1, 3, 7, 8	mpbir3an 1342	. . . . . 6 ⊢ 9 ∈ (ℤ≥‘2)
10		fzouzsplit 13596	. . . . . . 7 ⊢ (9 ∈ (ℤ≥‘2) → (ℤ≥‘2) = ((2..^9) ∪ (ℤ≥‘9)))
11	10	eleq2d 2819	. . . . . 6 ⊢ (9 ∈ (ℤ≥‘2) → (𝑛 ∈ (ℤ≥‘2) ↔ 𝑛 ∈ ((2..^9) ∪ (ℤ≥‘9))))
12	9, 11	ax-mp 5	. . . . 5 ⊢ (𝑛 ∈ (ℤ≥‘2) ↔ 𝑛 ∈ ((2..^9) ∪ (ℤ≥‘9)))
13		elun 4102	. . . . 5 ⊢ (𝑛 ∈ ((2..^9) ∪ (ℤ≥‘9)) ↔ (𝑛 ∈ (2..^9) ∨ 𝑛 ∈ (ℤ≥‘9)))
14	12, 13	bitri 275	. . . 4 ⊢ (𝑛 ∈ (ℤ≥‘2) ↔ (𝑛 ∈ (2..^9) ∨ 𝑛 ∈ (ℤ≥‘9)))
15		elfzo2 13564	. . . . . . . 8 ⊢ (𝑛 ∈ (2..^9) ↔ (𝑛 ∈ (ℤ≥‘2) ∧ 9 ∈ ℤ ∧ 𝑛 < 9))
16		simp1 1136	. . . . . . . . 9 ⊢ ((𝑛 ∈ (ℤ≥‘2) ∧ 9 ∈ ℤ ∧ 𝑛 < 9) → 𝑛 ∈ (ℤ≥‘2))
17		df-9 12202	. . . . . . . . . . . 12 ⊢ 9 = (8 + 1)
18	17	breq2i 5101	. . . . . . . . . . 11 ⊢ (𝑛 < 9 ↔ 𝑛 < (8 + 1))
19		eluz2nn 12788	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ (ℤ≥‘2) → 𝑛 ∈ ℕ)
20		8nn 12227	. . . . . . . . . . . . . . 15 ⊢ 8 ∈ ℕ
21	19, 20	jctir 520	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ (ℤ≥‘2) → (𝑛 ∈ ℕ ∧ 8 ∈ ℕ))
22	21	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ (ℤ≥‘2) ∧ 9 ∈ ℤ) → (𝑛 ∈ ℕ ∧ 8 ∈ ℕ))
23		nnleltp1 12534	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ ℕ ∧ 8 ∈ ℕ) → (𝑛 ≤ 8 ↔ 𝑛 < (8 + 1)))
24	22, 23	syl 17	. . . . . . . . . . . 12 ⊢ ((𝑛 ∈ (ℤ≥‘2) ∧ 9 ∈ ℤ) → (𝑛 ≤ 8 ↔ 𝑛 < (8 + 1)))
25	24	biimprd 248	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ (ℤ≥‘2) ∧ 9 ∈ ℤ) → (𝑛 < (8 + 1) → 𝑛 ≤ 8))
26	18, 25	biimtrid 242	. . . . . . . . . 10 ⊢ ((𝑛 ∈ (ℤ≥‘2) ∧ 9 ∈ ℤ) → (𝑛 < 9 → 𝑛 ≤ 8))
27	26	3impia 1117	. . . . . . . . 9 ⊢ ((𝑛 ∈ (ℤ≥‘2) ∧ 9 ∈ ℤ ∧ 𝑛 < 9) → 𝑛 ≤ 8)
28	16, 27	jca 511	. . . . . . . 8 ⊢ ((𝑛 ∈ (ℤ≥‘2) ∧ 9 ∈ ℤ ∧ 𝑛 < 9) → (𝑛 ∈ (ℤ≥‘2) ∧ 𝑛 ≤ 8))
29	15, 28	sylbi 217	. . . . . . 7 ⊢ (𝑛 ∈ (2..^9) → (𝑛 ∈ (ℤ≥‘2) ∧ 𝑛 ≤ 8))
30		nnsum3primesle9 47918	. . . . . . 7 ⊢ ((𝑛 ∈ (ℤ≥‘2) ∧ 𝑛 ≤ 8) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)))
31	29, 30	syl 17	. . . . . 6 ⊢ (𝑛 ∈ (2..^9) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)))
32	31	a1d 25	. . . . 5 ⊢ (𝑛 ∈ (2..^9) → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘))))
33		breq2 5097	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑛 → (4 < 𝑚 ↔ 4 < 𝑛))
34		eleq1w 2816	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑛 → (𝑚 ∈ GoldbachEven ↔ 𝑛 ∈ GoldbachEven ))
35	33, 34	imbi12d 344	. . . . . . . . . 10 ⊢ (𝑚 = 𝑛 → ((4 < 𝑚 → 𝑚 ∈ GoldbachEven ) ↔ (4 < 𝑛 → 𝑛 ∈ GoldbachEven )))
36	35	rspcv 3569	. . . . . . . . 9 ⊢ (𝑛 ∈ Even → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → (4 < 𝑛 → 𝑛 ∈ GoldbachEven )))
37		4re 12216	. . . . . . . . . . . . . . 15 ⊢ 4 ∈ ℝ
38	37	a1i 11	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ (ℤ≥‘9) → 4 ∈ ℝ)
39	5	a1i 11	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ (ℤ≥‘9) → 9 ∈ ℝ)
40		eluzelre 12749	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ (ℤ≥‘9) → 𝑛 ∈ ℝ)
41	38, 39, 40	3jca 1128	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ (ℤ≥‘9) → (4 ∈ ℝ ∧ 9 ∈ ℝ ∧ 𝑛 ∈ ℝ))
42	41	adantl 481	. . . . . . . . . . . 12 ⊢ ((𝑛 ∈ Even ∧ 𝑛 ∈ (ℤ≥‘9)) → (4 ∈ ℝ ∧ 9 ∈ ℝ ∧ 𝑛 ∈ ℝ))
43		eluzle 12751	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ (ℤ≥‘9) → 9 ≤ 𝑛)
44	43	adantl 481	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ Even ∧ 𝑛 ∈ (ℤ≥‘9)) → 9 ≤ 𝑛)
45		4lt9 12330	. . . . . . . . . . . . 13 ⊢ 4 < 9
46	44, 45	jctil 519	. . . . . . . . . . . 12 ⊢ ((𝑛 ∈ Even ∧ 𝑛 ∈ (ℤ≥‘9)) → (4 < 9 ∧ 9 ≤ 𝑛))
47		ltletr 11212	. . . . . . . . . . . 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 412	. . . . . . . . 9 ⊢ (𝑛 ∈ Even → (𝑛 ∈ (ℤ≥‘9) → ((4 < 𝑛 → 𝑛 ∈ GoldbachEven ) → 𝑛 ∈ GoldbachEven )))
52	36, 51	syl5d 73	. . . . . . . 8 ⊢ (𝑛 ∈ Even → (𝑛 ∈ (ℤ≥‘9) → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → 𝑛 ∈ GoldbachEven )))
53	52	impcom 407	. . . . . . 7 ⊢ ((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Even ) → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → 𝑛 ∈ GoldbachEven ))
54		nnsum3primesgbe 47916	. . . . . . 7 ⊢ (𝑛 ∈ GoldbachEven → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)))
55	53, 54	syl6 35	. . . . . 6 ⊢ ((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Even ) → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘))))
56		3nn 12211	. . . . . . . . . 10 ⊢ 3 ∈ ℕ
57	56	a1i 11	. . . . . . . . 9 ⊢ (((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW )) → 3 ∈ ℕ)
58		oveq2 7360	. . . . . . . . . . . 12 ⊢ (𝑑 = 3 → (1...𝑑) = (1...3))
59	58	oveq2d 7368	. . . . . . . . . . 11 ⊢ (𝑑 = 3 → (ℙ ↑m (1...𝑑)) = (ℙ ↑m (1...3)))
60		breq1 5096	. . . . . . . . . . . 12 ⊢ (𝑑 = 3 → (𝑑 ≤ 3 ↔ 3 ≤ 3))
61	58	sumeq1d 15609	. . . . . . . . . . . . 13 ⊢ (𝑑 = 3 → Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘) = Σ𝑘 ∈ (1...3)(𝑓‘𝑘))
62	61	eqeq2d 2744	. . . . . . . . . . . 12 ⊢ (𝑑 = 3 → (𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘) ↔ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘)))
63	60, 62	anbi12d 632	. . . . . . . . . . 11 ⊢ (𝑑 = 3 → ((𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)) ↔ (3 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘))))
64	59, 63	rexeqbidv 3314	. . . . . . . . . 10 ⊢ (𝑑 = 3 → (∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)) ↔ ∃𝑓 ∈ (ℙ ↑m (1...3))(3 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘))))
65	64	adantl 481	. . . . . . . . 9 ⊢ ((((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW )) ∧ 𝑑 = 3) → (∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)) ↔ ∃𝑓 ∈ (ℙ ↑m (1...3))(3 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘))))
66		3re 12212	. . . . . . . . . . . 12 ⊢ 3 ∈ ℝ
67	66	leidi 11658	. . . . . . . . . . 11 ⊢ 3 ≤ 3
68	67	a1i 11	. . . . . . . . . 10 ⊢ (((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW )) → 3 ≤ 3)
69		6nn 12221	. . . . . . . . . . . . . 14 ⊢ 6 ∈ ℕ
70	69	nnzi 12502	. . . . . . . . . . . . 13 ⊢ 6 ∈ ℤ
71		6re 12222	. . . . . . . . . . . . . 14 ⊢ 6 ∈ ℝ
72		6lt9 12328	. . . . . . . . . . . . . 14 ⊢ 6 < 9
73	71, 5, 72	ltleii 11243	. . . . . . . . . . . . 13 ⊢ 6 ≤ 9
74		eluzuzle 12747	. . . . . . . . . . . . 13 ⊢ ((6 ∈ ℤ ∧ 6 ≤ 9) → (𝑛 ∈ (ℤ≥‘9) → 𝑛 ∈ (ℤ≥‘6)))
75	70, 73, 74	mp2an 692	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ (ℤ≥‘9) → 𝑛 ∈ (ℤ≥‘6))
76	75	anim1i 615	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) → (𝑛 ∈ (ℤ≥‘6) ∧ 𝑛 ∈ Odd ))
77		nnsum4primesodd 47920	. . . . . . . . . . 11 ⊢ (∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW ) → ((𝑛 ∈ (ℤ≥‘6) ∧ 𝑛 ∈ Odd ) → ∃𝑓 ∈ (ℙ ↑m (1...3))𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘)))
78	76, 77	mpan9 506	. . . . . . . . . 10 ⊢ (((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW )) → ∃𝑓 ∈ (ℙ ↑m (1...3))𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘))
79		r19.42v 3165	. . . . . . . . . 10 ⊢ (∃𝑓 ∈ (ℙ ↑m (1...3))(3 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘)) ↔ (3 ≤ 3 ∧ ∃𝑓 ∈ (ℙ ↑m (1...3))𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘)))
80	68, 78, 79	sylanbrc 583	. . . . . . . . 9 ⊢ (((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW )) → ∃𝑓 ∈ (ℙ ↑m (1...3))(3 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘)))
81	57, 65, 80	rspcedvd 3575	. . . . . . . 8 ⊢ (((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW )) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)))
82	81	expcom 413	. . . . . . 7 ⊢ (∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW ) → ((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘))))
83		sbgoldbwt 47901	. . . . . . 7 ⊢ (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → ∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW ))
84	82, 83	syl11 33	. . . . . 6 ⊢ ((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘))))
85		eluzelz 12748	. . . . . . 7 ⊢ (𝑛 ∈ (ℤ≥‘9) → 𝑛 ∈ ℤ)
86		zeoALTV 47794	. . . . . . 7 ⊢ (𝑛 ∈ ℤ → (𝑛 ∈ Even ∨ 𝑛 ∈ Odd ))
87	85, 86	syl 17	. . . . . 6 ⊢ (𝑛 ∈ (ℤ≥‘9) → (𝑛 ∈ Even ∨ 𝑛 ∈ Odd ))
88	55, 84, 87	mpjaodan 960	. . . . 5 ⊢ (𝑛 ∈ (ℤ≥‘9) → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘))))
89	32, 88	jaoi 857	. . . 4 ⊢ ((𝑛 ∈ (2..^9) ∨ 𝑛 ∈ (ℤ≥‘9)) → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘))))
90	14, 89	sylbi 217	. . 3 ⊢ (𝑛 ∈ (ℤ≥‘2) → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘))))
91	90	impcom 407	. 2 ⊢ ((∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) ∧ 𝑛 ∈ (ℤ≥‘2)) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)))
92	91	ralrimiva 3125	1 ⊢ (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → ∀𝑛 ∈ (ℤ≥‘2)∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113  ∀wral 3048  ∃wrex 3057   ∪ cun 3896   class class class wbr 5093  ‘cfv 6486  (class class class)co 7352   ↑_m cmap 8756  ℝcr 11012  1c1 11014   + caddc 11016   < clt 11153   ≤ cle 11154  ℕcn 12132  2c2 12187  3c3 12188  4c4 12189  5c5 12190  6c6 12191  8c8 12193  9c9 12194  ℤcz 12475  ℤ_≥cuz 12738  ...cfz 13409  ..^cfzo 13556  Σcsu 15595  ℙcprime 16584   Even ceven 47748   Odd codd 47749   GoldbachEven cgbe 47869   GoldbachOddW cgbow 47870

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-rep 5219  ax-sep 5236  ax-nul 5246  ax-pow 5305  ax-pr 5372  ax-un 7674  ax-inf2 9538  ax-cnex 11069  ax-resscn 11070  ax-1cn 11071  ax-icn 11072  ax-addcl 11073  ax-addrcl 11074  ax-mulcl 11075  ax-mulrcl 11076  ax-mulcom 11077  ax-addass 11078  ax-mulass 11079  ax-distr 11080  ax-i2m1 11081  ax-1ne0 11082  ax-1rid 11083  ax-rnegex 11084  ax-rrecex 11085  ax-cnre 11086  ax-pre-lttri 11087  ax-pre-lttrn 11088  ax-pre-ltadd 11089  ax-pre-mulgt0 11090  ax-pre-sup 11091

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-nel 3034  df-ral 3049  df-rex 3058  df-rmo 3347  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4283  df-if 4475  df-pw 4551  df-sn 4576  df-pr 4578  df-tp 4580  df-op 4582  df-uni 4859  df-int 4898  df-iun 4943  df-br 5094  df-opab 5156  df-mpt 5175  df-tr 5201  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-se 5573  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6253  df-ord 6314  df-on 6315  df-lim 6316  df-suc 6317  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-isom 6495  df-riota 7309  df-ov 7355  df-oprab 7356  df-mpo 7357  df-om 7803  df-1st 7927  df-2nd 7928  df-frecs 8217  df-wrecs 8248  df-recs 8297  df-rdg 8335  df-1o 8391  df-2o 8392  df-er 8628  df-map 8758  df-en 8876  df-dom 8877  df-sdom 8878  df-fin 8879  df-sup 9333  df-inf 9334  df-oi 9403  df-card 9839  df-pnf 11155  df-mnf 11156  df-xr 11157  df-ltxr 11158  df-le 11159  df-sub 11353  df-neg 11354  df-div 11782  df-nn 12133  df-2 12195  df-3 12196  df-4 12197  df-5 12198  df-6 12199  df-7 12200  df-8 12201  df-9 12202  df-n0 12389  df-z 12476  df-dec 12595  df-uz 12739  df-rp 12893  df-fz 13410  df-fzo 13557  df-seq 13911  df-exp 13971  df-hash 14240  df-cj 15008  df-re 15009  df-im 15010  df-sqrt 15144  df-abs 15145  df-clim 15397  df-sum 15596  df-dvds 16166  df-prm 16585  df-even 47750  df-odd 47751  df-gbe 47872  df-gbow 47873

This theorem is referenced by: (None)