Metamath Proof Explorer


Theorem prmgaplem1

Description: Lemma for prmgap : The factorial of a number plus an integer greater than 1 and less than or equal to the number is divisible by that integer. (Contributed by AV, 13-Aug-2020)

Ref Expression
Assertion prmgaplem1 ⊢ N ∈ ℕ ∧ I ∈ 2 … N → I ∥ N ! + I

Proof

Step Hyp Ref Expression
1 elfzelz ⊢ I ∈ 2 … N → I ∈ ℤ
2 1 adantl ⊢ N ∈ ℕ ∧ I ∈ 2 … N → I ∈ ℤ
3 nnnn0 ⊢ N ∈ ℕ → N ∈ ℕ 0
4 3 faccld ⊢ N ∈ ℕ → N ! ∈ ℕ
5 4 nnzd ⊢ N ∈ ℕ → N ! ∈ ℤ
6 5 adantr ⊢ N ∈ ℕ ∧ I ∈ 2 … N → N ! ∈ ℤ
7 elfzuz ⊢ I ∈ 2 … N → I ∈ ℤ ≥ 2
8 eluz2nn ⊢ I ∈ ℤ ≥ 2 → I ∈ ℕ
9 7 8 syl ⊢ I ∈ 2 … N → I ∈ ℕ
10 elfzuz3 ⊢ I ∈ 2 … N → N ∈ ℤ ≥ I
11 9 10 jca ⊢ I ∈ 2 … N → I ∈ ℕ ∧ N ∈ ℤ ≥ I
12 11 adantl ⊢ N ∈ ℕ ∧ I ∈ 2 … N → I ∈ ℕ ∧ N ∈ ℤ ≥ I
13 dvdsfac ⊢ I ∈ ℕ ∧ N ∈ ℤ ≥ I → I ∥ N !
14 12 13 syl ⊢ N ∈ ℕ ∧ I ∈ 2 … N → I ∥ N !
15 iddvds ⊢ I ∈ ℤ → I ∥ I
16 1 15 syl ⊢ I ∈ 2 … N → I ∥ I
17 16 adantl ⊢ N ∈ ℕ ∧ I ∈ 2 … N → I ∥ I
18 2 6 2 14 17 dvds2addd ⊢ N ∈ ℕ ∧ I ∈ 2 … N → I ∥ N ! + I