Metamath Proof Explorer


Theorem ppiltx

Description: The prime-counting function ppi is strictly less than the identity. (Contributed by Mario Carneiro, 22-Sep-2014)

Ref Expression
Assertion ppiltx ⊢ A ∈ ℝ + → π _ ⁡ A < A

Proof

Step Hyp Ref Expression
1 rpre ⊢ A ∈ ℝ + → A ∈ ℝ
2 ppicl ⊢ A ∈ ℝ → π _ ⁡ A ∈ ℕ 0
3 1 2 syl ⊢ A ∈ ℝ + → π _ ⁡ A ∈ ℕ 0
4 3 nn0red ⊢ A ∈ ℝ + → π _ ⁡ A ∈ ℝ
5 4 adantr ⊢ A ∈ ℝ + ∧ A ∈ ℕ → π _ ⁡ A ∈ ℝ
6 reflcl ⊢ A ∈ ℝ → A ∈ ℝ
7 1 6 syl ⊢ A ∈ ℝ + → A ∈ ℝ
8 7 adantr ⊢ A ∈ ℝ + ∧ A ∈ ℕ → A ∈ ℝ
9 1 adantr ⊢ A ∈ ℝ + ∧ A ∈ ℕ → A ∈ ℝ
10 fzfi ⊢ 1 … A ∈ Fin
11 inss1 ⊢ 2 … A ∩ ℙ ⊆ 2 … A
12 2eluzge1 ⊢ 2 ∈ ℤ ≥ 1
13 fzss1 ⊢ 2 ∈ ℤ ≥ 1 → 2 … A ⊆ 1 … A
14 12 13 mp1i ⊢ A ∈ ℝ + ∧ A ∈ ℕ → 2 … A ⊆ 1 … A
15 simpr ⊢ A ∈ ℝ + ∧ A ∈ ℕ → A ∈ ℕ
16 nnuz ⊢ ℕ = ℤ ≥ 1
17 15 16 eleqtrdi ⊢ A ∈ ℝ + ∧ A ∈ ℕ → A ∈ ℤ ≥ 1
18 eluzfz1 ⊢ A ∈ ℤ ≥ 1 → 1 ∈ 1 … A
19 17 18 syl ⊢ A ∈ ℝ + ∧ A ∈ ℕ → 1 ∈ 1 … A
20 1lt2 ⊢ 1 < 2
21 1re ⊢ 1 ∈ ℝ
22 2re ⊢ 2 ∈ ℝ
23 21 22 ltnlei ⊢ 1 < 2 ↔ ¬ 2 ≤ 1
24 20 23 mpbi ⊢ ¬ 2 ≤ 1
25 elfzle1 ⊢ 1 ∈ 2 … A → 2 ≤ 1
26 24 25 mto ⊢ ¬ 1 ∈ 2 … A
27 nelne1 ⊢ 1 ∈ 1 … A ∧ ¬ 1 ∈ 2 … A → 1 … A ≠ 2 … A
28 19 26 27 sylancl ⊢ A ∈ ℝ + ∧ A ∈ ℕ → 1 … A ≠ 2 … A
29 28 necomd ⊢ A ∈ ℝ + ∧ A ∈ ℕ → 2 … A ≠ 1 … A
30 df-pss ⊢ 2 … A ⊂ 1 … A ↔ 2 … A ⊆ 1 … A ∧ 2 … A ≠ 1 … A
31 14 29 30 sylanbrc ⊢ A ∈ ℝ + ∧ A ∈ ℕ → 2 … A ⊂ 1 … A
32 sspsstr ⊢ 2 … A ∩ ℙ ⊆ 2 … A ∧ 2 … A ⊂ 1 … A → 2 … A ∩ ℙ ⊂ 1 … A
33 11 31 32 sylancr ⊢ A ∈ ℝ + ∧ A ∈ ℕ → 2 … A ∩ ℙ ⊂ 1 … A
34 php3 ⊢ 1 … A ∈ Fin ∧ 2 … A ∩ ℙ ⊂ 1 … A → 2 … A ∩ ℙ ≺ 1 … A
35 10 33 34 sylancr ⊢ A ∈ ℝ + ∧ A ∈ ℕ → 2 … A ∩ ℙ ≺ 1 … A
36 fzfi ⊢ 2 … A ∈ Fin
37 ssfi ⊢ 2 … A ∈ Fin ∧ 2 … A ∩ ℙ ⊆ 2 … A → 2 … A ∩ ℙ ∈ Fin
38 36 11 37 mp2an ⊢ 2 … A ∩ ℙ ∈ Fin
39 hashsdom ⊢ 2 … A ∩ ℙ ∈ Fin ∧ 1 … A ∈ Fin → 2 … A ∩ ℙ < 1 … A ↔ 2 … A ∩ ℙ ≺ 1 … A
40 38 10 39 mp2an ⊢ 2 … A ∩ ℙ < 1 … A ↔ 2 … A ∩ ℙ ≺ 1 … A
41 35 40 sylibr ⊢ A ∈ ℝ + ∧ A ∈ ℕ → 2 … A ∩ ℙ < 1 … A
42 1 flcld ⊢ A ∈ ℝ + → A ∈ ℤ
43 ppival2 ⊢ A ∈ ℤ → π _ ⁡ A = 2 … A ∩ ℙ
44 42 43 syl ⊢ A ∈ ℝ + → π _ ⁡ A = 2 … A ∩ ℙ
45 ppifl ⊢ A ∈ ℝ → π _ ⁡ A = π _ ⁡ A
46 1 45 syl ⊢ A ∈ ℝ + → π _ ⁡ A = π _ ⁡ A
47 44 46 eqtr3d ⊢ A ∈ ℝ + → 2 … A ∩ ℙ = π _ ⁡ A
48 47 adantr ⊢ A ∈ ℝ + ∧ A ∈ ℕ → 2 … A ∩ ℙ = π _ ⁡ A
49 rpge0 ⊢ A ∈ ℝ + → 0 ≤ A
50 flge0nn0 ⊢ A ∈ ℝ ∧ 0 ≤ A → A ∈ ℕ 0
51 1 49 50 syl2anc ⊢ A ∈ ℝ + → A ∈ ℕ 0
52 hashfz1 ⊢ A ∈ ℕ 0 → 1 … A = A
53 51 52 syl ⊢ A ∈ ℝ + → 1 … A = A
54 53 adantr ⊢ A ∈ ℝ + ∧ A ∈ ℕ → 1 … A = A
55 41 48 54 3brtr3d ⊢ A ∈ ℝ + ∧ A ∈ ℕ → π _ ⁡ A < A
56 flle ⊢ A ∈ ℝ → A ≤ A
57 9 56 syl ⊢ A ∈ ℝ + ∧ A ∈ ℕ → A ≤ A
58 5 8 9 55 57 ltletrd ⊢ A ∈ ℝ + ∧ A ∈ ℕ → π _ ⁡ A < A
59 46 adantr ⊢ A ∈ ℝ + ∧ A = 0 → π _ ⁡ A = π _ ⁡ A
60 simpr ⊢ A ∈ ℝ + ∧ A = 0 → A = 0
61 60 fveq2d ⊢ A ∈ ℝ + ∧ A = 0 → π _ ⁡ A = π _ ⁡ 0
62 2pos ⊢ 0 < 2
63 0re ⊢ 0 ∈ ℝ
64 ppieq0 ⊢ 0 ∈ ℝ → π _ ⁡ 0 = 0 ↔ 0 < 2
65 63 64 ax-mp ⊢ π _ ⁡ 0 = 0 ↔ 0 < 2
66 62 65 mpbir ⊢ π _ ⁡ 0 = 0
67 61 66 eqtrdi ⊢ A ∈ ℝ + ∧ A = 0 → π _ ⁡ A = 0
68 59 67 eqtr3d ⊢ A ∈ ℝ + ∧ A = 0 → π _ ⁡ A = 0
69 rpgt0 ⊢ A ∈ ℝ + → 0 < A
70 69 adantr ⊢ A ∈ ℝ + ∧ A = 0 → 0 < A
71 68 70 eqbrtrd ⊢ A ∈ ℝ + ∧ A = 0 → π _ ⁡ A < A
72 elnn0 ⊢ A ∈ ℕ 0 ↔ A ∈ ℕ ∨ A = 0
73 51 72 sylib ⊢ A ∈ ℝ + → A ∈ ℕ ∨ A = 0
74 58 71 73 mpjaodan ⊢ A ∈ ℝ + → π _ ⁡ A < A