zndvds - Metamath Proof Explorer

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

Theorem zndvds 21504

Description: Express equality of equivalence classes in ℤ / 𝑛ℤ in terms of divisibility. (Contributed by Mario Carneiro, 15-Jun-2015.)

**Hypotheses**
Ref	Expression
zncyg.y	⊢ 𝑌 = (ℤ/nℤ‘𝑁)
zndvds.2	⊢ 𝐿 = (ℤRHom‘𝑌)

**Assertion**
Ref	Expression
zndvds	⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((𝐿‘𝐴) = (𝐿‘𝐵) ↔ 𝑁 ∥ (𝐴 − 𝐵)))

Proof of Theorem zndvds Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqcom 2743	. 2 ⊢ ((𝐿‘𝐴) = (𝐿‘𝐵) ↔ (𝐿‘𝐵) = (𝐿‘𝐴))
2		eqid 2736	. . . . . 6 ⊢ (RSpan‘ℤ_ring) = (RSpan‘ℤ_ring)
3		eqid 2736	. . . . . 6 ⊢ (ℤ_ring ~_QG ((RSpan‘ℤ_ring)‘{𝑁})) = (ℤ_ring ~_QG ((RSpan‘ℤ_ring)‘{𝑁}))
4		zncyg.y	. . . . . 6 ⊢ 𝑌 = (ℤ/nℤ‘𝑁)
5		zndvds.2	. . . . . 6 ⊢ 𝐿 = (ℤRHom‘𝑌)
6	2, 3, 4, 5	znzrhval 21501	. . . . 5 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐵 ∈ ℤ) → (𝐿‘𝐵) = [𝐵](ℤ_ring ~_QG ((RSpan‘ℤ_ring)‘{𝑁})))
7	6	3adant2 1131	. . . 4 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐿‘𝐵) = [𝐵](ℤ_ring ~_QG ((RSpan‘ℤ_ring)‘{𝑁})))
8	2, 3, 4, 5	znzrhval 21501	. . . . 5 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ) → (𝐿‘𝐴) = [𝐴](ℤ_ring ~_QG ((RSpan‘ℤ_ring)‘{𝑁})))
9	8	3adant3 1132	. . . 4 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐿‘𝐴) = [𝐴](ℤ_ring ~_QG ((RSpan‘ℤ_ring)‘{𝑁})))
10	7, 9	eqeq12d 2752	. . 3 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((𝐿‘𝐵) = (𝐿‘𝐴) ↔ [𝐵](ℤ_ring ~_QG ((RSpan‘ℤ_ring)‘{𝑁})) = [𝐴](ℤ_ring ~_QG ((RSpan‘ℤ_ring)‘{𝑁}))))
11		zringring 21404	. . . . . 6 ⊢ ℤ_ring ∈ Ring
12		nn0z 12512	. . . . . . . . 9 ⊢ (𝑁 ∈ ℕ₀ → 𝑁 ∈ ℤ)
13	12	3ad2ant1 1133	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 𝑁 ∈ ℤ)
14	13	snssd 4765	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → {𝑁} ⊆ ℤ)
15		zringbas 21408	. . . . . . . 8 ⊢ ℤ = (Base‘ℤ_ring)
16		eqid 2736	. . . . . . . 8 ⊢ (LIdeal‘ℤ_ring) = (LIdeal‘ℤ_ring)
17	2, 15, 16	rspcl 21190	. . . . . . 7 ⊢ ((ℤ_ring ∈ Ring ∧ {𝑁} ⊆ ℤ) → ((RSpan‘ℤ_ring)‘{𝑁}) ∈ (LIdeal‘ℤ_ring))
18	11, 14, 17	sylancr 587	. . . . . 6 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((RSpan‘ℤ_ring)‘{𝑁}) ∈ (LIdeal‘ℤ_ring))
19	16	lidlsubg 21178	. . . . . 6 ⊢ ((ℤ_ring ∈ Ring ∧ ((RSpan‘ℤ_ring)‘{𝑁}) ∈ (LIdeal‘ℤ_ring)) → ((RSpan‘ℤ_ring)‘{𝑁}) ∈ (SubGrp‘ℤ_ring))
20	11, 18, 19	sylancr 587	. . . . 5 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((RSpan‘ℤ_ring)‘{𝑁}) ∈ (SubGrp‘ℤ_ring))
21	15, 3	eqger 19107	. . . . 5 ⊢ (((RSpan‘ℤ_ring)‘{𝑁}) ∈ (SubGrp‘ℤ_ring) → (ℤ_ring ~_QG ((RSpan‘ℤ_ring)‘{𝑁})) Er ℤ)
22	20, 21	syl 17	. . . 4 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (ℤ_ring ~_QG ((RSpan‘ℤ_ring)‘{𝑁})) Er ℤ)
23		simp3 1138	. . . 4 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 𝐵 ∈ ℤ)
24	22, 23	erth 8689	. . 3 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐵(ℤ_ring ~_QG ((RSpan‘ℤ_ring)‘{𝑁}))𝐴 ↔ [𝐵](ℤ_ring ~_QG ((RSpan‘ℤ_ring)‘{𝑁})) = [𝐴](ℤ_ring ~_QG ((RSpan‘ℤ_ring)‘{𝑁}))))
25		zringabl 21406	. . . . 5 ⊢ ℤ_ring ∈ Abel
26	15, 16	lidlss 21167	. . . . . 6 ⊢ (((RSpan‘ℤ_ring)‘{𝑁}) ∈ (LIdeal‘ℤ_ring) → ((RSpan‘ℤ_ring)‘{𝑁}) ⊆ ℤ)
27	18, 26	syl 17	. . . . 5 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((RSpan‘ℤ_ring)‘{𝑁}) ⊆ ℤ)
28		eqid 2736	. . . . . 6 ⊢ (-_g‘ℤ_ring) = (-_g‘ℤ_ring)
29	15, 28, 3	eqgabl 19763	. . . . 5 ⊢ ((ℤ_ring ∈ Abel ∧ ((RSpan‘ℤ_ring)‘{𝑁}) ⊆ ℤ) → (𝐵(ℤ_ring ~_QG ((RSpan‘ℤ_ring)‘{𝑁}))𝐴 ↔ (𝐵 ∈ ℤ ∧ 𝐴 ∈ ℤ ∧ (𝐴(-_g‘ℤ_ring)𝐵) ∈ ((RSpan‘ℤ_ring)‘{𝑁}))))
30	25, 27, 29	sylancr 587	. . . 4 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐵(ℤ_ring ~_QG ((RSpan‘ℤ_ring)‘{𝑁}))𝐴 ↔ (𝐵 ∈ ℤ ∧ 𝐴 ∈ ℤ ∧ (𝐴(-_g‘ℤ_ring)𝐵) ∈ ((RSpan‘ℤ_ring)‘{𝑁}))))
31		simp2 1137	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 𝐴 ∈ ℤ)
32	23, 31	jca 511	. . . . . 6 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐵 ∈ ℤ ∧ 𝐴 ∈ ℤ))
33	32	biantrurd 532	. . . . 5 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((𝐴(-_g‘ℤ_ring)𝐵) ∈ ((RSpan‘ℤ_ring)‘{𝑁}) ↔ ((𝐵 ∈ ℤ ∧ 𝐴 ∈ ℤ) ∧ (𝐴(-_g‘ℤ_ring)𝐵) ∈ ((RSpan‘ℤ_ring)‘{𝑁}))))
34		df-3an 1088	. . . . 5 ⊢ ((𝐵 ∈ ℤ ∧ 𝐴 ∈ ℤ ∧ (𝐴(-_g‘ℤ_ring)𝐵) ∈ ((RSpan‘ℤ_ring)‘{𝑁})) ↔ ((𝐵 ∈ ℤ ∧ 𝐴 ∈ ℤ) ∧ (𝐴(-_g‘ℤ_ring)𝐵) ∈ ((RSpan‘ℤ_ring)‘{𝑁})))
35	33, 34	bitr4di 289	. . . 4 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((𝐴(-_g‘ℤ_ring)𝐵) ∈ ((RSpan‘ℤ_ring)‘{𝑁}) ↔ (𝐵 ∈ ℤ ∧ 𝐴 ∈ ℤ ∧ (𝐴(-_g‘ℤ_ring)𝐵) ∈ ((RSpan‘ℤ_ring)‘{𝑁}))))
36		zsubrg 21375	. . . . . . . . 9 ⊢ ℤ ∈ (SubRing‘ℂ_fld)
37		subrgsubg 20510	. . . . . . . . 9 ⊢ (ℤ ∈ (SubRing‘ℂ_fld) → ℤ ∈ (SubGrp‘ℂ_fld))
38	36, 37	mp1i 13	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ℤ ∈ (SubGrp‘ℂ_fld))
39		cnfldsub 21352	. . . . . . . . 9 ⊢ − = (-_g‘ℂ_fld)
40		df-zring 21402	. . . . . . . . 9 ⊢ ℤ_ring = (ℂ_fld ↾_s ℤ)
41	39, 40, 28	subgsub 19068	. . . . . . . 8 ⊢ ((ℤ ∈ (SubGrp‘ℂ_fld) ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 − 𝐵) = (𝐴(-_g‘ℤ_ring)𝐵))
42	38, 41	syld3an1 1412	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 − 𝐵) = (𝐴(-_g‘ℤ_ring)𝐵))
43	42	eqcomd 2742	. . . . . 6 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴(-_g‘ℤ_ring)𝐵) = (𝐴 − 𝐵))
44		dvdsrzring 21416	. . . . . . . 8 ⊢ ∥ = (∥_r‘ℤ_ring)
45	15, 2, 44	rspsn 21288	. . . . . . 7 ⊢ ((ℤ_ring ∈ Ring ∧ 𝑁 ∈ ℤ) → ((RSpan‘ℤ_ring)‘{𝑁}) = {𝑥 ∣ 𝑁 ∥ 𝑥})
46	11, 13, 45	sylancr 587	. . . . . 6 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((RSpan‘ℤ_ring)‘{𝑁}) = {𝑥 ∣ 𝑁 ∥ 𝑥})
47	43, 46	eleq12d 2830	. . . . 5 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((𝐴(-_g‘ℤ_ring)𝐵) ∈ ((RSpan‘ℤ_ring)‘{𝑁}) ↔ (𝐴 − 𝐵) ∈ {𝑥 ∣ 𝑁 ∥ 𝑥}))
48		ovex 7391	. . . . . 6 ⊢ (𝐴 − 𝐵) ∈ V
49		breq2 5102	. . . . . 6 ⊢ (𝑥 = (𝐴 − 𝐵) → (𝑁 ∥ 𝑥 ↔ 𝑁 ∥ (𝐴 − 𝐵)))
50	48, 49	elab 3634	. . . . 5 ⊢ ((𝐴 − 𝐵) ∈ {𝑥 ∣ 𝑁 ∥ 𝑥} ↔ 𝑁 ∥ (𝐴 − 𝐵))
51	47, 50	bitrdi 287	. . . 4 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((𝐴(-_g‘ℤ_ring)𝐵) ∈ ((RSpan‘ℤ_ring)‘{𝑁}) ↔ 𝑁 ∥ (𝐴 − 𝐵)))
52	30, 35, 51	3bitr2d 307	. . 3 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐵(ℤ_ring ~_QG ((RSpan‘ℤ_ring)‘{𝑁}))𝐴 ↔ 𝑁 ∥ (𝐴 − 𝐵)))
53	10, 24, 52	3bitr2d 307	. 2 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((𝐿‘𝐵) = (𝐿‘𝐴) ↔ 𝑁 ∥ (𝐴 − 𝐵)))
54	1, 53	bitrid 283	1 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((𝐿‘𝐴) = (𝐿‘𝐵) ↔ 𝑁 ∥ (𝐴 − 𝐵)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 {cab 2714 ⊆ wss 3901 {csn 4580 class class class wbr 5098 ‘cfv 6492 (class class class)co 7358 Er wer 8632 [cec 8633 − cmin 11364 ℕ₀cn0 12401 ℤcz 12488 ∥ cdvds 16179 -_gcsg 18865 SubGrpcsubg 19050 ~_QG cqg 19052 Abelcabl 19710 Ringcrg 20168 SubRingcsubrg 20502 LIdealclidl 21161 RSpancrsp 21162 ℂ_fldccnfld 21309 ℤ_ringczring 21401 ℤRHomczrh 21454 ℤ/nℤczn 21457

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 ax-addf 11105 ax-mulf 11106

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-tp 4585 df-op 4587 df-uni 4864 df-int 4903 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-tpos 8168 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-er 8635 df-ec 8637 df-qs 8641 df-map 8765 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-sup 9345 df-inf 9346 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-nn 12146 df-2 12208 df-3 12209 df-4 12210 df-5 12211 df-6 12212 df-7 12213 df-8 12214 df-9 12215 df-n0 12402 df-z 12489 df-dec 12608 df-uz 12752 df-fz 13424 df-seq 13925 df-dvds 16180 df-struct 17074 df-sets 17091 df-slot 17109 df-ndx 17121 df-base 17137 df-ress 17158 df-plusg 17190 df-mulr 17191 df-starv 17192 df-sca 17193 df-vsca 17194 df-ip 17195 df-tset 17196 df-ple 17197 df-ds 17199 df-unif 17200 df-0g 17361 df-imas 17429 df-qus 17430 df-mgm 18565 df-sgrp 18644 df-mnd 18660 df-mhm 18708 df-grp 18866 df-minusg 18867 df-sbg 18868 df-mulg 18998 df-subg 19053 df-nsg 19054 df-eqg 19055 df-ghm 19142 df-cmn 19711 df-abl 19712 df-mgp 20076 df-rng 20088 df-ur 20117 df-ring 20170 df-cring 20171 df-oppr 20273 df-dvdsr 20293 df-rhm 20408 df-subrng 20479 df-subrg 20503 df-lmod 20813 df-lss 20883 df-lsp 20923 df-sra 21125 df-rgmod 21126 df-lidl 21163 df-rsp 21164 df-2idl 21205 df-cnfld 21310 df-zring 21402 df-zrh 21458 df-zn 21461

This theorem is referenced by: zndvds0 21505 znf1o 21506 znunit 21518 cygznlem1 21521 lgsqrlem1 27313 lgsqrlem2 27314 lgsqrlem4 27316 lgsdchrval 27321 lgseisenlem3 27344 lgseisenlem4 27345 dchrisumlem1 27456 dirith 27496 hashscontpow1 42371 aks6d1c2 42380

W3C validator