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 48269
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 12556 . . . . . . 7 2 ∈ ℤ
2 9nn 12276 . . . . . . . 8 9 ∈ ℕ
32nnzi 12548 . . . . . . 7 9 ∈ ℤ
4 2re 12252 . . . . . . . 8 2 ∈ ℝ
5 9re 12277 . . . . . . . 8 9 ∈ ℝ
6 2lt9 12378 . . . . . . . 8 2 < 9
74, 5, 6ltleii 11266 . . . . . . 7 2 ≤ 9
8 eluz2 12791 . . . . . . 7 (9 ∈ (ℤ‘2) ↔ (2 ∈ ℤ ∧ 9 ∈ ℤ ∧ 2 ≤ 9))
91, 3, 7, 8mpbir3an 1343 . . . . . 6 9 ∈ (ℤ‘2)
10 fzouzsplit 13646 . . . . . . 7 (9 ∈ (ℤ‘2) → (ℤ‘2) = ((2..^9) ∪ (ℤ‘9)))
1110eleq2d 2823 . . . . . 6 (9 ∈ (ℤ‘2) → (𝑛 ∈ (ℤ‘2) ↔ 𝑛 ∈ ((2..^9) ∪ (ℤ‘9))))
129, 11ax-mp 5 . . . . 5 (𝑛 ∈ (ℤ‘2) ↔ 𝑛 ∈ ((2..^9) ∪ (ℤ‘9)))
13 elun 4094 . . . . 5 (𝑛 ∈ ((2..^9) ∪ (ℤ‘9)) ↔ (𝑛 ∈ (2..^9) ∨ 𝑛 ∈ (ℤ‘9)))
1412, 13bitri 275 . . . 4 (𝑛 ∈ (ℤ‘2) ↔ (𝑛 ∈ (2..^9) ∨ 𝑛 ∈ (ℤ‘9)))
15 elfzo2 13613 . . . . . . . 8 (𝑛 ∈ (2..^9) ↔ (𝑛 ∈ (ℤ‘2) ∧ 9 ∈ ℤ ∧ 𝑛 < 9))
16 simp1 1137 . . . . . . . . 9 ((𝑛 ∈ (ℤ‘2) ∧ 9 ∈ ℤ ∧ 𝑛 < 9) → 𝑛 ∈ (ℤ‘2))
17 df-9 12248 . . . . . . . . . . . 12 9 = (8 + 1)
1817breq2i 5094 . . . . . . . . . . 11 (𝑛 < 9 ↔ 𝑛 < (8 + 1))
19 eluz2nn 12835 . . . . . . . . . . . . . . 15 (𝑛 ∈ (ℤ‘2) → 𝑛 ∈ ℕ)
20 8nn 12273 . . . . . . . . . . . . . . 15 8 ∈ ℕ
2119, 20jctir 520 . . . . . . . . . . . . . 14 (𝑛 ∈ (ℤ‘2) → (𝑛 ∈ ℕ ∧ 8 ∈ ℕ))
2221adantr 480 . . . . . . . . . . . . 13 ((𝑛 ∈ (ℤ‘2) ∧ 9 ∈ ℤ) → (𝑛 ∈ ℕ ∧ 8 ∈ ℕ))
23 nnleltp1 12581 . . . . . . . . . . . . 13 ((𝑛 ∈ ℕ ∧ 8 ∈ ℕ) → (𝑛 ≤ 8 ↔ 𝑛 < (8 + 1)))
2422, 23syl 17 . . . . . . . . . . . 12 ((𝑛 ∈ (ℤ‘2) ∧ 9 ∈ ℤ) → (𝑛 ≤ 8 ↔ 𝑛 < (8 + 1)))
2524biimprd 248 . . . . . . . . . . 11 ((𝑛 ∈ (ℤ‘2) ∧ 9 ∈ ℤ) → (𝑛 < (8 + 1) → 𝑛 ≤ 8))
2618, 25biimtrid 242 . . . . . . . . . 10 ((𝑛 ∈ (ℤ‘2) ∧ 9 ∈ ℤ) → (𝑛 < 9 → 𝑛 ≤ 8))
27263impia 1118 . . . . . . . . 9 ((𝑛 ∈ (ℤ‘2) ∧ 9 ∈ ℤ ∧ 𝑛 < 9) → 𝑛 ≤ 8)
2816, 27jca 511 . . . . . . . 8 ((𝑛 ∈ (ℤ‘2) ∧ 9 ∈ ℤ ∧ 𝑛 < 9) → (𝑛 ∈ (ℤ‘2) ∧ 𝑛 ≤ 8))
2915, 28sylbi 217 . . . . . . 7 (𝑛 ∈ (2..^9) → (𝑛 ∈ (ℤ‘2) ∧ 𝑛 ≤ 8))
30 nnsum4primesle9 48262 . . . . . . 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 12261 . . . . . . . . 9 4 ∈ ℕ
3433a1i 11 . . . . . . . 8 (((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Even ) ∧ ∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW )) → 4 ∈ ℕ)
35 oveq2 7372 . . . . . . . . . . 11 (𝑑 = 4 → (1...𝑑) = (1...4))
3635oveq2d 7380 . . . . . . . . . 10 (𝑑 = 4 → (ℙ ↑m (1...𝑑)) = (ℙ ↑m (1...4)))
37 breq1 5089 . . . . . . . . . . 11 (𝑑 = 4 → (𝑑 ≤ 4 ↔ 4 ≤ 4))
3835sumeq1d 15659 . . . . . . . . . . . 12 (𝑑 = 4 → Σ𝑘 ∈ (1...𝑑)(𝑓𝑘) = Σ𝑘 ∈ (1...4)(𝑓𝑘))
3938eqeq2d 2748 . . . . . . . . . . 11 (𝑑 = 4 → (𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘) ↔ 𝑛 = Σ𝑘 ∈ (1...4)(𝑓𝑘)))
4037, 39anbi12d 633 . . . . . . . . . 10 (𝑑 = 4 → ((𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘)) ↔ (4 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...4)(𝑓𝑘))))
4136, 40rexeqbidv 3313 . . . . . . . . 9 (𝑑 = 4 → (∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘)) ↔ ∃𝑓 ∈ (ℙ ↑m (1...4))(4 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...4)(𝑓𝑘))))
4241adantl 481 . . . . . . . 8 ((((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Even ) ∧ ∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW )) ∧ 𝑑 = 4) → (∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘)) ↔ ∃𝑓 ∈ (ℙ ↑m (1...4))(4 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...4)(𝑓𝑘))))
43 4re 12262 . . . . . . . . . . 11 4 ∈ ℝ
4443leidi 11681 . . . . . . . . . 10 4 ≤ 4
4544a1i 11 . . . . . . . . 9 (((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Even ) ∧ ∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW )) → 4 ≤ 4)
46 nnsum4primeseven 48267 . . . . . . . . . 10 (∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW ) → ((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Even ) → ∃𝑓 ∈ (ℙ ↑m (1...4))𝑛 = Σ𝑘 ∈ (1...4)(𝑓𝑘)))
4746impcom 407 . . . . . . . . 9 (((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Even ) ∧ ∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW )) → ∃𝑓 ∈ (ℙ ↑m (1...4))𝑛 = Σ𝑘 ∈ (1...4)(𝑓𝑘))
48 r19.42v 3170 . . . . . . . . 9 (∃𝑓 ∈ (ℙ ↑m (1...4))(4 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...4)(𝑓𝑘)) ↔ (4 ≤ 4 ∧ ∃𝑓 ∈ (ℙ ↑m (1...4))𝑛 = Σ𝑘 ∈ (1...4)(𝑓𝑘)))
4945, 47, 48sylanbrc 584 . . . . . . . 8 (((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Even ) ∧ ∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW )) → ∃𝑓 ∈ (ℙ ↑m (1...4))(4 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...4)(𝑓𝑘)))
5034, 42, 49rspcedvd 3567 . . . . . . 7 (((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Even ) ∧ ∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW )) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘)))
5150ex 412 . . . . . 6 ((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Even ) → (∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘))))
52 3nn 12257 . . . . . . . . 9 3 ∈ ℕ
5352a1i 11 . . . . . . . 8 (((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW )) → 3 ∈ ℕ)
54 oveq2 7372 . . . . . . . . . . 11 (𝑑 = 3 → (1...𝑑) = (1...3))
5554oveq2d 7380 . . . . . . . . . 10 (𝑑 = 3 → (ℙ ↑m (1...𝑑)) = (ℙ ↑m (1...3)))
56 breq1 5089 . . . . . . . . . . 11 (𝑑 = 3 → (𝑑 ≤ 4 ↔ 3 ≤ 4))
5754sumeq1d 15659 . . . . . . . . . . . 12 (𝑑 = 3 → Σ𝑘 ∈ (1...𝑑)(𝑓𝑘) = Σ𝑘 ∈ (1...3)(𝑓𝑘))
5857eqeq2d 2748 . . . . . . . . . . 11 (𝑑 = 3 → (𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘) ↔ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓𝑘)))
5956, 58anbi12d 633 . . . . . . . . . 10 (𝑑 = 3 → ((𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘)) ↔ (3 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓𝑘))))
6055, 59rexeqbidv 3313 . . . . . . . . 9 (𝑑 = 3 → (∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘)) ↔ ∃𝑓 ∈ (ℙ ↑m (1...3))(3 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓𝑘))))
6160adantl 481 . . . . . . . 8 ((((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW )) ∧ 𝑑 = 3) → (∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘)) ↔ ∃𝑓 ∈ (ℙ ↑m (1...3))(3 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓𝑘))))
62 3re 12258 . . . . . . . . . . 11 3 ∈ ℝ
63 3lt4 12347 . . . . . . . . . . 11 3 < 4
6462, 43, 63ltleii 11266 . . . . . . . . . 10 3 ≤ 4
6564a1i 11 . . . . . . . . 9 (((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW )) → 3 ≤ 4)
66 6nn 12267 . . . . . . . . . . . . 13 6 ∈ ℕ
6766nnzi 12548 . . . . . . . . . . . 12 6 ∈ ℤ
68 6re 12268 . . . . . . . . . . . . 13 6 ∈ ℝ
69 6lt9 12374 . . . . . . . . . . . . 13 6 < 9
7068, 5, 69ltleii 11266 . . . . . . . . . . . 12 6 ≤ 9
71 eluzuzle 12794 . . . . . . . . . . . 12 ((6 ∈ ℤ ∧ 6 ≤ 9) → (𝑛 ∈ (ℤ‘9) → 𝑛 ∈ (ℤ‘6)))
7267, 70, 71mp2an 693 . . . . . . . . . . 11 (𝑛 ∈ (ℤ‘9) → 𝑛 ∈ (ℤ‘6))
7372anim1i 616 . . . . . . . . . 10 ((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Odd ) → (𝑛 ∈ (ℤ‘6) ∧ 𝑛 ∈ Odd ))
74 nnsum4primesodd 48263 . . . . . . . . . 10 (∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW ) → ((𝑛 ∈ (ℤ‘6) ∧ 𝑛 ∈ Odd ) → ∃𝑓 ∈ (ℙ ↑m (1...3))𝑛 = Σ𝑘 ∈ (1...3)(𝑓𝑘)))
7573, 74mpan9 506 . . . . . . . . 9 (((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW )) → ∃𝑓 ∈ (ℙ ↑m (1...3))𝑛 = Σ𝑘 ∈ (1...3)(𝑓𝑘))
76 r19.42v 3170 . . . . . . . . 9 (∃𝑓 ∈ (ℙ ↑m (1...3))(3 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓𝑘)) ↔ (3 ≤ 4 ∧ ∃𝑓 ∈ (ℙ ↑m (1...3))𝑛 = Σ𝑘 ∈ (1...3)(𝑓𝑘)))
7765, 75, 76sylanbrc 584 . . . . . . . 8 (((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW )) → ∃𝑓 ∈ (ℙ ↑m (1...3))(3 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...3)(𝑓𝑘)))
7853, 61, 77rspcedvd 3567 . . . . . . 7 (((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Odd ) ∧ ∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW )) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘)))
7978ex 412 . . . . . 6 ((𝑛 ∈ (ℤ‘9) ∧ 𝑛 ∈ Odd ) → (∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘))))
80 eluzelz 12795 . . . . . . 7 (𝑛 ∈ (ℤ‘9) → 𝑛 ∈ ℤ)
81 zeoALTV 48137 . . . . . . 7 (𝑛 ∈ ℤ → (𝑛 ∈ Even ∨ 𝑛 ∈ Odd ))
8280, 81syl 17 . . . . . 6 (𝑛 ∈ (ℤ‘9) → (𝑛 ∈ Even ∨ 𝑛 ∈ Odd ))
8351, 79, 82mpjaodan 961 . . . . 5 (𝑛 ∈ (ℤ‘9) → (∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘))))
8432, 83jaoi 858 . . . 4 ((𝑛 ∈ (2..^9) ∨ 𝑛 ∈ (ℤ‘9)) → (∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘))))
8514, 84sylbi 217 . . 3 (𝑛 ∈ (ℤ‘2) → (∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW ) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘))))
8685impcom 407 . 2 ((∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW ) ∧ 𝑛 ∈ (ℤ‘2)) → ∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘)))
8786ralrimiva 3130 1 (∀𝑚 ∈ Odd (5 < 𝑚𝑚 ∈ GoldbachOddW ) → ∀𝑛 ∈ (ℤ‘2)∃𝑑 ∈ ℕ ∃𝑓 ∈ (ℙ ↑m (1...𝑑))(𝑑 ≤ 4 ∧ 𝑛 = Σ𝑘 ∈ (1...𝑑)(𝑓𝑘)))
Colors of variables: wff setvar class
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 6496  (class class class)co 7364  m cmap 8770  1c1 11036   + caddc 11038   < clt 11176  cle 11177  cn 12171  2c2 12233  3c3 12234  4c4 12235  5c5 12236  6c6 12237  8c8 12239  9c9 12240  cz 12521  cuz 12785  ...cfz 13458  ..^cfzo 13605  Σcsu 15645  cprime 16637   Even ceven 48091   Odd codd 48092   GoldbachOddW cgbow 48213
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 5306  ax-pr 5374  ax-un 7686  ax-inf2 9559  ax-cnex 11091  ax-resscn 11092  ax-1cn 11093  ax-icn 11094  ax-addcl 11095  ax-addrcl 11096  ax-mulcl 11097  ax-mulrcl 11098  ax-mulcom 11099  ax-addass 11100  ax-mulass 11101  ax-distr 11102  ax-i2m1 11103  ax-1ne0 11104  ax-1rid 11105  ax-rnegex 11106  ax-rrecex 11107  ax-cnre 11108  ax-pre-lttri 11109  ax-pre-lttrn 11110  ax-pre-ltadd 11111  ax-pre-mulgt0 11112  ax-pre-sup 11113
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 5523  df-eprel 5528  df-po 5536  df-so 5537  df-fr 5581  df-se 5582  df-we 5583  df-xp 5634  df-rel 5635  df-cnv 5636  df-co 5637  df-dm 5638  df-rn 5639  df-res 5640  df-ima 5641  df-pred 6263  df-ord 6324  df-on 6325  df-lim 6326  df-suc 6327  df-iota 6452  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-isom 6505  df-riota 7321  df-ov 7367  df-oprab 7368  df-mpo 7369  df-om 7815  df-1st 7939  df-2nd 7940  df-frecs 8228  df-wrecs 8259  df-recs 8308  df-rdg 8346  df-1o 8402  df-2o 8403  df-er 8640  df-map 8772  df-en 8891  df-dom 8892  df-sdom 8893  df-fin 8894  df-sup 9352  df-inf 9353  df-oi 9422  df-card 9860  df-pnf 11178  df-mnf 11179  df-xr 11180  df-ltxr 11181  df-le 11182  df-sub 11376  df-neg 11377  df-div 11805  df-nn 12172  df-2 12241  df-3 12242  df-4 12243  df-5 12244  df-6 12245  df-7 12246  df-8 12247  df-9 12248  df-n0 12435  df-z 12522  df-dec 12642  df-uz 12786  df-rp 12940  df-fz 13459  df-fzo 13606  df-seq 13961  df-exp 14021  df-hash 14290  df-cj 15058  df-re 15059  df-im 15060  df-sqrt 15194  df-abs 15195  df-clim 15447  df-sum 15646  df-dvds 16219  df-prm 16638  df-even 48093  df-odd 48094  df-gbe 48215  df-gbow 48216
This theorem is referenced by:  stgoldbnnsum4prm  48270
  Copyright terms: Public domain W3C validator