Metamath Proof Explorer


Theorem prmolelcmf

Description: The primorial of a positive integer is less than or equal to the least common multiple of all positive integers less than or equal to the integer. (Contributed by AV, 19-Aug-2020) (Revised by AV, 29-Aug-2020)

Ref Expression
Assertion prmolelcmf ⊢ N ∈ ℕ 0 → # p ⁡ N ≤ lcm _ ⁡ 1 … N

Proof

Step Hyp Ref Expression
1 prmocl ⊢ N ∈ ℕ 0 → # p ⁡ N ∈ ℕ
2 1 nnzd ⊢ N ∈ ℕ 0 → # p ⁡ N ∈ ℤ
3 fzssz ⊢ 1 … N ⊆ ℤ
4 fzfid ⊢ N ∈ ℕ 0 → 1 … N ∈ Fin
5 0nelfz1 ⊢ 0 ∉ 1 … N
6 5 a1i ⊢ N ∈ ℕ 0 → 0 ∉ 1 … N
7 lcmfn0cl ⊢ 1 … N ⊆ ℤ ∧ 1 … N ∈ Fin ∧ 0 ∉ 1 … N → lcm _ ⁡ 1 … N ∈ ℕ
8 3 4 6 7 mp3an2i ⊢ N ∈ ℕ 0 → lcm _ ⁡ 1 … N ∈ ℕ
9 2 8 jca ⊢ N ∈ ℕ 0 → # p ⁡ N ∈ ℤ ∧ lcm _ ⁡ 1 … N ∈ ℕ
10 prmodvdslcmf ⊢ N ∈ ℕ 0 → # p ⁡ N ∥ lcm _ ⁡ 1 … N
11 dvdsle ⊢ # p ⁡ N ∈ ℤ ∧ lcm _ ⁡ 1 … N ∈ ℕ → # p ⁡ N ∥ lcm _ ⁡ 1 … N → # p ⁡ N ≤ lcm _ ⁡ 1 … N
12 9 10 11 sylc ⊢ N ∈ ℕ 0 → # p ⁡ N ≤ lcm _ ⁡ 1 … N