Metamath Proof Explorer


Theorem prmndvdsfaclt

Description: A prime number does not divide the factorial of a nonnegative integer less than the prime number. (Contributed by AV, 13-Jul-2021)

Ref Expression
Assertion prmndvdsfaclt ⊢ P ∈ ℙ ∧ N ∈ ℕ 0 → N < P → ¬ P ∥ N !

Proof

Step Hyp Ref Expression
1 nn0re ⊢ N ∈ ℕ 0 → N ∈ ℝ
2 prmnn ⊢ P ∈ ℙ → P ∈ ℕ
3 2 nnred ⊢ P ∈ ℙ → P ∈ ℝ
4 ltnle ⊢ N ∈ ℝ ∧ P ∈ ℝ → N < P ↔ ¬ P ≤ N
5 1 3 4 syl2anr ⊢ P ∈ ℙ ∧ N ∈ ℕ 0 → N < P ↔ ¬ P ≤ N
6 prmfac1 ⊢ N ∈ ℕ 0 ∧ P ∈ ℙ ∧ P ∥ N ! → P ≤ N
7 6 3exp ⊢ N ∈ ℕ 0 → P ∈ ℙ → P ∥ N ! → P ≤ N
8 7 impcom ⊢ P ∈ ℙ ∧ N ∈ ℕ 0 → P ∥ N ! → P ≤ N
9 8 con3d ⊢ P ∈ ℙ ∧ N ∈ ℕ 0 → ¬ P ≤ N → ¬ P ∥ N !
10 5 9 sylbid ⊢ P ∈ ℙ ∧ N ∈ ℕ 0 → N < P → ¬ P ∥ N !