Metamath Proof Explorer


Theorem pcndvds2

Description: The remainder after dividing out all factors of P is not divisible by P . (Contributed by Mario Carneiro, 23-Feb-2014)

Ref Expression
Assertion pcndvds2 ⊢ P ∈ ℙ ∧ N ∈ ℕ → ¬ P ∥ N P P pCnt N

Proof

Step Hyp Ref Expression
1 nnz ⊢ N ∈ ℕ → N ∈ ℤ
2 nnne0 ⊢ N ∈ ℕ → N ≠ 0
3 1 2 jca ⊢ N ∈ ℕ → N ∈ ℤ ∧ N ≠ 0
4 pczndvds2 ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ N ≠ 0 → ¬ P ∥ N P P pCnt N
5 3 4 sylan2 ⊢ P ∈ ℙ ∧ N ∈ ℕ → ¬ P ∥ N P P pCnt N