Metamath Proof Explorer


Theorem muldvdsfacm1

Description: The product of two different positive integers less than a third integer divides the factorial of the third integer decreased by 1. By assumption, the third integer must be greater than 3. (Contributed by AV, 6-Apr-2026)

Ref Expression
Assertion muldvdsfacm1 ⊢ A ∈ 1 ..^ B ∧ B ∈ 1 ..^ N → A ⁢ B ∥ N − 1 !

Proof

Step Hyp Ref Expression
1 elfzoelz ⊢ A ∈ 1 ..^ B → A ∈ ℤ
2 elfzoelz ⊢ B ∈ 1 ..^ N → B ∈ ℤ
3 zmulcl ⊢ A ∈ ℤ ∧ B ∈ ℤ → A ⁢ B ∈ ℤ
4 1 2 3 syl2an ⊢ A ∈ 1 ..^ B ∧ B ∈ 1 ..^ N → A ⁢ B ∈ ℤ
5 elfzo2 ⊢ B ∈ 1 ..^ N ↔ B ∈ ℤ ≥ 1 ∧ N ∈ ℤ ∧ B < N
6 elnnuz ⊢ B ∈ ℕ ↔ B ∈ ℤ ≥ 1
7 nnnn0 ⊢ B ∈ ℕ → B ∈ ℕ 0
8 6 7 sylbir ⊢ B ∈ ℤ ≥ 1 → B ∈ ℕ 0
9 8 3ad2ant1 ⊢ B ∈ ℤ ≥ 1 ∧ N ∈ ℤ ∧ B < N → B ∈ ℕ 0
10 5 9 sylbi ⊢ B ∈ 1 ..^ N → B ∈ ℕ 0
11 10 adantl ⊢ A ∈ 1 ..^ B ∧ B ∈ 1 ..^ N → B ∈ ℕ 0
12 11 faccld ⊢ A ∈ 1 ..^ B ∧ B ∈ 1 ..^ N → B ! ∈ ℕ
13 12 nnzd ⊢ A ∈ 1 ..^ B ∧ B ∈ 1 ..^ N → B ! ∈ ℤ
14 simp2 ⊢ B ∈ ℤ ≥ 1 ∧ N ∈ ℤ ∧ B < N → N ∈ ℤ
15 eluz2 ⊢ B ∈ ℤ ≥ 1 ↔ 1 ∈ ℤ ∧ B ∈ ℤ ∧ 1 ≤ B
16 1red ⊢ B ∈ ℤ ∧ N ∈ ℤ → 1 ∈ ℝ
17 zre ⊢ B ∈ ℤ → B ∈ ℝ
18 17 adantr ⊢ B ∈ ℤ ∧ N ∈ ℤ → B ∈ ℝ
19 zre ⊢ N ∈ ℤ → N ∈ ℝ
20 19 adantl ⊢ B ∈ ℤ ∧ N ∈ ℤ → N ∈ ℝ
21 lelttr ⊢ 1 ∈ ℝ ∧ B ∈ ℝ ∧ N ∈ ℝ → 1 ≤ B ∧ B < N → 1 < N
22 16 18 20 21 syl3anc ⊢ B ∈ ℤ ∧ N ∈ ℤ → 1 ≤ B ∧ B < N → 1 < N
23 0lt1 ⊢ 0 < 1
24 0red ⊢ N ∈ ℤ → 0 ∈ ℝ
25 1red ⊢ N ∈ ℤ → 1 ∈ ℝ
26 lttr ⊢ 0 ∈ ℝ ∧ 1 ∈ ℝ ∧ N ∈ ℝ → 0 < 1 ∧ 1 < N → 0 < N
27 24 25 19 26 syl3anc ⊢ N ∈ ℤ → 0 < 1 ∧ 1 < N → 0 < N
28 23 27 mpani ⊢ N ∈ ℤ → 1 < N → 0 < N
29 28 adantl ⊢ B ∈ ℤ ∧ N ∈ ℤ → 1 < N → 0 < N
30 22 29 syld ⊢ B ∈ ℤ ∧ N ∈ ℤ → 1 ≤ B ∧ B < N → 0 < N
31 30 exp4b ⊢ B ∈ ℤ → N ∈ ℤ → 1 ≤ B → B < N → 0 < N
32 31 com23 ⊢ B ∈ ℤ → 1 ≤ B → N ∈ ℤ → B < N → 0 < N
33 32 a1i ⊢ 1 ∈ ℤ → B ∈ ℤ → 1 ≤ B → N ∈ ℤ → B < N → 0 < N
34 33 3imp ⊢ 1 ∈ ℤ ∧ B ∈ ℤ ∧ 1 ≤ B → N ∈ ℤ → B < N → 0 < N
35 15 34 sylbi ⊢ B ∈ ℤ ≥ 1 → N ∈ ℤ → B < N → 0 < N
36 35 3imp ⊢ B ∈ ℤ ≥ 1 ∧ N ∈ ℤ ∧ B < N → 0 < N
37 elnnz ⊢ N ∈ ℕ ↔ N ∈ ℤ ∧ 0 < N
38 14 36 37 sylanbrc ⊢ B ∈ ℤ ≥ 1 ∧ N ∈ ℤ ∧ B < N → N ∈ ℕ
39 nnm1nn0 ⊢ N ∈ ℕ → N − 1 ∈ ℕ 0
40 38 39 syl ⊢ B ∈ ℤ ≥ 1 ∧ N ∈ ℤ ∧ B < N → N − 1 ∈ ℕ 0
41 5 40 sylbi ⊢ B ∈ 1 ..^ N → N − 1 ∈ ℕ 0
42 41 adantl ⊢ A ∈ 1 ..^ B ∧ B ∈ 1 ..^ N → N − 1 ∈ ℕ 0
43 42 faccld ⊢ A ∈ 1 ..^ B ∧ B ∈ 1 ..^ N → N − 1 ! ∈ ℕ
44 43 nnzd ⊢ A ∈ 1 ..^ B ∧ B ∈ 1 ..^ N → N − 1 ! ∈ ℤ
45 muldvdsfacgt ⊢ A ∈ 1 ..^ B → A ⁢ B ∥ B !
46 45 adantr ⊢ A ∈ 1 ..^ B ∧ B ∈ 1 ..^ N → A ⁢ B ∥ B !
47 1eluzge0 ⊢ 1 ∈ ℤ ≥ 0
48 fzoss1 ⊢ 1 ∈ ℤ ≥ 0 → 1 ..^ N ⊆ 0 ..^ N
49 48 sseld ⊢ 1 ∈ ℤ ≥ 0 → B ∈ 1 ..^ N → B ∈ 0 ..^ N
50 47 49 ax-mp ⊢ B ∈ 1 ..^ N → B ∈ 0 ..^ N
51 elfzoel2 ⊢ B ∈ 1 ..^ N → N ∈ ℤ
52 fzoval ⊢ N ∈ ℤ → 0 ..^ N = 0 … N − 1
53 52 eleq2d ⊢ N ∈ ℤ → B ∈ 0 ..^ N ↔ B ∈ 0 … N − 1
54 51 53 syl ⊢ B ∈ 1 ..^ N → B ∈ 0 ..^ N ↔ B ∈ 0 … N − 1
55 50 54 mpbid ⊢ B ∈ 1 ..^ N → B ∈ 0 … N − 1
56 55 adantl ⊢ A ∈ 1 ..^ B ∧ B ∈ 1 ..^ N → B ∈ 0 … N − 1
57 facnn0dvdsfac ⊢ B ∈ 0 … N − 1 → B ! ∥ N − 1 !
58 56 57 syl ⊢ A ∈ 1 ..^ B ∧ B ∈ 1 ..^ N → B ! ∥ N − 1 !
59 4 13 44 46 58 dvdstrd ⊢ A ∈ 1 ..^ B ∧ B ∈ 1 ..^ N → A ⁢ B ∥ N − 1 !