Metamath Proof Explorer


Theorem ppiprm

Description: The prime-counting function ppi at a prime. (Contributed by Mario Carneiro, 19-Sep-2014)

Ref Expression
Assertion ppiprm ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → π _ ⁡ A + 1 = π _ ⁡ A + 1

Proof

Step Hyp Ref Expression
1 fzfid ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → 2 … A ∈ Fin
2 inss1 ⊢ 2 … A ∩ ℙ ⊆ 2 … A
3 ssfi ⊢ 2 … A ∈ Fin ∧ 2 … A ∩ ℙ ⊆ 2 … A → 2 … A ∩ ℙ ∈ Fin
4 1 2 3 sylancl ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → 2 … A ∩ ℙ ∈ Fin
5 zre ⊢ A ∈ ℤ → A ∈ ℝ
6 5 adantr ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → A ∈ ℝ
7 6 ltp1d ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → A < A + 1
8 peano2z ⊢ A ∈ ℤ → A + 1 ∈ ℤ
9 8 adantr ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → A + 1 ∈ ℤ
10 9 zred ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → A + 1 ∈ ℝ
11 6 10 ltnled ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → A < A + 1 ↔ ¬ A + 1 ≤ A
12 7 11 mpbid ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → ¬ A + 1 ≤ A
13 elinel1 ⊢ A + 1 ∈ 2 … A ∩ ℙ → A + 1 ∈ 2 … A
14 elfzle2 ⊢ A + 1 ∈ 2 … A → A + 1 ≤ A
15 13 14 syl ⊢ A + 1 ∈ 2 … A ∩ ℙ → A + 1 ≤ A
16 12 15 nsyl ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → ¬ A + 1 ∈ 2 … A ∩ ℙ
17 ovex ⊢ A + 1 ∈ V
18 hashunsng ⊢ A + 1 ∈ V → 2 … A ∩ ℙ ∈ Fin ∧ ¬ A + 1 ∈ 2 … A ∩ ℙ → 2 … A ∩ ℙ ∪ A + 1 = 2 … A ∩ ℙ + 1
19 17 18 ax-mp ⊢ 2 … A ∩ ℙ ∈ Fin ∧ ¬ A + 1 ∈ 2 … A ∩ ℙ → 2 … A ∩ ℙ ∪ A + 1 = 2 … A ∩ ℙ + 1
20 4 16 19 syl2anc ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → 2 … A ∩ ℙ ∪ A + 1 = 2 … A ∩ ℙ + 1
21 ppival2 ⊢ A + 1 ∈ ℤ → π _ ⁡ A + 1 = 2 … A + 1 ∩ ℙ
22 9 21 syl ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → π _ ⁡ A + 1 = 2 … A + 1 ∩ ℙ
23 2z ⊢ 2 ∈ ℤ
24 zcn ⊢ A ∈ ℤ → A ∈ ℂ
25 24 adantr ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → A ∈ ℂ
26 ax-1cn ⊢ 1 ∈ ℂ
27 pncan ⊢ A ∈ ℂ ∧ 1 ∈ ℂ → A + 1 - 1 = A
28 25 26 27 sylancl ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → A + 1 - 1 = A
29 prmuz2 ⊢ A + 1 ∈ ℙ → A + 1 ∈ ℤ ≥ 2
30 29 adantl ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → A + 1 ∈ ℤ ≥ 2
31 uz2m1nn ⊢ A + 1 ∈ ℤ ≥ 2 → A + 1 - 1 ∈ ℕ
32 30 31 syl ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → A + 1 - 1 ∈ ℕ
33 28 32 eqeltrrd ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → A ∈ ℕ
34 nnuz ⊢ ℕ = ℤ ≥ 1
35 2m1e1 ⊢ 2 − 1 = 1
36 35 fveq2i ⊢ ℤ ≥ 2 − 1 = ℤ ≥ 1
37 34 36 eqtr4i ⊢ ℕ = ℤ ≥ 2 − 1
38 33 37 eleqtrdi ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → A ∈ ℤ ≥ 2 − 1
39 fzsuc2 ⊢ 2 ∈ ℤ ∧ A ∈ ℤ ≥ 2 − 1 → 2 … A + 1 = 2 … A ∪ A + 1
40 23 38 39 sylancr ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → 2 … A + 1 = 2 … A ∪ A + 1
41 40 ineq1d ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → 2 … A + 1 ∩ ℙ = 2 … A ∪ A + 1 ∩ ℙ
42 indir ⊢ 2 … A ∪ A + 1 ∩ ℙ = 2 … A ∩ ℙ ∪ A + 1 ∩ ℙ
43 41 42 eqtrdi ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → 2 … A + 1 ∩ ℙ = 2 … A ∩ ℙ ∪ A + 1 ∩ ℙ
44 simpr ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → A + 1 ∈ ℙ
45 44 snssd ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → A + 1 ⊆ ℙ
46 dfss2 ⊢ A + 1 ⊆ ℙ ↔ A + 1 ∩ ℙ = A + 1
47 45 46 sylib ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → A + 1 ∩ ℙ = A + 1
48 47 uneq2d ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → 2 … A ∩ ℙ ∪ A + 1 ∩ ℙ = 2 … A ∩ ℙ ∪ A + 1
49 43 48 eqtrd ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → 2 … A + 1 ∩ ℙ = 2 … A ∩ ℙ ∪ A + 1
50 49 fveq2d ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → 2 … A + 1 ∩ ℙ = 2 … A ∩ ℙ ∪ A + 1
51 22 50 eqtrd ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → π _ ⁡ A + 1 = 2 … A ∩ ℙ ∪ A + 1
52 ppival2 ⊢ A ∈ ℤ → π _ ⁡ A = 2 … A ∩ ℙ
53 52 adantr ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → π _ ⁡ A = 2 … A ∩ ℙ
54 53 oveq1d ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → π _ ⁡ A + 1 = 2 … A ∩ ℙ + 1
55 20 51 54 3eqtr4d ⊢ A ∈ ℤ ∧ A + 1 ∈ ℙ → π _ ⁡ A + 1 = π _ ⁡ A + 1