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 21119

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 21100	. . . 4 ⊢ (𝑁 ∈ ℕ₀ → 𝑌 ∈ CRing)
3	2	adantr 482	. . 3 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → 𝑌 ∈ CRing)
4		znunit.u	. . . 4 ⊢ 𝑈 = (Unit‘𝑌)
5		eqid 2733	. . . 4 ⊢ (1_r‘𝑌) = (1_r‘𝑌)
6		eqid 2733	. . . 4 ⊢ (∥_r‘𝑌) = (∥_r‘𝑌)
7	4, 5, 6	crngunit 20192	. . 3 ⊢ (𝑌 ∈ CRing → ((𝐿‘𝐴) ∈ 𝑈 ↔ (𝐿‘𝐴)(∥_r‘𝑌)(1_r‘𝑌)))
8	3, 7	syl 17	. 2 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → ((𝐿‘𝐴) ∈ 𝑈 ↔ (𝐿‘𝐴)(∥_r‘𝑌)(1_r‘𝑌)))
9		eqid 2733	. . . . . . 7 ⊢ (Base‘𝑌) = (Base‘𝑌)
10		znunit.l	. . . . . . 7 ⊢ 𝐿 = (ℤRHom‘𝑌)
11	1, 9, 10	znzrhfo 21103	. . . . . 6 ⊢ (𝑁 ∈ ℕ₀ → 𝐿:ℤ–onto→(Base‘𝑌))
12	11	adantr 482	. . . . 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 589	. . 3 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → (𝐿‘𝐴) ∈ (Base‘𝑌))
17		eqid 2733	. . . 4 ⊢ (._r‘𝑌) = (._r‘𝑌)
18	9, 6, 17	dvdsr2 20177	. . 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 3327	. . . 4 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → (∃𝑥 ∈ ran 𝐿(𝑥(._r‘𝑌)(𝐿‘𝐴)) = (1_r‘𝑌) ↔ ∃𝑥 ∈ (Base‘𝑌)(𝑥(._r‘𝑌)(𝐿‘𝐴)) = (1_r‘𝑌)))
23		ffn 6718	. . . . 5 ⊢ (𝐿:ℤ⟶(Base‘𝑌) → 𝐿 Fn ℤ)
24		oveq1 7416	. . . . . . 7 ⊢ (𝑥 = (𝐿‘𝑛) → (𝑥(._r‘𝑌)(𝐿‘𝐴)) = ((𝐿‘𝑛)(._r‘𝑌)(𝐿‘𝐴)))
25	24	eqeq1d 2735	. . . . . 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 281	. . 3 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → (∃𝑥 ∈ (Base‘𝑌)(𝑥(._r‘𝑌)(𝐿‘𝐴)) = (1_r‘𝑌) ↔ ∃𝑛 ∈ ℤ ((𝐿‘𝑛)(._r‘𝑌)(𝐿‘𝐴)) = (1_r‘𝑌)))
29		crngring 20068	. . . . . . . . . 10 ⊢ (𝑌 ∈ CRing → 𝑌 ∈ Ring)
30	3, 29	syl 17	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → 𝑌 ∈ Ring)
31	10	zrhrhm 21061	. . . . . . . . 9 ⊢ (𝑌 ∈ Ring → 𝐿 ∈ (ℤ_ring RingHom 𝑌))
32	30, 31	syl 17	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → 𝐿 ∈ (ℤ_ring RingHom 𝑌))
33	32	adantr 482	. . . . . . 7 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) → 𝐿 ∈ (ℤ_ring RingHom 𝑌))
34		simpr 486	. . . . . . 7 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) → 𝑛 ∈ ℤ)
35		simplr 768	. . . . . . 7 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) → 𝐴 ∈ ℤ)
36		zringbas 21023	. . . . . . . 8 ⊢ ℤ = (Base‘ℤ_ring)
37		zringmulr 21027	. . . . . . . 8 ⊢ · = (._r‘ℤ_ring)
38	36, 37, 17	rhmmul 20264	. . . . . . 7 ⊢ ((𝐿 ∈ (ℤ_ring RingHom 𝑌) ∧ 𝑛 ∈ ℤ ∧ 𝐴 ∈ ℤ) → (𝐿‘(𝑛 · 𝐴)) = ((𝐿‘𝑛)(._r‘𝑌)(𝐿‘𝐴)))
39	33, 34, 35, 38	syl3anc 1372	. . . . . 6 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) → (𝐿‘(𝑛 · 𝐴)) = ((𝐿‘𝑛)(._r‘𝑌)(𝐿‘𝐴)))
40	30	adantr 482	. . . . . . 7 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) → 𝑌 ∈ Ring)
41	10, 5	zrh1 21062	. . . . . . 7 ⊢ (𝑌 ∈ Ring → (𝐿‘1) = (1_r‘𝑌))
42	40, 41	syl 17	. . . . . 6 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) → (𝐿‘1) = (1_r‘𝑌))
43	39, 42	eqeq12d 2749	. . . . 5 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) → ((𝐿‘(𝑛 · 𝐴)) = (𝐿‘1) ↔ ((𝐿‘𝑛)(._r‘𝑌)(𝐿‘𝐴)) = (1_r‘𝑌)))
44		simpll 766	. . . . . 6 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) → 𝑁 ∈ ℕ₀)
45	34, 35	zmulcld 12672	. . . . . 6 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) → (𝑛 · 𝐴) ∈ ℤ)
46		1zzd 12593	. . . . . 6 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) → 1 ∈ ℤ)
47	1, 10	zndvds 21105	. . . . . 6 ⊢ ((𝑁 ∈ ℕ₀ ∧ (𝑛 · 𝐴) ∈ ℤ ∧ 1 ∈ ℤ) → ((𝐿‘(𝑛 · 𝐴)) = (𝐿‘1) ↔ 𝑁 ∥ ((𝑛 · 𝐴) − 1)))
48	44, 45, 46, 47	syl3anc 1372	. . . . 5 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) → ((𝐿‘(𝑛 · 𝐴)) = (𝐿‘1) ↔ 𝑁 ∥ ((𝑛 · 𝐴) − 1)))
49	43, 48	bitr3d 281	. . . 4 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) → (((𝐿‘𝑛)(._r‘𝑌)(𝐿‘𝐴)) = (1_r‘𝑌) ↔ 𝑁 ∥ ((𝑛 · 𝐴) − 1)))
50	49	rexbidva 3177	. . 3 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → (∃𝑛 ∈ ℤ ((𝐿‘𝑛)(._r‘𝑌)(𝐿‘𝐴)) = (1_r‘𝑌) ↔ ∃𝑛 ∈ ℤ 𝑁 ∥ ((𝑛 · 𝐴) − 1)))
51		simplr 768	. . . . . . . . . 10 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → 𝐴 ∈ ℤ)
52		nn0z 12583	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ₀ → 𝑁 ∈ ℤ)
53	52	ad2antrr 725	. . . . . . . . . 10 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → 𝑁 ∈ ℤ)
54		gcddvds 16444	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐴 gcd 𝑁) ∥ 𝐴 ∧ (𝐴 gcd 𝑁) ∥ 𝑁))
55	51, 53, 54	syl2anc 585	. . . . . . . . 9 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → ((𝐴 gcd 𝑁) ∥ 𝐴 ∧ (𝐴 gcd 𝑁) ∥ 𝑁))
56	55	simpld 496	. . . . . . . 8 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → (𝐴 gcd 𝑁) ∥ 𝐴)
57	51, 53	gcdcld 16449	. . . . . . . . . 10 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → (𝐴 gcd 𝑁) ∈ ℕ₀)
58	57	nn0zd 12584	. . . . . . . . 9 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → (𝐴 gcd 𝑁) ∈ ℤ)
59	34	adantrr 716	. . . . . . . . 9 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → 𝑛 ∈ ℤ)
60		dvdsmultr2 16241	. . . . . . . . 9 ⊢ (((𝐴 gcd 𝑁) ∈ ℤ ∧ 𝑛 ∈ ℤ ∧ 𝐴 ∈ ℤ) → ((𝐴 gcd 𝑁) ∥ 𝐴 → (𝐴 gcd 𝑁) ∥ (𝑛 · 𝐴)))
61	58, 59, 51, 60	syl3anc 1372	. . . . . . . 8 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → ((𝐴 gcd 𝑁) ∥ 𝐴 → (𝐴 gcd 𝑁) ∥ (𝑛 · 𝐴)))
62	56, 61	mpd 15	. . . . . . 7 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → (𝐴 gcd 𝑁) ∥ (𝑛 · 𝐴))
63	45	adantrr 716	. . . . . . . 8 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → (𝑛 · 𝐴) ∈ ℤ)
64		1zzd 12593	. . . . . . . 8 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → 1 ∈ ℤ)
65		peano2zm 12605	. . . . . . . . . 10 ⊢ ((𝑛 · 𝐴) ∈ ℤ → ((𝑛 · 𝐴) − 1) ∈ ℤ)
66	63, 65	syl 17	. . . . . . . . 9 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → ((𝑛 · 𝐴) − 1) ∈ ℤ)
67	55	simprd 497	. . . . . . . . 9 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → (𝐴 gcd 𝑁) ∥ 𝑁)
68		simprr 772	. . . . . . . . 9 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → 𝑁 ∥ ((𝑛 · 𝐴) − 1))
69	58, 53, 66, 67, 68	dvdstrd 16238	. . . . . . . 8 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → (𝐴 gcd 𝑁) ∥ ((𝑛 · 𝐴) − 1))
70		dvdssub2 16244	. . . . . . . 8 ⊢ ((((𝐴 gcd 𝑁) ∈ ℤ ∧ (𝑛 · 𝐴) ∈ ℤ ∧ 1 ∈ ℤ) ∧ (𝐴 gcd 𝑁) ∥ ((𝑛 · 𝐴) − 1)) → ((𝐴 gcd 𝑁) ∥ (𝑛 · 𝐴) ↔ (𝐴 gcd 𝑁) ∥ 1))
71	58, 63, 64, 69, 70	syl31anc 1374	. . . . . . 7 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → ((𝐴 gcd 𝑁) ∥ (𝑛 · 𝐴) ↔ (𝐴 gcd 𝑁) ∥ 1))
72	62, 71	mpbid 231	. . . . . 6 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 𝑁 ∥ ((𝑛 · 𝐴) − 1))) → (𝐴 gcd 𝑁) ∥ 1)
73		dvds1 16262	. . . . . . 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 3157	. . . 4 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → (∃𝑛 ∈ ℤ 𝑁 ∥ ((𝑛 · 𝐴) − 1) → (𝐴 gcd 𝑁) = 1))
77		simpr 486	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → 𝐴 ∈ ℤ)
78	52	adantr 482	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → 𝑁 ∈ ℤ)
79		bezout 16485	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ∃𝑛 ∈ ℤ ∃𝑚 ∈ ℤ (𝐴 gcd 𝑁) = ((𝐴 · 𝑛) + (𝑁 · 𝑚)))
80	77, 78, 79	syl2anc 585	. . . . . 6 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → ∃𝑛 ∈ ℤ ∃𝑚 ∈ ℤ (𝐴 gcd 𝑁) = ((𝐴 · 𝑛) + (𝑁 · 𝑚)))
81		eqeq1 2737	. . . . . . 7 ⊢ ((𝐴 gcd 𝑁) = 1 → ((𝐴 gcd 𝑁) = ((𝐴 · 𝑛) + (𝑁 · 𝑚)) ↔ 1 = ((𝐴 · 𝑛) + (𝑁 · 𝑚))))
82	81	2rexbidv 3220	. . . . . 6 ⊢ ((𝐴 gcd 𝑁) = 1 → (∃𝑛 ∈ ℤ ∃𝑚 ∈ ℤ (𝐴 gcd 𝑁) = ((𝐴 · 𝑛) + (𝑁 · 𝑚)) ↔ ∃𝑛 ∈ ℤ ∃𝑚 ∈ ℤ 1 = ((𝐴 · 𝑛) + (𝑁 · 𝑚))))
83	80, 82	syl5ibcom 244	. . . . 5 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → ((𝐴 gcd 𝑁) = 1 → ∃𝑛 ∈ ℤ ∃𝑚 ∈ ℤ 1 = ((𝐴 · 𝑛) + (𝑁 · 𝑚))))
84	52	ad3antrrr 729	. . . . . . . . . . 11 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → 𝑁 ∈ ℤ)
85		dvdsmul1 16221	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℤ ∧ 𝑚 ∈ ℤ) → 𝑁 ∥ (𝑁 · 𝑚))
86	84, 85	sylancom 589	. . . . . . . . . 10 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → 𝑁 ∥ (𝑁 · 𝑚))
87		zmulcl 12611	. . . . . . . . . . . 12 ⊢ ((𝑁 ∈ ℤ ∧ 𝑚 ∈ ℤ) → (𝑁 · 𝑚) ∈ ℤ)
88	84, 87	sylancom 589	. . . . . . . . . . 11 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → (𝑁 · 𝑚) ∈ ℤ)
89		dvdsnegb 16217	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℤ ∧ (𝑁 · 𝑚) ∈ ℤ) → (𝑁 ∥ (𝑁 · 𝑚) ↔ 𝑁 ∥ -(𝑁 · 𝑚)))
90	84, 88, 89	syl2anc 585	. . . . . . . . . 10 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → (𝑁 ∥ (𝑁 · 𝑚) ↔ 𝑁 ∥ -(𝑁 · 𝑚)))
91	86, 90	mpbid 231	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → 𝑁 ∥ -(𝑁 · 𝑚))
92	35	adantr 482	. . . . . . . . . . . . . . 15 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → 𝐴 ∈ ℤ)
93	92	zcnd 12667	. . . . . . . . . . . . . 14 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → 𝐴 ∈ ℂ)
94		zcn 12563	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℤ → 𝑛 ∈ ℂ)
95	94	ad2antlr 726	. . . . . . . . . . . . . 14 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → 𝑛 ∈ ℂ)
96	93, 95	mulcomd 11235	. . . . . . . . . . . . 13 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → (𝐴 · 𝑛) = (𝑛 · 𝐴))
97	96	oveq1d 7424	. . . . . . . . . . . 12 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → ((𝐴 · 𝑛) + (𝑁 · 𝑚)) = ((𝑛 · 𝐴) + (𝑁 · 𝑚)))
98	95, 93	mulcld 11234	. . . . . . . . . . . . 13 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → (𝑛 · 𝐴) ∈ ℂ)
99	88	zcnd 12667	. . . . . . . . . . . . 13 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → (𝑁 · 𝑚) ∈ ℂ)
100	98, 99	subnegd 11578	. . . . . . . . . . . 12 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → ((𝑛 · 𝐴) − -(𝑁 · 𝑚)) = ((𝑛 · 𝐴) + (𝑁 · 𝑚)))
101	97, 100	eqtr4d 2776	. . . . . . . . . . 11 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → ((𝐴 · 𝑛) + (𝑁 · 𝑚)) = ((𝑛 · 𝐴) − -(𝑁 · 𝑚)))
102	101	oveq2d 7425	. . . . . . . . . 10 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → ((𝑛 · 𝐴) − ((𝐴 · 𝑛) + (𝑁 · 𝑚))) = ((𝑛 · 𝐴) − ((𝑛 · 𝐴) − -(𝑁 · 𝑚))))
103	99	negcld 11558	. . . . . . . . . . 11 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → -(𝑁 · 𝑚) ∈ ℂ)
104	98, 103	nncand 11576	. . . . . . . . . 10 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → ((𝑛 · 𝐴) − ((𝑛 · 𝐴) − -(𝑁 · 𝑚))) = -(𝑁 · 𝑚))
105	102, 104	eqtrd 2773	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → ((𝑛 · 𝐴) − ((𝐴 · 𝑛) + (𝑁 · 𝑚))) = -(𝑁 · 𝑚))
106	91, 105	breqtrrd 5177	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → 𝑁 ∥ ((𝑛 · 𝐴) − ((𝐴 · 𝑛) + (𝑁 · 𝑚))))
107		oveq2 7417	. . . . . . . . 9 ⊢ (1 = ((𝐴 · 𝑛) + (𝑁 · 𝑚)) → ((𝑛 · 𝐴) − 1) = ((𝑛 · 𝐴) − ((𝐴 · 𝑛) + (𝑁 · 𝑚))))
108	107	breq2d 5161	. . . . . . . 8 ⊢ (1 = ((𝐴 · 𝑛) + (𝑁 · 𝑚)) → (𝑁 ∥ ((𝑛 · 𝐴) − 1) ↔ 𝑁 ∥ ((𝑛 · 𝐴) − ((𝐴 · 𝑛) + (𝑁 · 𝑚)))))
109	106, 108	syl5ibrcom 246	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) ∧ 𝑚 ∈ ℤ) → (1 = ((𝐴 · 𝑛) + (𝑁 · 𝑚)) → 𝑁 ∥ ((𝑛 · 𝐴) − 1)))
110	109	rexlimdva 3156	. . . . . 6 ⊢ (((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) ∧ 𝑛 ∈ ℤ) → (∃𝑚 ∈ ℤ 1 = ((𝐴 · 𝑛) + (𝑁 · 𝑚)) → 𝑁 ∥ ((𝑛 · 𝐴) − 1)))
111	110	reximdva 3169	. . . . 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 305	. 2 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → (∃𝑥 ∈ (Base‘𝑌)(𝑥(._r‘𝑌)(𝐿‘𝐴)) = (1_r‘𝑌) ↔ (𝐴 gcd 𝑁) = 1))
115	8, 19, 114	3bitrd 305	1 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → ((𝐿‘𝐴) ∈ 𝑈 ↔ (𝐴 gcd 𝑁) = 1))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ∃wrex 3071 class class class wbr 5149 ran crn 5678 Fn wfn 6539 ⟶wf 6540 –onto→wfo 6542 ‘cfv 6544 (class class class)co 7409 ℂcc 11108 1c1 11111 + caddc 11113 · cmul 11115 − cmin 11444 -cneg 11445 ℕ₀cn0 12472 ℤcz 12558 ∥ cdvds 16197 gcd cgcd 16435 Basecbs 17144 ._rcmulr 17198 1_rcur 20004 Ringcrg 20056 CRingccrg 20057 ∥_rcdsr 20168 Unitcui 20169 RingHom crh 20248 ℤ_ringczring 21017 ℤRHomczrh 21049 ℤ/nℤczn 21052

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187 ax-pre-sup 11188 ax-addf 11189 ax-mulf 11190

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 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 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-1st 7975 df-2nd 7976 df-tpos 8211 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-1o 8466 df-er 8703 df-ec 8705 df-qs 8709 df-map 8822 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-sup 9437 df-inf 9438 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-div 11872 df-nn 12213 df-2 12275 df-3 12276 df-4 12277 df-5 12278 df-6 12279 df-7 12280 df-8 12281 df-9 12282 df-n0 12473 df-z 12559 df-dec 12678 df-uz 12823 df-rp 12975 df-fz 13485 df-fl 13757 df-mod 13835 df-seq 13967 df-exp 14028 df-cj 15046 df-re 15047 df-im 15048 df-sqrt 15182 df-abs 15183 df-dvds 16198 df-gcd 16436 df-struct 17080 df-sets 17097 df-slot 17115 df-ndx 17127 df-base 17145 df-ress 17174 df-plusg 17210 df-mulr 17211 df-starv 17212 df-sca 17213 df-vsca 17214 df-ip 17215 df-tset 17216 df-ple 17217 df-ds 17219 df-unif 17220 df-0g 17387 df-imas 17454 df-qus 17455 df-mgm 18561 df-sgrp 18610 df-mnd 18626 df-mhm 18671 df-grp 18822 df-minusg 18823 df-sbg 18824 df-mulg 18951 df-subg 19003 df-nsg 19004 df-eqg 19005 df-ghm 19090 df-cmn 19650 df-abl 19651 df-mgp 19988 df-ur 20005 df-ring 20058 df-cring 20059 df-oppr 20150 df-dvdsr 20171 df-unit 20172 df-rnghom 20251 df-subrg 20317 df-lmod 20473 df-lss 20543 df-lsp 20583 df-sra 20785 df-rgmod 20786 df-lidl 20787 df-rsp 20788 df-2idl 20857 df-cnfld 20945 df-zring 21018 df-zrh 21053 df-zn 21056

This theorem is referenced by: znunithash 21120 znrrg 21121 dchrelbas4 26746 lgsdchr 26858 rpvmasumlem 26990 dirith 27032

W3C validator