Metamath Proof Explorer


Theorem pcdvdstr

Description: The prime count increases under the divisibility relation. (Contributed by Mario Carneiro, 13-Mar-2014)

Ref Expression
Assertion pcdvdstr ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ B ∈ ℤ ∧ A ∥ B → P pCnt A ≤ P pCnt B

Proof

Step Hyp Ref Expression
1 0z ⊢ 0 ∈ ℤ
2 zq ⊢ 0 ∈ ℤ → 0 ∈ ℚ
3 1 2 ax-mp ⊢ 0 ∈ ℚ
4 pcxcl ⊢ P ∈ ℙ ∧ 0 ∈ ℚ → P pCnt 0 ∈ ℝ *
5 3 4 mpan2 ⊢ P ∈ ℙ → P pCnt 0 ∈ ℝ *
6 5 xrleidd ⊢ P ∈ ℙ → P pCnt 0 ≤ P pCnt 0
7 6 ad2antrr ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ B ∈ ℤ ∧ A ∥ B ∧ A = 0 → P pCnt 0 ≤ P pCnt 0
8 simpr ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ B ∈ ℤ ∧ A ∥ B ∧ A = 0 → A = 0
9 8 oveq2d ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ B ∈ ℤ ∧ A ∥ B ∧ A = 0 → P pCnt A = P pCnt 0
10 simplr3 ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ B ∈ ℤ ∧ A ∥ B ∧ A = 0 → A ∥ B
11 8 10 eqbrtrrd ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ B ∈ ℤ ∧ A ∥ B ∧ A = 0 → 0 ∥ B
12 simplr2 ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ B ∈ ℤ ∧ A ∥ B ∧ A = 0 → B ∈ ℤ
13 0dvds ⊢ B ∈ ℤ → 0 ∥ B ↔ B = 0
14 12 13 syl ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ B ∈ ℤ ∧ A ∥ B ∧ A = 0 → 0 ∥ B ↔ B = 0
15 11 14 mpbid ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ B ∈ ℤ ∧ A ∥ B ∧ A = 0 → B = 0
16 15 oveq2d ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ B ∈ ℤ ∧ A ∥ B ∧ A = 0 → P pCnt B = P pCnt 0
17 7 9 16 3brtr4d ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ B ∈ ℤ ∧ A ∥ B ∧ A = 0 → P pCnt A ≤ P pCnt B
18 prmnn ⊢ P ∈ ℙ → P ∈ ℕ
19 18 ad2antrr ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ B ∈ ℤ ∧ A ∥ B ∧ A ≠ 0 → P ∈ ℕ
20 simpll ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ B ∈ ℤ ∧ A ∥ B ∧ A ≠ 0 → P ∈ ℙ
21 simplr1 ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ B ∈ ℤ ∧ A ∥ B ∧ A ≠ 0 → A ∈ ℤ
22 simpr ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ B ∈ ℤ ∧ A ∥ B ∧ A ≠ 0 → A ≠ 0
23 pczcl ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ A ≠ 0 → P pCnt A ∈ ℕ 0
24 20 21 22 23 syl12anc ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ B ∈ ℤ ∧ A ∥ B ∧ A ≠ 0 → P pCnt A ∈ ℕ 0
25 19 24 nnexpcld ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ B ∈ ℤ ∧ A ∥ B ∧ A ≠ 0 → P P pCnt A ∈ ℕ
26 25 nnzd ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ B ∈ ℤ ∧ A ∥ B ∧ A ≠ 0 → P P pCnt A ∈ ℤ
27 simplr2 ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ B ∈ ℤ ∧ A ∥ B ∧ A ≠ 0 → B ∈ ℤ
28 pczdvds ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ A ≠ 0 → P P pCnt A ∥ A
29 20 21 22 28 syl12anc ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ B ∈ ℤ ∧ A ∥ B ∧ A ≠ 0 → P P pCnt A ∥ A
30 simplr3 ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ B ∈ ℤ ∧ A ∥ B ∧ A ≠ 0 → A ∥ B
31 26 21 27 29 30 dvdstrd ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ B ∈ ℤ ∧ A ∥ B ∧ A ≠ 0 → P P pCnt A ∥ B
32 pcdvdsb ⊢ P ∈ ℙ ∧ B ∈ ℤ ∧ P pCnt A ∈ ℕ 0 → P pCnt A ≤ P pCnt B ↔ P P pCnt A ∥ B
33 20 27 24 32 syl3anc ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ B ∈ ℤ ∧ A ∥ B ∧ A ≠ 0 → P pCnt A ≤ P pCnt B ↔ P P pCnt A ∥ B
34 31 33 mpbird ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ B ∈ ℤ ∧ A ∥ B ∧ A ≠ 0 → P pCnt A ≤ P pCnt B
35 17 34 pm2.61dane ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ B ∈ ℤ ∧ A ∥ B → P pCnt A ≤ P pCnt B