Metamath Proof Explorer


Theorem ppivalnnnprmge6

Description: Value of a term of the prime-counting function pi for positive integers, according to Ján Mináč, for a non-prime number greater than 4. (Contributed by AV, 4-Apr-2026)

Ref Expression
Assertion ppivalnnnprmge6 ⊢ N ∈ ℤ ≥ 6 ∧ N ∉ ℙ → N − 1 ! + 1 N − N − 1 ! N = 0

Proof

Step Hyp Ref Expression
1 nprmdvdsfacm1 ⊢ N ∈ ℤ ≥ 6 ∧ N ∉ ℙ → N ∥ N − 1 !
2 eluzelz ⊢ N ∈ ℤ ≥ 6 → N ∈ ℤ
3 6nn ⊢ 6 ∈ ℕ
4 elnnuz ⊢ 6 ∈ ℕ ↔ 6 ∈ ℤ ≥ 1
5 3 4 mpbi ⊢ 6 ∈ ℤ ≥ 1
6 uzss ⊢ 6 ∈ ℤ ≥ 1 → ℤ ≥ 6 ⊆ ℤ ≥ 1
7 5 6 ax-mp ⊢ ℤ ≥ 6 ⊆ ℤ ≥ 1
8 7 sseli ⊢ N ∈ ℤ ≥ 6 → N ∈ ℤ ≥ 1
9 elnnuz ⊢ N ∈ ℕ ↔ N ∈ ℤ ≥ 1
10 8 9 sylibr ⊢ N ∈ ℤ ≥ 6 → N ∈ ℕ
11 nnm1nn0 ⊢ N ∈ ℕ → N − 1 ∈ ℕ 0
12 10 11 syl ⊢ N ∈ ℤ ≥ 6 → N − 1 ∈ ℕ 0
13 12 faccld ⊢ N ∈ ℤ ≥ 6 → N − 1 ! ∈ ℕ
14 13 nnzd ⊢ N ∈ ℤ ≥ 6 → N − 1 ! ∈ ℤ
15 divides ⊢ N ∈ ℤ ∧ N − 1 ! ∈ ℤ → N ∥ N − 1 ! ↔ ∃ m ∈ ℤ m ⋅ N = N − 1 !
16 2 14 15 syl2anc ⊢ N ∈ ℤ ≥ 6 → N ∥ N − 1 ! ↔ ∃ m ∈ ℤ m ⋅ N = N − 1 !
17 oveq1 ⊢ N − 1 ! = m ⋅ N → N − 1 ! + 1 = m ⋅ N + 1
18 17 oveq1d ⊢ N − 1 ! = m ⋅ N → N − 1 ! + 1 N = m ⋅ N + 1 N
19 fvoveq1 ⊢ N − 1 ! = m ⋅ N → N − 1 ! N = m ⋅ N N
20 18 19 oveq12d ⊢ N − 1 ! = m ⋅ N → N − 1 ! + 1 N − N − 1 ! N = m ⋅ N + 1 N − m ⋅ N N
21 20 fveq2d ⊢ N − 1 ! = m ⋅ N → N − 1 ! + 1 N − N − 1 ! N = m ⋅ N + 1 N − m ⋅ N N
22 21 eqcoms ⊢ m ⋅ N = N − 1 ! → N − 1 ! + 1 N − N − 1 ! N = m ⋅ N + 1 N − m ⋅ N N
23 zcn ⊢ m ∈ ℤ → m ∈ ℂ
24 23 adantl ⊢ N ∈ ℤ ≥ 6 ∧ m ∈ ℤ → m ∈ ℂ
25 eluzelcn ⊢ N ∈ ℤ ≥ 6 → N ∈ ℂ
26 25 adantr ⊢ N ∈ ℤ ≥ 6 ∧ m ∈ ℤ → N ∈ ℂ
27 1cnd ⊢ N ∈ ℤ ≥ 6 ∧ m ∈ ℤ → 1 ∈ ℂ
28 10 nnne0d ⊢ N ∈ ℤ ≥ 6 → N ≠ 0
29 28 adantr ⊢ N ∈ ℤ ≥ 6 ∧ m ∈ ℤ → N ≠ 0
30 24 26 27 29 muldivdid ⊢ N ∈ ℤ ≥ 6 ∧ m ∈ ℤ → m ⋅ N + 1 N = m + 1 N
31 24 26 29 divcan4d ⊢ N ∈ ℤ ≥ 6 ∧ m ∈ ℤ → m ⋅ N N = m
32 31 fveq2d ⊢ N ∈ ℤ ≥ 6 ∧ m ∈ ℤ → m ⋅ N N = m
33 flid ⊢ m ∈ ℤ → m = m
34 33 adantl ⊢ N ∈ ℤ ≥ 6 ∧ m ∈ ℤ → m = m
35 32 34 eqtrd ⊢ N ∈ ℤ ≥ 6 ∧ m ∈ ℤ → m ⋅ N N = m
36 30 35 oveq12d ⊢ N ∈ ℤ ≥ 6 ∧ m ∈ ℤ → m ⋅ N + 1 N − m ⋅ N N = m + 1 N - m
37 36 fveq2d ⊢ N ∈ ℤ ≥ 6 ∧ m ∈ ℤ → m ⋅ N + 1 N − m ⋅ N N = m + 1 N - m
38 25 28 reccld ⊢ N ∈ ℤ ≥ 6 → 1 N ∈ ℂ
39 38 adantr ⊢ N ∈ ℤ ≥ 6 ∧ m ∈ ℤ → 1 N ∈ ℂ
40 24 39 pncan2d ⊢ N ∈ ℤ ≥ 6 ∧ m ∈ ℤ → m + 1 N - m = 1 N
41 40 fveq2d ⊢ N ∈ ℤ ≥ 6 ∧ m ∈ ℤ → m + 1 N - m = 1 N
42 2z ⊢ 2 ∈ ℤ
43 3 nnzi ⊢ 6 ∈ ℤ
44 2re ⊢ 2 ∈ ℝ
45 6re ⊢ 6 ∈ ℝ
46 2lt6 ⊢ 2 < 6
47 44 45 46 ltleii ⊢ 2 ≤ 6
48 eluz2 ⊢ 6 ∈ ℤ ≥ 2 ↔ 2 ∈ ℤ ∧ 6 ∈ ℤ ∧ 2 ≤ 6
49 42 43 47 48 mpbir3an ⊢ 6 ∈ ℤ ≥ 2
50 uzss ⊢ 6 ∈ ℤ ≥ 2 → ℤ ≥ 6 ⊆ ℤ ≥ 2
51 49 50 ax-mp ⊢ ℤ ≥ 6 ⊆ ℤ ≥ 2
52 51 sseli ⊢ N ∈ ℤ ≥ 6 → N ∈ ℤ ≥ 2
53 nnge2recfl0 ⊢ N ∈ ℤ ≥ 2 → 1 N = 0
54 52 53 syl ⊢ N ∈ ℤ ≥ 6 → 1 N = 0
55 54 adantr ⊢ N ∈ ℤ ≥ 6 ∧ m ∈ ℤ → 1 N = 0
56 37 41 55 3eqtrd ⊢ N ∈ ℤ ≥ 6 ∧ m ∈ ℤ → m ⋅ N + 1 N − m ⋅ N N = 0
57 22 56 sylan9eqr ⊢ N ∈ ℤ ≥ 6 ∧ m ∈ ℤ ∧ m ⋅ N = N − 1 ! → N − 1 ! + 1 N − N − 1 ! N = 0
58 57 ex ⊢ N ∈ ℤ ≥ 6 ∧ m ∈ ℤ → m ⋅ N = N − 1 ! → N − 1 ! + 1 N − N − 1 ! N = 0
59 58 rexlimdva ⊢ N ∈ ℤ ≥ 6 → ∃ m ∈ ℤ m ⋅ N = N − 1 ! → N − 1 ! + 1 N − N − 1 ! N = 0
60 16 59 sylbid ⊢ N ∈ ℤ ≥ 6 → N ∥ N − 1 ! → N − 1 ! + 1 N − N − 1 ! N = 0
61 60 adantr ⊢ N ∈ ℤ ≥ 6 ∧ N ∉ ℙ → N ∥ N − 1 ! → N − 1 ! + 1 N − N − 1 ! N = 0
62 1 61 mpd ⊢ N ∈ ℤ ≥ 6 ∧ N ∉ ℙ → N − 1 ! + 1 N − N − 1 ! N = 0