Metamath Proof Explorer


Theorem nprmmul3

Description: Special factorization of a non-prime integer greater than 3. (Contributed by AV, 4-Apr-2026)

Ref Expression
Assertion nprmmul3 ⊢ N ∈ ℤ ≥ 4 → N ∉ ℙ ↔ ∃ a ∈ 2 ..^ N ∃ b ∈ 2 ..^ N a < b ∧ N = a ⁢ b ∨ ∃ a ∈ 2 ..^ N N = a 2

Proof

Step Hyp Ref Expression
1 nprmmul2 ⊢ N ∈ ℤ ≥ 4 → N ∉ ℙ ↔ ∃ a ∈ 2 ..^ N ∃ b ∈ 2 ..^ N a ≤ b ∧ N = a ⁢ b
2 elfzoelz ⊢ a ∈ 2 ..^ N → a ∈ ℤ
3 2 zred ⊢ a ∈ 2 ..^ N → a ∈ ℝ
4 3 adantl ⊢ N ∈ ℤ ≥ 4 ∧ a ∈ 2 ..^ N → a ∈ ℝ
5 elfzoelz ⊢ b ∈ 2 ..^ N → b ∈ ℤ
6 5 zred ⊢ b ∈ 2 ..^ N → b ∈ ℝ
7 leloe ⊢ a ∈ ℝ ∧ b ∈ ℝ → a ≤ b ↔ a < b ∨ a = b
8 4 6 7 syl2an ⊢ N ∈ ℤ ≥ 4 ∧ a ∈ 2 ..^ N ∧ b ∈ 2 ..^ N → a ≤ b ↔ a < b ∨ a = b
9 8 anbi1d ⊢ N ∈ ℤ ≥ 4 ∧ a ∈ 2 ..^ N ∧ b ∈ 2 ..^ N → a ≤ b ∧ N = a ⁢ b ↔ a < b ∨ a = b ∧ N = a ⁢ b
10 andir ⊢ a < b ∨ a = b ∧ N = a ⁢ b ↔ a < b ∧ N = a ⁢ b ∨ a = b ∧ N = a ⁢ b
11 9 10 bitrdi ⊢ N ∈ ℤ ≥ 4 ∧ a ∈ 2 ..^ N ∧ b ∈ 2 ..^ N → a ≤ b ∧ N = a ⁢ b ↔ a < b ∧ N = a ⁢ b ∨ a = b ∧ N = a ⁢ b
12 11 rexbidva ⊢ N ∈ ℤ ≥ 4 ∧ a ∈ 2 ..^ N → ∃ b ∈ 2 ..^ N a ≤ b ∧ N = a ⁢ b ↔ ∃ b ∈ 2 ..^ N a < b ∧ N = a ⁢ b ∨ a = b ∧ N = a ⁢ b
13 r19.43 ⊢ ∃ b ∈ 2 ..^ N a < b ∧ N = a ⁢ b ∨ a = b ∧ N = a ⁢ b ↔ ∃ b ∈ 2 ..^ N a < b ∧ N = a ⁢ b ∨ ∃ b ∈ 2 ..^ N a = b ∧ N = a ⁢ b
14 oveq2 ⊢ b = a → a ⁢ b = a ⁢ a
15 14 equcoms ⊢ a = b → a ⁢ b = a ⁢ a
16 15 adantl ⊢ a ∈ 2 ..^ N ∧ a = b → a ⁢ b = a ⁢ a
17 2 zcnd ⊢ a ∈ 2 ..^ N → a ∈ ℂ
18 17 sqvald ⊢ a ∈ 2 ..^ N → a 2 = a ⁢ a
19 18 adantr ⊢ a ∈ 2 ..^ N ∧ a = b → a 2 = a ⁢ a
20 16 19 eqtr4d ⊢ a ∈ 2 ..^ N ∧ a = b → a ⁢ b = a 2
21 20 eqeq2d ⊢ a ∈ 2 ..^ N ∧ a = b → N = a ⁢ b ↔ N = a 2
22 21 biimpd ⊢ a ∈ 2 ..^ N ∧ a = b → N = a ⁢ b → N = a 2
23 22 ex ⊢ a ∈ 2 ..^ N → a = b → N = a ⁢ b → N = a 2
24 23 adantl ⊢ N ∈ ℤ ≥ 4 ∧ a ∈ 2 ..^ N → a = b → N = a ⁢ b → N = a 2
25 24 impd ⊢ N ∈ ℤ ≥ 4 ∧ a ∈ 2 ..^ N → a = b ∧ N = a ⁢ b → N = a 2
26 25 a1d ⊢ N ∈ ℤ ≥ 4 ∧ a ∈ 2 ..^ N → b ∈ 2 ..^ N → a = b ∧ N = a ⁢ b → N = a 2
27 26 rexlimdv ⊢ N ∈ ℤ ≥ 4 ∧ a ∈ 2 ..^ N → ∃ b ∈ 2 ..^ N a = b ∧ N = a ⁢ b → N = a 2
28 simplr ⊢ N ∈ ℤ ≥ 4 ∧ a ∈ 2 ..^ N ∧ N = a 2 → a ∈ 2 ..^ N
29 equequ2 ⊢ b = a → a = b ↔ a = a
30 14 eqeq2d ⊢ b = a → N = a ⁢ b ↔ N = a ⁢ a
31 29 30 anbi12d ⊢ b = a → a = b ∧ N = a ⁢ b ↔ a = a ∧ N = a ⁢ a
32 31 adantl ⊢ N ∈ ℤ ≥ 4 ∧ a ∈ 2 ..^ N ∧ N = a 2 ∧ b = a → a = b ∧ N = a ⁢ b ↔ a = a ∧ N = a ⁢ a
33 18 eqeq2d ⊢ a ∈ 2 ..^ N → N = a 2 ↔ N = a ⁢ a
34 33 biimpd ⊢ a ∈ 2 ..^ N → N = a 2 → N = a ⁢ a
35 34 adantl ⊢ N ∈ ℤ ≥ 4 ∧ a ∈ 2 ..^ N → N = a 2 → N = a ⁢ a
36 35 imp ⊢ N ∈ ℤ ≥ 4 ∧ a ∈ 2 ..^ N ∧ N = a 2 → N = a ⁢ a
37 equid ⊢ a = a
38 36 37 jctil ⊢ N ∈ ℤ ≥ 4 ∧ a ∈ 2 ..^ N ∧ N = a 2 → a = a ∧ N = a ⁢ a
39 28 32 38 rspcedvd ⊢ N ∈ ℤ ≥ 4 ∧ a ∈ 2 ..^ N ∧ N = a 2 → ∃ b ∈ 2 ..^ N a = b ∧ N = a ⁢ b
40 39 ex ⊢ N ∈ ℤ ≥ 4 ∧ a ∈ 2 ..^ N → N = a 2 → ∃ b ∈ 2 ..^ N a = b ∧ N = a ⁢ b
41 27 40 impbid ⊢ N ∈ ℤ ≥ 4 ∧ a ∈ 2 ..^ N → ∃ b ∈ 2 ..^ N a = b ∧ N = a ⁢ b ↔ N = a 2
42 41 orbi2d ⊢ N ∈ ℤ ≥ 4 ∧ a ∈ 2 ..^ N → ∃ b ∈ 2 ..^ N a < b ∧ N = a ⁢ b ∨ ∃ b ∈ 2 ..^ N a = b ∧ N = a ⁢ b ↔ ∃ b ∈ 2 ..^ N a < b ∧ N = a ⁢ b ∨ N = a 2
43 13 42 bitrid ⊢ N ∈ ℤ ≥ 4 ∧ a ∈ 2 ..^ N → ∃ b ∈ 2 ..^ N a < b ∧ N = a ⁢ b ∨ a = b ∧ N = a ⁢ b ↔ ∃ b ∈ 2 ..^ N a < b ∧ N = a ⁢ b ∨ N = a 2
44 12 43 bitrd ⊢ N ∈ ℤ ≥ 4 ∧ a ∈ 2 ..^ N → ∃ b ∈ 2 ..^ N a ≤ b ∧ N = a ⁢ b ↔ ∃ b ∈ 2 ..^ N a < b ∧ N = a ⁢ b ∨ N = a 2
45 44 rexbidva ⊢ N ∈ ℤ ≥ 4 → ∃ a ∈ 2 ..^ N ∃ b ∈ 2 ..^ N a ≤ b ∧ N = a ⁢ b ↔ ∃ a ∈ 2 ..^ N ∃ b ∈ 2 ..^ N a < b ∧ N = a ⁢ b ∨ N = a 2
46 r19.43 ⊢ ∃ a ∈ 2 ..^ N ∃ b ∈ 2 ..^ N a < b ∧ N = a ⁢ b ∨ N = a 2 ↔ ∃ a ∈ 2 ..^ N ∃ b ∈ 2 ..^ N a < b ∧ N = a ⁢ b ∨ ∃ a ∈ 2 ..^ N N = a 2
47 45 46 bitrdi ⊢ N ∈ ℤ ≥ 4 → ∃ a ∈ 2 ..^ N ∃ b ∈ 2 ..^ N a ≤ b ∧ N = a ⁢ b ↔ ∃ a ∈ 2 ..^ N ∃ b ∈ 2 ..^ N a < b ∧ N = a ⁢ b ∨ ∃ a ∈ 2 ..^ N N = a 2
48 1 47 bitrd ⊢ N ∈ ℤ ≥ 4 → N ∉ ℙ ↔ ∃ a ∈ 2 ..^ N ∃ b ∈ 2 ..^ N a < b ∧ N = a ⁢ b ∨ ∃ a ∈ 2 ..^ N N = a 2