Metamath Proof Explorer


Theorem nprmmul2

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

Ref Expression
Assertion nprmmul2 N 4 N a 2 ..^ N b 2 ..^ N a b N = a b

Proof

Step Hyp Ref Expression
1 nprmmul1 N 4 N m 2 ..^ N n 2 ..^ N N = m n
2 breq1 a = n a b n b
3 oveq1 a = n a b = n b
4 3 eqeq2d a = n N = a b N = n b
5 2 4 anbi12d a = n a b N = a b n b N = n b
6 breq2 b = m n b n m
7 oveq2 b = m n b = n m
8 7 eqeq2d b = m N = n b N = n m
9 6 8 anbi12d b = m n b N = n b n m N = n m
10 simp1rr N 4 m 2 ..^ N n 2 ..^ N n m N = m n n 2 ..^ N
11 simp1rl N 4 m 2 ..^ N n 2 ..^ N n m N = m n m 2 ..^ N
12 simp2 N 4 m 2 ..^ N n 2 ..^ N n m N = m n n m
13 elfzo2nn m 2 ..^ N m
14 elfzo2nn n 2 ..^ N n
15 nnmulcom m n m n = n m
16 13 14 15 syl2an m 2 ..^ N n 2 ..^ N m n = n m
17 16 eqeq2d m 2 ..^ N n 2 ..^ N N = m n N = n m
18 17 biimpd m 2 ..^ N n 2 ..^ N N = m n N = n m
19 18 adantl N 4 m 2 ..^ N n 2 ..^ N N = m n N = n m
20 19 imp N 4 m 2 ..^ N n 2 ..^ N N = m n N = n m
21 20 3adant2 N 4 m 2 ..^ N n 2 ..^ N n m N = m n N = n m
22 12 21 jca N 4 m 2 ..^ N n 2 ..^ N n m N = m n n m N = n m
23 5 9 10 11 22 2rspcedvdw N 4 m 2 ..^ N n 2 ..^ N n m N = m n a 2 ..^ N b 2 ..^ N a b N = a b
24 23 3exp N 4 m 2 ..^ N n 2 ..^ N n m N = m n a 2 ..^ N b 2 ..^ N a b N = a b
25 breq1 a = m a b m b
26 oveq1 a = m a b = m b
27 26 eqeq2d a = m N = a b N = m b
28 25 27 anbi12d a = m a b N = a b m b N = m b
29 breq2 b = n m b m n
30 oveq2 b = n m b = m n
31 30 eqeq2d b = n N = m b N = m n
32 29 31 anbi12d b = n m b N = m b m n N = m n
33 simp1rl N 4 m 2 ..^ N n 2 ..^ N m n N = m n m 2 ..^ N
34 simp1rr N 4 m 2 ..^ N n 2 ..^ N m n N = m n n 2 ..^ N
35 3simpc N 4 m 2 ..^ N n 2 ..^ N m n N = m n m n N = m n
36 28 32 33 34 35 2rspcedvdw N 4 m 2 ..^ N n 2 ..^ N m n N = m n a 2 ..^ N b 2 ..^ N a b N = a b
37 36 3exp N 4 m 2 ..^ N n 2 ..^ N m n N = m n a 2 ..^ N b 2 ..^ N a b N = a b
38 elfzoelz m 2 ..^ N m
39 38 zred m 2 ..^ N m
40 elfzoelz n 2 ..^ N n
41 40 zred n 2 ..^ N n
42 39 41 anim12ci m 2 ..^ N n 2 ..^ N n m
43 42 adantl N 4 m 2 ..^ N n 2 ..^ N n m
44 letric n m n m m n
45 43 44 syl N 4 m 2 ..^ N n 2 ..^ N n m m n
46 24 37 45 mpjaod N 4 m 2 ..^ N n 2 ..^ N N = m n a 2 ..^ N b 2 ..^ N a b N = a b
47 46 rexlimdvva N 4 m 2 ..^ N n 2 ..^ N N = m n a 2 ..^ N b 2 ..^ N a b N = a b
48 oveq1 m = a m n = a n
49 48 eqeq2d m = a N = m n N = a n
50 oveq2 n = b a n = a b
51 50 eqeq2d n = b N = a n N = a b
52 simplrl N 4 a 2 ..^ N b 2 ..^ N N = a b a 2 ..^ N
53 simplrr N 4 a 2 ..^ N b 2 ..^ N N = a b b 2 ..^ N
54 simpr N 4 a 2 ..^ N b 2 ..^ N N = a b N = a b
55 49 51 52 53 54 2rspcedvdw N 4 a 2 ..^ N b 2 ..^ N N = a b m 2 ..^ N n 2 ..^ N N = m n
56 55 ex N 4 a 2 ..^ N b 2 ..^ N N = a b m 2 ..^ N n 2 ..^ N N = m n
57 56 adantld N 4 a 2 ..^ N b 2 ..^ N a b N = a b m 2 ..^ N n 2 ..^ N N = m n
58 57 rexlimdvva N 4 a 2 ..^ N b 2 ..^ N a b N = a b m 2 ..^ N n 2 ..^ N N = m n
59 47 58 impbid N 4 m 2 ..^ N n 2 ..^ N N = m n a 2 ..^ N b 2 ..^ N a b N = a b
60 1 59 bitrd N 4 N a 2 ..^ N b 2 ..^ N a b N = a b