znunit - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > znunit		Structured version Visualization version GIF version

Theorem znunit 21340

Description: The units of ℤ/nℤ are the integers coprime to the base. (Contributed by Mario Carneiro, 18-Apr-2016.)

**Hypotheses**
Ref	Expression
znchr.y	⊢ 𝑌 = (ℤ/nℤ‘𝑁)
znunit.u	⊢ 𝑈 = (Unit‘𝑌)
znunit.l	⊢ 𝐿 = (ℤRHom‘𝑌)

**Assertion**
Ref	Expression
znunit	⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → ((𝐿‘𝐴) ∈ 𝑈 ↔ (𝐴 gcd 𝑁) = 1))

Proof of Theorem znunit Dummy variables 𝑚 𝑛 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		znchr.y	. . . . 5 ⊢ 𝑌 = (ℤ/nℤ‘𝑁)
2	1	zncrng 21321	. . . 4 ⊢ (𝑁 ∈ ℕ₀ → 𝑌 ∈ CRing)
3	2	adantr 479	. . 3 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → 𝑌 ∈ CRing)
4		znunit.u	. . . 4 ⊢ 𝑈 = (Unit‘𝑌)
5		eqid 2730	. . . 4 ⊢ (1_r‘𝑌) = (1_r‘𝑌)
6		eqid 2730	. . . 4 ⊢ (∥_r‘𝑌) = (∥_r‘𝑌)
7	4, 5, 6	crngunit 20271	. . 3 ⊢ (𝑌 ∈ CRing → ((𝐿‘𝐴) ∈ 𝑈 ↔ (𝐿‘𝐴)(∥_r‘𝑌)(1_r‘𝑌)))
8	3, 7	syl 17	. 2 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → ((𝐿‘𝐴) ∈ 𝑈 ↔ (𝐿‘𝐴)(∥_r‘𝑌)(1_r‘𝑌)))
9		eqid 2730	. . . . . . 7 ⊢ (Base‘𝑌) = (Base‘𝑌)
10		znunit.l	. . . . . . 7 ⊢ 𝐿 = (ℤRHom‘𝑌)
11	1, 9, 10	znzrhfo 21324	. . . . . 6 ⊢ (𝑁 ∈ ℕ₀ → 𝐿:ℤ–onto→(Base‘𝑌))
12	11	adantr 479	. . . . 5 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → 𝐿:ℤ–onto→(Base‘𝑌))
13		fof 6806	. . . . 5 ⊢ (𝐿:ℤ–onto→(Base‘𝑌) → 𝐿:ℤ⟶(Base‘𝑌))
14	12, 13	syl 17	. . . 4 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → 𝐿:ℤ⟶(Base‘𝑌))
15		ffvelcdm 7084	. . . 4 ⊢ ((𝐿:ℤ⟶(Base‘𝑌) ∧ 𝐴 ∈ ℤ) → (𝐿‘𝐴) ∈ (Base‘𝑌))
16	14, 15	sylancom 586	. . 3 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → (𝐿‘𝐴) ∈ (Base‘𝑌))
17		eqid 2730	. . . 4 ⊢ (._r‘𝑌) = (._r‘𝑌)
18	9, 6, 17	dvdsr2 20256	. . 3 ⊢ ((𝐿‘𝐴) ∈ (Base‘𝑌) → ((𝐿‘𝐴)(∥_r‘𝑌)(1_r‘𝑌) ↔ ∃𝑥 ∈ (Base‘𝑌)(𝑥(._r‘𝑌)(𝐿‘𝐴)) = (1_r‘𝑌)))
19	16, 18	syl 17	. 2 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → ((𝐿‘𝐴)(∥_r‘𝑌)(1_r‘𝑌) ↔ ∃𝑥 ∈ (Base‘𝑌)(𝑥(._r‘𝑌)(𝐿‘𝐴)) = (1_r‘𝑌)))
20		forn 6809	. . . . . 6 ⊢ (𝐿:ℤ–onto→(Base‘𝑌) → ran 𝐿 = (Base‘𝑌))
21	12, 20	syl 17	. . . . 5 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → ran 𝐿 = (Base‘𝑌))
22	21	rexeqdv 3324	. . . 4 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → (∃𝑥 ∈ ran 𝐿(𝑥(._r‘𝑌)(𝐿‘𝐴)) = (1_r‘𝑌) ↔ ∃𝑥 ∈ (Base‘𝑌)(𝑥(._r‘𝑌)(𝐿‘𝐴)) = (1_r‘𝑌)))
23		ffn 6718	. . . . 5 ⊢ (𝐿:ℤ⟶(Base‘𝑌) → 𝐿 Fn ℤ)
24		oveq1 7420	. . . . . . 7 ⊢ (𝑥 = (𝐿‘𝑛) → (𝑥(._r‘𝑌)(𝐿‘𝐴)) = ((𝐿‘𝑛)(._r‘𝑌)(𝐿‘𝐴)))
25	24	eqeq1d 2732	. . . . . 6 ⊢ (𝑥 = (𝐿‘𝑛) → ((𝑥(._r‘𝑌)(𝐿‘𝐴)) = (1_r‘𝑌) ↔ ((𝐿‘𝑛)(._r‘𝑌)(𝐿‘𝐴)) = (1_r‘𝑌)))
26	25	rexrn 7089	. . . . 5 ⊢ (𝐿 Fn ℤ → (∃𝑥 ∈ ran 𝐿(𝑥(._r‘𝑌)(𝐿‘𝐴)) = (1_r‘𝑌) ↔ ∃𝑛 ∈ ℤ ((𝐿‘𝑛)(._r‘𝑌)(𝐿‘𝐴)) = (1_r‘𝑌)))
27	14, 23, 26	3syl 18	. . . 4 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → (∃𝑥 ∈ ran 𝐿(𝑥(._r‘𝑌)(𝐿‘𝐴)) = (1_r‘𝑌) ↔ ∃𝑛 ∈ ℤ ((𝐿‘𝑛)(._r‘𝑌)(𝐿‘𝐴)) = (1_r‘𝑌)))
28	22, 27	bitr3d 280	. . 3 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → (∃𝑥 ∈ (Base‘𝑌)(𝑥(._r‘𝑌)(𝐿‘𝐴)) = (1_r‘𝑌) ↔ ∃𝑛 ∈ ℤ ((𝐿‘𝑛)(._r‘𝑌)(𝐿‘𝐴)) = (1_r‘𝑌)))
29		crngring 20141	. . . . . . . . . 10 ⊢ (𝑌 ∈ CRing → 𝑌 ∈ Ring)
30	3, 29	syl 17	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → 𝑌 ∈ Ring)
31	10	zrhrhm 21282	. . . . . . . . 9 ⊢ (𝑌 ∈ Ring → 𝐿 ∈ (ℤ_ring RingHom 𝑌))
32	30, 31	syl 17	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → 𝐿 ∈ (ℤ_ring RingHom 𝑌))
33	32	adantr 479	. . . . . . 7 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) → 𝐿 ∈ (ℤ_ring RingHom 𝑌))
34		simpr 483	. . . . . . 7 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) → 𝑛 ∈ ℤ)
35		simplr 765	. . . . . . 7 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) → 𝐴 ∈ ℤ)
36		zringbas 21226	. . . . . . . 8 ⊢ ℤ = (Base‘ℤ_ring)
37		zringmulr 21230	. . . . . . . 8 ⊢ · = (._r‘ℤ_ring)
38	36, 37, 17	rhmmul 20379	. . . . . . 7 ⊢ ((𝐿 ∈ (ℤ_ring RingHom 𝑌) ∧ 𝑛 ∈ ℤ ∧ 𝐴 ∈ ℤ) → (𝐿‘(𝑛 · 𝐴)) = ((𝐿‘𝑛)(._r‘𝑌)(𝐿‘𝐴)))
39	33, 34, 35, 38	syl3anc 1369	. . . . . 6 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) → (𝐿‘(𝑛 · 𝐴)) = ((𝐿‘𝑛)(._r‘𝑌)(𝐿‘𝐴)))
40	30	adantr 479	. . . . . . 7 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) → 𝑌 ∈ Ring)
41	10, 5	zrh1 21283	. . . . . . 7 ⊢ (𝑌 ∈ Ring → (𝐿‘1) = (1_r‘𝑌))
42	40, 41	syl 17	. . . . . 6 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) → (𝐿‘1) = (1_r‘𝑌))
43	39, 42	eqeq12d 2746	. . . . 5 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) → ((𝐿‘(𝑛 · 𝐴)) = (𝐿‘1) ↔ ((𝐿‘𝑛)(._r‘𝑌)(𝐿‘𝐴)) = (1_r‘𝑌)))
44		simpll 763	. . . . . 6 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) → 𝑁 ∈ ℕ₀)
45	34, 35	zmulcld 12678	. . . . . 6 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) → (𝑛 · 𝐴) ∈ ℤ)
46		1zzd 12599	. . . . . 6 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) → 1 ∈ ℤ)
47	1, 10	zndvds 21326	. . . . . 6 ⊢ ((𝑁 ∈ ℕ₀ ∧ (𝑛 · 𝐴) ∈ ℤ ∧ 1 ∈ ℤ) → ((𝐿‘(𝑛 · 𝐴)) = (𝐿‘1) ↔ 𝑁 ∥ ((𝑛 · 𝐴) − 1)))
48	44, 45, 46, 47	syl3anc 1369	. . . . 5 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) → ((𝐿‘(𝑛 · 𝐴)) = (𝐿‘1) ↔ 𝑁 ∥ ((𝑛 · 𝐴) − 1)))
49	43, 48	bitr3d 280	. . . 4 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) → (((𝐿‘𝑛)(._r‘𝑌)(𝐿‘𝐴)) = (1_r‘𝑌) ↔ 𝑁 ∥ ((𝑛 · 𝐴) − 1)))
50	49	rexbidva 3174	. . 3 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → (∃𝑛 ∈ ℤ ((𝐿‘𝑛)(._r‘𝑌)(𝐿‘𝐴)) = (1_r‘𝑌) ↔ ∃𝑛 ∈ ℤ 𝑁 ∥ ((𝑛 · 𝐴) − 1)))
51		simplr 765	. . . . . . . . . 10 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → 𝐴 ∈ ℤ)
52		nn0z 12589	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ₀ → 𝑁 ∈ ℤ)
53	52	ad2antrr 722	. . . . . . . . . 10 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → 𝑁 ∈ ℤ)
54		gcddvds 16450	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐴 gcd 𝑁) ∥ 𝐴 ∧ (𝐴 gcd 𝑁) ∥ 𝑁))
55	51, 53, 54	syl2anc 582	. . . . . . . . 9 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → ((𝐴 gcd 𝑁) ∥ 𝐴 ∧ (𝐴 gcd 𝑁) ∥ 𝑁))
56	55	simpld 493	. . . . . . . 8 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → (𝐴 gcd 𝑁) ∥ 𝐴)
57	51, 53	gcdcld 16455	. . . . . . . . . 10 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → (𝐴 gcd 𝑁) ∈ ℕ₀)
58	57	nn0zd 12590	. . . . . . . . 9 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → (𝐴 gcd 𝑁) ∈ ℤ)
59	34	adantrr 713	. . . . . . . . 9 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → 𝑛 ∈ ℤ)
60		dvdsmultr2 16247	. . . . . . . . 9 ⊢ (((𝐴 gcd 𝑁) ∈ ℤ ∧ 𝑛 ∈ ℤ ∧ 𝐴 ∈ ℤ) → ((𝐴 gcd 𝑁) ∥ 𝐴 → (𝐴 gcd 𝑁) ∥ (𝑛 · 𝐴)))
61	58, 59, 51, 60	syl3anc 1369	. . . . . . . 8 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → ((𝐴 gcd 𝑁) ∥ 𝐴 → (𝐴 gcd 𝑁) ∥ (𝑛 · 𝐴)))
62	56, 61	mpd 15	. . . . . . 7 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → (𝐴 gcd 𝑁) ∥ (𝑛 · 𝐴))
63	45	adantrr 713	. . . . . . . 8 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → (𝑛 · 𝐴) ∈ ℤ)
64		1zzd 12599	. . . . . . . 8 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → 1 ∈ ℤ)
65		peano2zm 12611	. . . . . . . . . 10 ⊢ ((𝑛 · 𝐴) ∈ ℤ → ((𝑛 · 𝐴) − 1) ∈ ℤ)
66	63, 65	syl 17	. . . . . . . . 9 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → ((𝑛 · 𝐴) − 1) ∈ ℤ)
67	55	simprd 494	. . . . . . . . 9 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → (𝐴 gcd 𝑁) ∥ 𝑁)
68		simprr 769	. . . . . . . . 9 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → 𝑁 ∥ ((𝑛 · 𝐴) − 1))
69	58, 53, 66, 67, 68	dvdstrd 16244	. . . . . . . 8 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → (𝐴 gcd 𝑁) ∥ ((𝑛 · 𝐴) − 1))
70		dvdssub2 16250	. . . . . . . 8 ⊢ ((((𝐴 gcd 𝑁) ∈ ℤ ∧ (𝑛 · 𝐴) ∈ ℤ ∧ 1 ∈ ℤ) ∧ (𝐴 gcd 𝑁) ∥ ((𝑛 · 𝐴) − 1)) → ((𝐴 gcd 𝑁) ∥ (𝑛 · 𝐴) ↔ (𝐴 gcd 𝑁) ∥ 1))
71	58, 63, 64, 69, 70	syl31anc 1371	. . . . . . 7 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → ((𝐴 gcd 𝑁) ∥ (𝑛 · 𝐴) ↔ (𝐴 gcd 𝑁) ∥ 1))
72	62, 71	mpbid 231	. . . . . 6 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → (𝐴 gcd 𝑁) ∥ 1)
73		dvds1 16268	. . . . . . 7 ⊢ ((𝐴 gcd 𝑁) ∈ ℕ₀ → ((𝐴 gcd 𝑁) ∥ 1 ↔ (𝐴 gcd 𝑁) = 1))
74	57, 73	syl 17	. . . . . 6 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → ((𝐴 gcd 𝑁) ∥ 1 ↔ (𝐴 gcd 𝑁) = 1))
75	72, 74	mpbid 231	. . . . 5 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → (𝐴 gcd 𝑁) = 1)
76	75	rexlimdvaa 3154	. . . 4 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → (∃𝑛 ∈ ℤ 𝑁 ∥ ((𝑛 · 𝐴) − 1) → (𝐴 gcd 𝑁) = 1))
77		simpr 483	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → 𝐴 ∈ ℤ)
78	52	adantr 479	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → 𝑁 ∈ ℤ)
79		bezout 16491	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ∃𝑛 ∈ ℤ ∃𝑚 ∈ ℤ (𝐴 gcd 𝑁) = ((𝐴 · 𝑛) + (𝑁 · 𝑚)))
80	77, 78, 79	syl2anc 582	. . . . . 6 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → ∃𝑛 ∈ ℤ ∃𝑚 ∈ ℤ (𝐴 gcd 𝑁) = ((𝐴 · 𝑛) + (𝑁 · 𝑚)))
81		eqeq1 2734	. . . . . . 7 ⊢ ((𝐴 gcd 𝑁) = 1 → ((𝐴 gcd 𝑁) = ((𝐴 · 𝑛) + (𝑁 · 𝑚)) ↔ 1 = ((𝐴 · 𝑛) + (𝑁 · 𝑚))))
82	81	2rexbidv 3217	. . . . . 6 ⊢ ((𝐴 gcd 𝑁) = 1 → (∃𝑛 ∈ ℤ ∃𝑚 ∈ ℤ (𝐴 gcd 𝑁) = ((𝐴 · 𝑛) + (𝑁 · 𝑚)) ↔ ∃𝑛 ∈ ℤ ∃𝑚 ∈ ℤ 1 = ((𝐴 · 𝑛) + (𝑁 · 𝑚))))
83	80, 82	syl5ibcom 244	. . . . 5 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → ((𝐴 gcd 𝑁) = 1 → ∃𝑛 ∈ ℤ ∃𝑚 ∈ ℤ 1 = ((𝐴 · 𝑛) + (𝑁 · 𝑚))))
84	52	ad3antrrr 726	. . . . . . . . . . 11 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → 𝑁 ∈ ℤ)
85		dvdsmul1 16227	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℤ ∧ 𝑚 ∈ ℤ) → 𝑁 ∥ (𝑁 · 𝑚))
86	84, 85	sylancom 586	. . . . . . . . . 10 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → 𝑁 ∥ (𝑁 · 𝑚))
87		zmulcl 12617	. . . . . . . . . . . 12 ⊢ ((𝑁 ∈ ℤ ∧ 𝑚 ∈ ℤ) → (𝑁 · 𝑚) ∈ ℤ)
88	84, 87	sylancom 586	. . . . . . . . . . 11 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → (𝑁 · 𝑚) ∈ ℤ)
89		dvdsnegb 16223	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℤ ∧ (𝑁 · 𝑚) ∈ ℤ) → (𝑁 ∥ (𝑁 · 𝑚) ↔ 𝑁 ∥ -(𝑁 · 𝑚)))
90	84, 88, 89	syl2anc 582	. . . . . . . . . 10 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → (𝑁 ∥ (𝑁 · 𝑚) ↔ 𝑁 ∥ -(𝑁 · 𝑚)))
91	86, 90	mpbid 231	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → 𝑁 ∥ -(𝑁 · 𝑚))
92	35	adantr 479	. . . . . . . . . . . . . . 15 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → 𝐴 ∈ ℤ)
93	92	zcnd 12673	. . . . . . . . . . . . . 14 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → 𝐴 ∈ ℂ)
94		zcn 12569	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℤ → 𝑛 ∈ ℂ)
95	94	ad2antlr 723	. . . . . . . . . . . . . 14 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → 𝑛 ∈ ℂ)
96	93, 95	mulcomd 11241	. . . . . . . . . . . . 13 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → (𝐴 · 𝑛) = (𝑛 · 𝐴))
97	96	oveq1d 7428	. . . . . . . . . . . 12 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → ((𝐴 · 𝑛) + (𝑁 · 𝑚)) = ((𝑛 · 𝐴) + (𝑁 · 𝑚)))
98	95, 93	mulcld 11240	. . . . . . . . . . . . 13 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → (𝑛 · 𝐴) ∈ ℂ)
99	88	zcnd 12673	. . . . . . . . . . . . 13 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → (𝑁 · 𝑚) ∈ ℂ)
100	98, 99	subnegd 11584	. . . . . . . . . . . 12 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → ((𝑛 · 𝐴) − -(𝑁 · 𝑚)) = ((𝑛 · 𝐴) + (𝑁 · 𝑚)))
101	97, 100	eqtr4d 2773	. . . . . . . . . . 11 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → ((𝐴 · 𝑛) + (𝑁 · 𝑚)) = ((𝑛 · 𝐴) − -(𝑁 · 𝑚)))
102	101	oveq2d 7429	. . . . . . . . . 10 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → ((𝑛 · 𝐴) − ((𝐴 · 𝑛) + (𝑁 · 𝑚))) = ((𝑛 · 𝐴) − ((𝑛 · 𝐴) − -(𝑁 · 𝑚))))
103	99	negcld 11564	. . . . . . . . . . 11 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → -(𝑁 · 𝑚) ∈ ℂ)
104	98, 103	nncand 11582	. . . . . . . . . 10 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → ((𝑛 · 𝐴) − ((𝑛 · 𝐴) − -(𝑁 · 𝑚))) = -(𝑁 · 𝑚))
105	102, 104	eqtrd 2770	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → ((𝑛 · 𝐴) − ((𝐴 · 𝑛) + (𝑁 · 𝑚))) = -(𝑁 · 𝑚))
106	91, 105	breqtrrd 5177	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → 𝑁 ∥ ((𝑛 · 𝐴) − ((𝐴 · 𝑛) + (𝑁 · 𝑚))))
107		oveq2 7421	. . . . . . . . 9 ⊢ (1 = ((𝐴 · 𝑛) + (𝑁 · 𝑚)) → ((𝑛 · 𝐴) − 1) = ((𝑛 · 𝐴) − ((𝐴 · 𝑛) + (𝑁 · 𝑚))))
108	107	breq2d 5161	. . . . . . . 8 ⊢ (1 = ((𝐴 · 𝑛) + (𝑁 · 𝑚)) → (𝑁 ∥ ((𝑛 · 𝐴) − 1) ↔ 𝑁 ∥ ((𝑛 · 𝐴) − ((𝐴 · 𝑛) + (𝑁 · 𝑚)))))
109	106, 108	syl5ibrcom 246	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → (1 = ((𝐴 · 𝑛) + (𝑁 · 𝑚)) → 𝑁 ∥ ((𝑛 · 𝐴) − 1)))
110	109	rexlimdva 3153	. . . . . 6 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) → (∃𝑚 ∈ ℤ 1 = ((𝐴 · 𝑛) + (𝑁 · 𝑚)) → 𝑁 ∥ ((𝑛 · 𝐴) − 1)))
111	110	reximdva 3166	. . . . 5 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → (∃𝑛 ∈ ℤ ∃𝑚 ∈ ℤ 1 = ((𝐴 · 𝑛) + (𝑁 · 𝑚)) → ∃𝑛 ∈ ℤ 𝑁 ∥ ((𝑛 · 𝐴) − 1)))
112	83, 111	syld 47	. . . 4 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → ((𝐴 gcd 𝑁) = 1 → ∃𝑛 ∈ ℤ 𝑁 ∥ ((𝑛 · 𝐴) − 1)))
113	76, 112	impbid 211	. . 3 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → (∃𝑛 ∈ ℤ 𝑁 ∥ ((𝑛 · 𝐴) − 1) ↔ (𝐴 gcd 𝑁) = 1))
114	28, 50, 113	3bitrd 304	. 2 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → (∃𝑥 ∈ (Base‘𝑌)(𝑥(._r‘𝑌)(𝐿‘𝐴)) = (1_r‘𝑌) ↔ (𝐴 gcd 𝑁) = 1))
115	8, 19, 114	3bitrd 304	1 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → ((𝐿‘𝐴) ∈ 𝑈 ↔ (𝐴 gcd 𝑁) = 1))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 = wceq 1539 ∈ wcel 2104 ∃wrex 3068 class class class wbr 5149 ran crn 5678 Fn wfn 6539 ⟶wf 6540 –onto→wfo 6542 ‘cfv 6544 (class class class)co 7413 ℂcc 11112 1c1 11115 + caddc 11117 · cmul 11119 − cmin 11450 -cneg 11451 ℕ₀cn0 12478 ℤcz 12564 ∥ cdvds 16203 gcd cgcd 16441 Basecbs 17150 ._rcmulr 17204 1_rcur 20077 Ringcrg 20129 CRingccrg 20130 ∥_rcdsr 20247 Unitcui 20248 RingHom crh 20362 ℤ_ringczring 21219 ℤRHomczrh 21270 ℤ/nℤczn 21273

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7729 ax-cnex 11170 ax-resscn 11171 ax-1cn 11172 ax-icn 11173 ax-addcl 11174 ax-addrcl 11175 ax-mulcl 11176 ax-mulrcl 11177 ax-mulcom 11178 ax-addass 11179 ax-mulass 11180 ax-distr 11181 ax-i2m1 11182 ax-1ne0 11183 ax-1rid 11184 ax-rnegex 11185 ax-rrecex 11186 ax-cnre 11187 ax-pre-lttri 11188 ax-pre-lttrn 11189 ax-pre-ltadd 11190 ax-pre-mulgt0 11191 ax-pre-sup 11192 ax-addf 11193 ax-mulf 11194

This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-nfc 2883 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3474 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-tp 4634 df-op 4636 df-uni 4910 df-int 4952 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7369 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7860 df-1st 7979 df-2nd 7980 df-tpos 8215 df-frecs 8270 df-wrecs 8301 df-recs 8375 df-rdg 8414 df-1o 8470 df-er 8707 df-ec 8709 df-qs 8713 df-map 8826 df-en 8944 df-dom 8945 df-sdom 8946 df-fin 8947 df-sup 9441 df-inf 9442 df-pnf 11256 df-mnf 11257 df-xr 11258 df-ltxr 11259 df-le 11260 df-sub 11452 df-neg 11453 df-div 11878 df-nn 12219 df-2 12281 df-3 12282 df-4 12283 df-5 12284 df-6 12285 df-7 12286 df-8 12287 df-9 12288 df-n0 12479 df-z 12565 df-dec 12684 df-uz 12829 df-rp 12981 df-fz 13491 df-fl 13763 df-mod 13841 df-seq 13973 df-exp 14034 df-cj 15052 df-re 15053 df-im 15054 df-sqrt 15188 df-abs 15189 df-dvds 16204 df-gcd 16442 df-struct 17086 df-sets 17103 df-slot 17121 df-ndx 17133 df-base 17151 df-ress 17180 df-plusg 17216 df-mulr 17217 df-starv 17218 df-sca 17219 df-vsca 17220 df-ip 17221 df-tset 17222 df-ple 17223 df-ds 17225 df-unif 17226 df-0g 17393 df-imas 17460 df-qus 17461 df-mgm 18567 df-sgrp 18646 df-mnd 18662 df-mhm 18707 df-grp 18860 df-minusg 18861 df-sbg 18862 df-mulg 18989 df-subg 19041 df-nsg 19042 df-eqg 19043 df-ghm 19130 df-cmn 19693 df-abl 19694 df-mgp 20031 df-rng 20049 df-ur 20078 df-ring 20131 df-cring 20132 df-oppr 20227 df-dvdsr 20250 df-unit 20251 df-rhm 20365 df-subrng 20436 df-subrg 20461 df-lmod 20618 df-lss 20689 df-lsp 20729 df-sra 20932 df-rgmod 20933 df-lidl 20934 df-rsp 20935 df-2idl 21008 df-cnfld 21147 df-zring 21220 df-zrh 21274 df-zn 21277

This theorem is referenced by: znunithash 21341 znrrg 21342 dchrelbas4 26980 lgsdchr 27092 rpvmasumlem 27224 dirith 27266

W3C validator