Theorem bgoldbnnsum3prm 48298

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 12554	. . . . . . 7 ⊢ 2 ∈ ℤ
2		9nn 12274	. . . . . . . 8 ⊢ 9 ∈ ℕ
3	2	nnzi 12546	. . . . . . 7 ⊢ 9 ∈ ℤ
4		2re 12250	. . . . . . . 8 ⊢ 2 ∈ ℝ
5		9re 12275	. . . . . . . 8 ⊢ 9 ∈ ℝ
6		2lt9 12376	. . . . . . . 8 ⊢ 2 < 9
7	4, 5, 6	ltleii 11264	. . . . . . 7 ⊢ 2 ≤ 9
8		eluz2 12789	. . . . . . 7 ⊢ (9 ∈ (ℤ≥‘2) ↔ (2 ∈ ℤ ∧ 9 ∈ ℤ ∧ 2 ≤ 9))
9	1, 3, 7, 8	mpbir3an 1343	. . . . . 6 ⊢ 9 ∈ (ℤ≥‘2)
10		fzouzsplit 13644	. . . . . . 7 ⊢ (9 ∈ (ℤ≥‘2) → (ℤ≥‘2) = ((2..^9) ∪ (ℤ≥‘9)))
11	10	eleq2d 2823	. . . . . 6 ⊢ (9 ∈ (ℤ≥‘2) → (𝑛 ∈ (ℤ≥‘2) ↔ 𝑛 ∈ ((2..^9) ∪ (ℤ≥‘9))))
12	9, 11	ax-mp 5	. . . . 5 ⊢ (𝑛 ∈ (ℤ≥‘2) ↔ 𝑛 ∈ ((2..^9) ∪ (ℤ≥‘9)))
13		elun 4094	. . . . 5 ⊢ (𝑛 ∈ ((2..^9) ∪ (ℤ≥‘9)) ↔ (𝑛 ∈ (2..^9) ∨ 𝑛 ∈ (ℤ≥‘9)))
14	12, 13	bitri 275	. . . 4 ⊢ (𝑛 ∈ (ℤ≥‘2) ↔ (𝑛 ∈ (2..^9) ∨ 𝑛 ∈ (ℤ≥‘9)))
15		elfzo2 13611	. . . . . . . 8 ⊢ (𝑛 ∈ (2..^9) ↔ (𝑛 ∈ (ℤ≥‘2) ∧ 9 ∈ ℤ ∧ 𝑛 < 9))
16		simp1 1137	. . . . . . . . 9 ⊢ ((𝑛 ∈ (ℤ≥‘2) ∧ 9 ∈ ℤ ∧ 𝑛 < 9) → 𝑛 ∈ (ℤ≥‘2))
17		df-9 12246	. . . . . . . . . . . 12 ⊢ 9 = (8 + 1)
18	17	breq2i 5094	. . . . . . . . . . 11 ⊢ (𝑛 < 9 ↔ 𝑛 < (8 + 1))
19		eluz2nn 12833	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ (ℤ≥‘2) → 𝑛 ∈ ℕ)
20		8nn 12271	. . . . . . . . . . . . . . 15 ⊢ 8 ∈ ℕ
21	19, 20	jctir 520	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ (ℤ≥‘2) → (𝑛 ∈ ℕ ∧ 8 ∈ ℕ))
22	21	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ (ℤ≥‘2) ∧ 9 ∈ ℤ) → (𝑛 ∈ ℕ ∧ 8 ∈ ℕ))
23		nnleltp1 12579	. . . . . . . . . . . . 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 1118	. . . . . . . . 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 48288	. . . . . . 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 5090	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑛 → (4 < 𝑚 ↔ 4 < 𝑛))
34		eleq1w 2820	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑛 → (𝑚 ∈ GoldbachEven ↔ 𝑛 ∈ GoldbachEven ))
35	33, 34	imbi12d 344	. . . . . . . . . 10 ⊢ (𝑚 = 𝑛 → ((4 < 𝑚 → 𝑚 ∈ GoldbachEven ) ↔ (4 < 𝑛 → 𝑛 ∈ GoldbachEven )))
36	35	rspcv 3561	. . . . . . . . 9 ⊢ (𝑛 ∈ Even → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → (4 < 𝑛 → 𝑛 ∈ GoldbachEven )))
37		4re 12260	. . . . . . . . . . . . . . 15 ⊢ 4 ∈ ℝ
38	37	a1i 11	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ (ℤ≥‘9) → 4 ∈ ℝ)
39	5	a1i 11	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ (ℤ≥‘9) → 9 ∈ ℝ)
40		eluzelre 12794	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ (ℤ≥‘9) → 𝑛 ∈ ℝ)
41	38, 39, 40	3jca 1129	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ (ℤ≥‘9) → (4 ∈ ℝ ∧ 9 ∈ ℝ ∧ 𝑛 ∈ ℝ))
42	41	adantl 481	. . . . . . . . . . . 12 ⊢ ((𝑛 ∈ Even ∧ 𝑛 ∈ (ℤ≥‘9)) → (4 ∈ ℝ ∧ 9 ∈ ℝ ∧ 𝑛 ∈ ℝ))
43		eluzle 12796	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ (ℤ≥‘9) → 9 ≤ 𝑛)
44	43	adantl 481	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ Even ∧ 𝑛 ∈ (ℤ≥‘9)) → 9 ≤ 𝑛)
45		4lt9 12374	. . . . . . . . . . . . 13 ⊢ 4 < 9
46	44, 45	jctil 519	. . . . . . . . . . . 12 ⊢ ((𝑛 ∈ Even ∧ 𝑛 ∈ (ℤ≥‘9)) → (4 < 9 ∧ 9 ≤ 𝑛))
47		ltletr 11233	. . . . . . . . . . . 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 48286	. . . . . . 7 ⊢ (𝑛 ∈ GoldbachEven → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)))
55	53, 54	syl6 35	. . . . . 6 ⊢ ((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Even ) → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘))))
56		3nn 12255	. . . . . . . . . 10 ⊢ 3 ∈ ℕ
57	56	a1i 11	. . . . . . . . 9 ⊢ (((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW )) → 3 ∈ ℕ)
58		oveq2 7370	. . . . . . . . . . . 12 ⊢ (𝑑 = 3 → (1...𝑑) = (1...3))
59	58	oveq2d 7378	. . . . . . . . . . 11 ⊢ (𝑑 = 3 → (ℙ ↑m (1...𝑑)) = (ℙ ↑m (1...3)))
60		breq1 5089	. . . . . . . . . . . 12 ⊢ (𝑑 = 3 → (𝑑 ≤ 3 ↔ 3 ≤ 3))
61	58	sumeq1d 15657	. . . . . . . . . . . . 13 ⊢ (𝑑 = 3 → Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘) = Σ𝑘 ∈ (1...3)(𝑓‘𝑘))
62	61	eqeq2d 2748	. . . . . . . . . . . 12 ⊢ (𝑑 = 3 → (𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘) ↔ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘)))
63	60, 62	anbi12d 633	. . . . . . . . . . 11 ⊢ (𝑑 = 3 → ((𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)) ↔ (3 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘))))
64	59, 63	rexeqbidv 3313	. . . . . . . . . 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 12256	. . . . . . . . . . . 12 ⊢ 3 ∈ ℝ
67	66	leidi 11679	. . . . . . . . . . 11 ⊢ 3 ≤ 3
68	67	a1i 11	. . . . . . . . . 10 ⊢ (((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW )) → 3 ≤ 3)
69		6nn 12265	. . . . . . . . . . . . . 14 ⊢ 6 ∈ ℕ
70	69	nnzi 12546	. . . . . . . . . . . . 13 ⊢ 6 ∈ ℤ
71		6re 12266	. . . . . . . . . . . . . 14 ⊢ 6 ∈ ℝ
72		6lt9 12372	. . . . . . . . . . . . . 14 ⊢ 6 < 9
73	71, 5, 72	ltleii 11264	. . . . . . . . . . . . 13 ⊢ 6 ≤ 9
74		eluzuzle 12792	. . . . . . . . . . . . 13 ⊢ ((6 ∈ ℤ ∧ 6 ≤ 9) → (𝑛 ∈ (ℤ≥‘9) → 𝑛 ∈ (ℤ≥‘6)))
75	70, 73, 74	mp2an 693	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ (ℤ≥‘9) → 𝑛 ∈ (ℤ≥‘6))
76	75	anim1i 616	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) → (𝑛 ∈ (ℤ≥‘6) ∧ 𝑛 ∈ Odd ))
77		nnsum4primesodd 48290	. . . . . . . . . . 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 3170	. . . . . . . . . 10 ⊢ (∃𝑓 ∈ (ℙ ↑m (1...3))(3 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘)) ↔ (3 ≤ 3 ∧ ∃𝑓 ∈ (ℙ ↑m (1...3))𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘)))
80	68, 78, 79	sylanbrc 584	. . . . . . . . 9 ⊢ (((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW )) → ∃𝑓 ∈ (ℙ ↑m (1...3))(3 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓‘𝑘)))
81	57, 65, 80	rspcedvd 3567	. . . . . . . 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 48271	. . . . . . 7 ⊢ (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → ∀𝑜 ∈ Odd (5 < 𝑜 → 𝑜 ∈ GoldbachOddW ))
84	82, 83	syl11 33	. . . . . 6 ⊢ ((𝑛 ∈ (ℤ≥‘9) ∧ 𝑛 ∈ Odd ) → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘))))
85		eluzelz 12793	. . . . . . 7 ⊢ (𝑛 ∈ (ℤ≥‘9) → 𝑛 ∈ ℤ)
86		zeoALTV 48164	. . . . . . 7 ⊢ (𝑛 ∈ ℤ → (𝑛 ∈ Even ∨ 𝑛 ∈ Odd ))
87	85, 86	syl 17	. . . . . 6 ⊢ (𝑛 ∈ (ℤ≥‘9) → (𝑛 ∈ Even ∨ 𝑛 ∈ Odd ))
88	55, 84, 87	mpjaodan 961	. . . . 5 ⊢ (𝑛 ∈ (ℤ≥‘9) → (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘))))
89	32, 88	jaoi 858	. . . 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 3130	1 ⊢ (∀𝑚 ∈ Even (4 < 𝑚 → 𝑚 ∈ GoldbachEven ) → ∀𝑛 ∈ (ℤ≥‘2)∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 3 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓‘𝑘)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 848   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  ∀wral 3052  ∃wrex 3062   ∪ cun 3888   class class class wbr 5086  ‘cfv 6494  (class class class)co 7362   ↑_m cmap 8768  ℝcr 11032  1c1 11034   + caddc 11036   < clt 11174   ≤ cle 11175  ℕcn 12169  2c2 12231  3c3 12232  4c4 12233  5c5 12234  6c6 12235  8c8 12237  9c9 12238  ℤcz 12519  ℤ_≥cuz 12783  ...cfz 13456  ..^cfzo 13603  Σcsu 15643  ℙcprime 16635   Even ceven 48118   Odd codd 48119   GoldbachEven cgbe 48239   GoldbachOddW cgbow 48240

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5213  ax-sep 5232  ax-nul 5242  ax-pow 5304  ax-pr 5372  ax-un 7684  ax-inf2 9557  ax-cnex 11089  ax-resscn 11090  ax-1cn 11091  ax-icn 11092  ax-addcl 11093  ax-addrcl 11094  ax-mulcl 11095  ax-mulrcl 11096  ax-mulcom 11097  ax-addass 11098  ax-mulass 11099  ax-distr 11100  ax-i2m1 11101  ax-1ne0 11102  ax-1rid 11103  ax-rnegex 11104  ax-rrecex 11105  ax-cnre 11106  ax-pre-lttri 11107  ax-pre-lttrn 11108  ax-pre-ltadd 11109  ax-pre-mulgt0 11110  ax-pre-sup 11111

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-tp 4573  df-op 4575  df-uni 4852  df-int 4891  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5521  df-eprel 5526  df-po 5534  df-so 5535  df-fr 5579  df-se 5580  df-we 5581  df-xp 5632  df-rel 5633  df-cnv 5634  df-co 5635  df-dm 5636  df-rn 5637  df-res 5638  df-ima 5639  df-pred 6261  df-ord 6322  df-on 6323  df-lim 6324  df-suc 6325  df-iota 6450  df-fun 6496  df-fn 6497  df-f 6498  df-f1 6499  df-fo 6500  df-f1o 6501  df-fv 6502  df-isom 6503  df-riota 7319  df-ov 7365  df-oprab 7366  df-mpo 7367  df-om 7813  df-1st 7937  df-2nd 7938  df-frecs 8226  df-wrecs 8257  df-recs 8306  df-rdg 8344  df-1o 8400  df-2o 8401  df-er 8638  df-map 8770  df-en 8889  df-dom 8890  df-sdom 8891  df-fin 8892  df-sup 9350  df-inf 9351  df-oi 9420  df-card 9858  df-pnf 11176  df-mnf 11177  df-xr 11178  df-ltxr 11179  df-le 11180  df-sub 11374  df-neg 11375  df-div 11803  df-nn 12170  df-2 12239  df-3 12240  df-4 12241  df-5 12242  df-6 12243  df-7 12244  df-8 12245  df-9 12246  df-n0 12433  df-z 12520  df-dec 12640  df-uz 12784  df-rp 12938  df-fz 13457  df-fzo 13604  df-seq 13959  df-exp 14019  df-hash 14288  df-cj 15056  df-re 15057  df-im 15058  df-sqrt 15192  df-abs 15193  df-clim 15445  df-sum 15644  df-dvds 16217  df-prm 16636  df-even 48120  df-odd 48121  df-gbe 48242  df-gbow 48243

This theorem is referenced by: (None)