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

Theorem wtgoldbnnsum4prm 48305
Description: If the (weak) ternary Goldbach conjecture is valid, then every integer greater than 1 is the sum of at most 4 primes, showing that Schnirelmann's constant would be less than or equal to 4. See corollary 1.1 in [Helfgott] p. 4. (Contributed by AV, 25-Jul-2020.)
Assertion
Ref Expression
wtgoldbnnsum4prm (∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW ) → ∀𝑛 ∈ (ℤ‘2)∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘)))
Distinct variable group:   𝑓,𝑘,𝑚,𝑑,𝑛

Proof of Theorem wtgoldbnnsum4prm
StepHypRef Expression
1 2z 12554 . . . . . . 7 2 ∈ ℤ
2 9nn 12274 . . . . . . . 8 9 ∈ ℕ
32nnzi 12546 . . . . . . 7 9 ∈ ℤ
4 2re 12250 . . . . . . . 8 2 ∈ ℝ
5 9re 12275 . . . . . . . 8 9 ∈ ℝ
6 2lt9 12376 . . . . . . . 8 2 < 9
74, 5, 6ltleii 11265 . . . . . . 7 2 ≤ 9
8 eluz2 12789 . . . . . . 7 (9 ∈ (ℤ‘2) ↔ (2 ∈ ℤ ∧ 9 ∈ ℤ ∧ 2 ≤ 9))
91, 3, 7, 8mpbir3an 1349 . . . . . 6 9 ∈ (ℤ‘2)
10 fzouzsplit 13644 . . . . . . 7 (9 ∈ (ℤ‘2) → (ℤ‘2) = ((2..^9) ∪ (ℤ‘9)))
1110eleq2d 2827 . . . . . 6 (9 ∈ (ℤ‘2) → (𝑛 ∈ (ℤ‘2) ↔ 𝑛 ∈ ((2..^9) ∪ (ℤ‘9))))
129, 11ax-mp 5 . . . . 5 (𝑛 ∈ (ℤ‘2) ↔ 𝑛 ∈ ((2..^9) ∪ (ℤ‘9)))
13 elun 4085 . . . . 5 (𝑛 ∈ ((2..^9) ∪ (ℤ‘9)) ↔ (𝑛 ∈ (2..^9) ∨ 𝑛 ∈ (ℤ‘9)))
1412, 13bitri 277 . . . 4 (𝑛 ∈ (ℤ‘2) ↔ (𝑛 ∈ (2..^9) ∨ 𝑛 ∈ (ℤ‘9)))
15 elfzo2 13611 . . . . . . . 8 (𝑛 ∈ (2..^9) ↔ (𝑛 ∈ (ℤ‘2) ∧ 9 ∈ ℤ ∧ 𝑛 < 9))
16 simp1 1143 . . . . . . . . 9 ((𝑛 ∈ (ℤ‘2) ∧ 9 ∈ ℤ ∧ 𝑛 < 9) → 𝑛 ∈ (ℤ‘2))
17 df-9 12246 . . . . . . . . . . . 12 9 = (8 + 1)
1817breq2i 5082 . . . . . . . . . . 11 (𝑛 < 9 ↔ 𝑛 < (8 + 1))
19 eluz2nn 12833 . . . . . . . . . . . . . . 15 (𝑛 ∈ (ℤ‘2) → 𝑛 ∈ ℕ)
20 8nn 12271 . . . . . . . . . . . . . . 15 8 ∈ ℕ
2119, 20jctir 526 . . . . . . . . . . . . . 14 (𝑛 ∈ (ℤ‘2) → (𝑛 ∈ ℕ ∧ 8 ∈ ℕ))
2221adantr 482 . . . . . . . . . . . . 13 ((𝑛 ∈ (ℤ‘2) ∧ 9 ∈ ℤ) → (𝑛 ∈ ℕ ∧ 8 ∈ ℕ))
23 nnleltp1 12579 . . . . . . . . . . . . 13 ((𝑛 ∈ ℕ ∧ 8 ∈ ℕ) → (𝑛 ≤ 8 ↔ 𝑛 < (8 + 1)))
2422, 23syl 17 . . . . . . . . . . . 12 ((𝑛 ∈ (ℤ‘2) ∧ 9 ∈ ℤ) → (𝑛 ≤ 8 ↔ 𝑛 < (8 + 1)))
2524biimprd 250 . . . . . . . . . . 11 ((𝑛 ∈ (ℤ‘2) ∧ 9 ∈ ℤ) → (𝑛 < (8 + 1) → 𝑛 ≤ 8))
2618, 25biimtrid 244 . . . . . . . . . 10 ((𝑛 ∈ (ℤ‘2) ∧ 9 ∈ ℤ) → (𝑛 < 9 → 𝑛 ≤ 8))
27263impia 1124 . . . . . . . . 9 ((𝑛 ∈ (ℤ‘2) ∧ 9 ∈ ℤ ∧ 𝑛 < 9) → 𝑛 ≤ 8)
2816, 27jca 517 . . . . . . . 8 ((𝑛 ∈ (ℤ‘2) ∧ 9 ∈ ℤ ∧ 𝑛 < 9) → (𝑛 ∈ (ℤ‘2) ∧ 𝑛 ≤ 8))
2915, 28sylbi 219 . . . . . . 7 (𝑛 ∈ (2..^9) → (𝑛 ∈ (ℤ‘2) ∧ 𝑛 ≤ 8))
30 nnsum4primesle9 48298 . . . . . . 7 ((𝑛 ∈ (ℤ‘2) ∧ 𝑛 ≤ 8) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘)))
3129, 30syl 17 . . . . . 6 (𝑛 ∈ (2..^9) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘)))
3231a1d 25 . . . . 5 (𝑛 ∈ (2..^9) → (∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘))))
33 4nn 12259 . . . . . . . . 9 4 ∈ ℕ
3433a1i 11 . . . . . . . 8 (((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Even ) ∧ ∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW )) → 4 ∈ ℕ)
35 oveq2 7367 . . . . . . . . . . 11 (𝑑 = 4 → (1...𝑑) = (1...4))
3635oveq2d 7375 . . . . . . . . . 10 (𝑑 = 4 → (ℙ ↑m (1...𝑑)) = (ℙ ↑m (1...4)))
37 breq1 5077 . . . . . . . . . . 11 (𝑑 = 4 → (𝑑 ≤ 4 ↔ 4 ≤ 4))
3835sumeq1d 15657 . . . . . . . . . . . 12 (𝑑 = 4 → Σ𝑘 ∈ (1...𝑑)(𝑓𝑘) = Σ𝑘 ∈ (1...4)(𝑓𝑘))
3938eqeq2d 2752 . . . . . . . . . . 11 (𝑑 = 4 → (𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘) ↔ 𝑛 = Σ𝑘 ∈ (1...4)(𝑓𝑘)))
4037, 39anbi12d 639 . . . . . . . . . 10 (𝑑 = 4 → ((𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘)) ↔ (4 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...4)(𝑓𝑘))))
4136, 40rexeqbidv 3316 . . . . . . . . 9 (𝑑 = 4 → (∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘)) ↔ ∃𝑓 ∈ (ℙ ↑m (1...4))(4 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...4)(𝑓𝑘))))
4241adantl 483 . . . . . . . 8 ((((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Even ) ∧ ∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW )) ∧ 𝑑 = 4) → (∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘)) ↔ ∃𝑓 ∈ (ℙ ↑m (1...4))(4 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...4)(𝑓𝑘))))
43 4re 12260 . . . . . . . . . . 11 4 ∈ ℝ
4443leidi 11680 . . . . . . . . . 10 4 ≤ 4
4544a1i 11 . . . . . . . . 9 (((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Even ) ∧ ∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW )) → 4 ≤ 4)
46 nnsum4primeseven 48303 . . . . . . . . . 10 (∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW ) → ((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Even ) → ∃𝑓 ∈ (ℙ ↑m (1...4))𝑛 = Σ𝑘 ∈ (1...4)(𝑓𝑘)))
4746impcom 409 . . . . . . . . 9 (((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Even ) ∧ ∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW )) → ∃𝑓 ∈ (ℙ ↑m (1...4))𝑛 = Σ𝑘 ∈ (1...4)(𝑓𝑘))
48 r19.42v 3173 . . . . . . . . 9 (∃𝑓 ∈ (ℙ ↑m (1...4))(4 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...4)(𝑓𝑘)) ↔ (4 ≤ 4 ∧ ∃𝑓 ∈ (ℙ ↑m (1...4))𝑛 = Σ𝑘 ∈ (1...4)(𝑓𝑘)))
4945, 47, 48sylanbrc 590 . . . . . . . 8 (((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Even ) ∧ ∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW )) → ∃𝑓 ∈ (ℙ ↑m (1...4))(4 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...4)(𝑓𝑘)))
5034, 42, 49rspcedvd 3563 . . . . . . 7 (((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Even ) ∧ ∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW )) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘)))
5150ex 414 . . . . . 6 ((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Even ) → (∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘))))
52 3nn 12255 . . . . . . . . 9 3 ∈ ℕ
5352a1i 11 . . . . . . . 8 (((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW )) → 3 ∈ ℕ)
54 oveq2 7367 . . . . . . . . . . 11 (𝑑 = 3 → (1...𝑑) = (1...3))
5554oveq2d 7375 . . . . . . . . . 10 (𝑑 = 3 → (ℙ ↑m (1...𝑑)) = (ℙ ↑m (1...3)))
56 breq1 5077 . . . . . . . . . . 11 (𝑑 = 3 → (𝑑 ≤ 4 ↔ 3 ≤ 4))
5754sumeq1d 15657 . . . . . . . . . . . 12 (𝑑 = 3 → Σ𝑘 ∈ (1...𝑑)(𝑓𝑘) = Σ𝑘 ∈ (1...3)(𝑓𝑘))
5857eqeq2d 2752 . . . . . . . . . . 11 (𝑑 = 3 → (𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘) ↔ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓𝑘)))
5956, 58anbi12d 639 . . . . . . . . . 10 (𝑑 = 3 → ((𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘)) ↔ (3 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓𝑘))))
6055, 59rexeqbidv 3316 . . . . . . . . 9 (𝑑 = 3 → (∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘)) ↔ ∃𝑓 ∈ (ℙ ↑m (1...3))(3 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓𝑘))))
6160adantl 483 . . . . . . . 8 ((((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW )) ∧ 𝑑 = 3) → (∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘)) ↔ ∃𝑓 ∈ (ℙ ↑m (1...3))(3 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓𝑘))))
62 3re 12256 . . . . . . . . . . 11 3 ∈ ℝ
63 3lt4 12345 . . . . . . . . . . 11 3 < 4
6462, 43, 63ltleii 11265 . . . . . . . . . 10 3 ≤ 4
6564a1i 11 . . . . . . . . 9 (((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW )) → 3 ≤ 4)
66 6nn 12265 . . . . . . . . . . . . 13 6 ∈ ℕ
6766nnzi 12546 . . . . . . . . . . . 12 6 ∈ ℤ
68 6re 12266 . . . . . . . . . . . . 13 6 ∈ ℝ
69 6lt9 12372 . . . . . . . . . . . . 13 6 < 9
7068, 5, 69ltleii 11265 . . . . . . . . . . . 12 6 ≤ 9
71 eluzuzle 12792 . . . . . . . . . . . 12 ((6 ∈ ℤ ∧ 6 ≤ 9) → (𝑛 ∈ (ℤ‘9) → 𝑛 ∈ (ℤ‘6)))
7267, 70, 71mp2an 699 . . . . . . . . . . 11 (𝑛 ∈ (ℤ‘9) → 𝑛 ∈ (ℤ‘6))
7372anim1i 622 . . . . . . . . . 10 ((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Odd ) → (𝑛 ∈ (ℤ‘6) ∧ 𝑛 ∈ Odd ))
74 nnsum4primesodd 48299 . . . . . . . . . 10 (∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW ) → ((𝑛 ∈ (ℤ‘6) ∧ 𝑛 ∈ Odd ) → ∃𝑓 ∈ (ℙ ↑m (1...3))𝑛 = Σ𝑘 ∈ (1...3)(𝑓𝑘)))
7573, 74mpan9 512 . . . . . . . . 9 (((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW )) → ∃𝑓 ∈ (ℙ ↑m (1...3))𝑛 = Σ𝑘 ∈ (1...3)(𝑓𝑘))
76 r19.42v 3173 . . . . . . . . 9 (∃𝑓 ∈ (ℙ ↑m (1...3))(3 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓𝑘)) ↔ (3 ≤ 4 ∧ ∃𝑓 ∈ (ℙ ↑m (1...3))𝑛 = Σ𝑘 ∈ (1...3)(𝑓𝑘)))
7765, 75, 76sylanbrc 590 . . . . . . . 8 (((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW )) → ∃𝑓 ∈ (ℙ ↑m (1...3))(3 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓𝑘)))
7853, 61, 77rspcedvd 3563 . . . . . . 7 (((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW )) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘)))
7978ex 414 . . . . . 6 ((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Odd ) → (∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘))))
80 eluzelz 12793 . . . . . . 7 (𝑛 ∈ (ℤ‘9) → 𝑛 ∈ ℤ)
81 zeoALTV 48173 . . . . . . 7 (𝑛 ∈ ℤ → (𝑛 ∈ Even ∨ 𝑛 ∈ Odd ))
8280, 81syl 17 . . . . . 6 (𝑛 ∈ (ℤ‘9) → (𝑛 ∈ Even ∨ 𝑛 ∈ Odd ))
8351, 79, 82mpjaodan 967 . . . . 5 (𝑛 ∈ (ℤ‘9) → (∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘))))
8432, 83jaoi 864 . . . 4 ((𝑛 ∈ (2..^9) ∨ 𝑛 ∈ (ℤ‘9)) → (∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘))))
8514, 84sylbi 219 . . 3 (𝑛 ∈ (ℤ‘2) → (∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘))))
8685impcom 409 . 2 ((∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW ) ∧ 𝑛 ∈ (ℤ‘2)) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘)))
8786ralrimiva 3133 1 (∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW ) → ∀𝑛 ∈ (ℤ‘2)∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 397  wo 854  w3a 1093   = wceq 1548  wcel 2121  wral 3055  wrex 3065  cun 3882   class class class wbr 5074  cfv 6488  (class class class)co 7359  m cmap 8767  1c1 11035   + caddc 11037   < clt 11175  cle 11176  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 48127   Odd codd 48128   GoldbachOddW cgbow 48249
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-rep 5201  ax-sep 5220  ax-nul 5230  ax-pow 5296  ax-pr 5364  ax-un 7681  ax-inf2 9557  ax-cnex 11090  ax-resscn 11091  ax-1cn 11092  ax-icn 11093  ax-addcl 11094  ax-addrcl 11095  ax-mulcl 11096  ax-mulrcl 11097  ax-mulcom 11098  ax-addass 11099  ax-mulass 11100  ax-distr 11101  ax-i2m1 11102  ax-1ne0 11103  ax-1rid 11104  ax-rnegex 11105  ax-rrecex 11106  ax-cnre 11107  ax-pre-lttri 11108  ax-pre-lttrn 11109  ax-pre-ltadd 11110  ax-pre-mulgt0 11111  ax-pre-sup 11112
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3or 1094  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-nel 3041  df-ral 3056  df-rex 3066  df-rmo 3346  df-reu 3347  df-rab 3394  df-v 3435  df-sbc 3725  df-csb 3833  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-pss 3904  df-nul 4264  df-if 4457  df-pw 4533  df-sn 4558  df-pr 4560  df-tp 4562  df-op 4564  df-uni 4841  df-int 4880  df-iun 4925  df-br 5075  df-opab 5137  df-mpt 5156  df-tr 5182  df-id 5515  df-eprel 5520  df-po 5528  df-so 5529  df-fr 5573  df-se 5574  df-we 5575  df-xp 5626  df-rel 5627  df-cnv 5628  df-co 5629  df-dm 5630  df-rn 5631  df-res 5632  df-ima 5633  df-pred 6255  df-ord 6316  df-on 6317  df-lim 6318  df-suc 6319  df-iota 6444  df-fun 6490  df-fn 6491  df-f 6492  df-f1 6493  df-fo 6494  df-f1o 6495  df-fv 6496  df-isom 6497  df-riota 7316  df-ov 7362  df-oprab 7363  df-mpo 7364  df-om 7810  df-1st 7933  df-2nd 7934  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8343  df-1o 8399  df-2o 8400  df-er 8637  df-map 8769  df-en 8888  df-dom 8889  df-sdom 8890  df-fin 8891  df-sup 9349  df-inf 9350  df-oi 9419  df-card 9858  df-pnf 11177  df-mnf 11178  df-xr 11179  df-ltxr 11180  df-le 11181  df-sub 11375  df-neg 11376  df-div 11804  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 48129  df-odd 48130  df-gbe 48251  df-gbow 48252
This theorem is referenced by:  stgoldbnnsum4prm  48306
  Copyright terms: Public domain W3C validator