cygznlem1 - Metamath Proof Explorer

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

Theorem cygznlem1 21113

Description: Lemma for cygzn 21117. (Contributed by Mario Carneiro, 21-Apr-2016.)

**Hypotheses**
Ref	Expression
cygzn.b	⊢ 𝐵 = (Base‘𝐺)
cygzn.n	⊢ 𝑁 = if(𝐵 ∈ Fin, (♯‘𝐵), 0)
cygzn.y	⊢ 𝑌 = (ℤ/nℤ‘𝑁)
cygzn.m	⊢ · = (._g‘𝐺)
cygzn.l	⊢ 𝐿 = (ℤRHom‘𝑌)
cygzn.e	⊢ 𝐸 = {𝑥 ∈ 𝐵 ∣ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = 𝐵}
cygzn.g	⊢ (𝜑 → 𝐺 ∈ CycGrp)
cygzn.x	⊢ (𝜑 → 𝑋 ∈ 𝐸)

**Assertion**
Ref	Expression
cygznlem1	⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → ((𝐿‘𝐾) = (𝐿‘𝑀) ↔ (𝐾 · 𝑋) = (𝑀 · 𝑋)))

Distinct variable groups: 𝑥,𝑛,𝐵 𝑛,𝐺,𝑥 · ,𝑛,𝑥 𝑛,𝑌,𝑥 𝑛,𝐿,𝑥 𝑥,𝑁 𝑛,𝑋,𝑥 Allowed substitution hints: 𝜑(𝑥,𝑛) 𝐸(𝑥,𝑛) 𝐾(𝑥,𝑛) 𝑀(𝑥,𝑛) 𝑁(𝑛)

**Proof of Theorem cygznlem1**
Step	Hyp	Ref	Expression
1		cygzn.n	. . . . 5 ⊢ 𝑁 = if(𝐵 ∈ Fin, (♯‘𝐵), 0)
2		hashcl 14312	. . . . . . 7 ⊢ (𝐵 ∈ Fin → (♯‘𝐵) ∈ ℕ₀)
3	2	adantl 482	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ Fin) → (♯‘𝐵) ∈ ℕ₀)
4		0nn0 12483	. . . . . . 7 ⊢ 0 ∈ ℕ₀
5	4	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐵 ∈ Fin) → 0 ∈ ℕ₀)
6	3, 5	ifclda 4562	. . . . 5 ⊢ (𝜑 → if(𝐵 ∈ Fin, (♯‘𝐵), 0) ∈ ℕ₀)
7	1, 6	eqeltrid 2837	. . . 4 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
8	7	adantr 481	. . 3 ⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → 𝑁 ∈ ℕ₀)
9		simprl 769	. . 3 ⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → 𝐾 ∈ ℤ)
10		simprr 771	. . 3 ⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → 𝑀 ∈ ℤ)
11		cygzn.y	. . . 4 ⊢ 𝑌 = (ℤ/nℤ‘𝑁)
12		cygzn.l	. . . 4 ⊢ 𝐿 = (ℤRHom‘𝑌)
13	11, 12	zndvds 21096	. . 3 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ) → ((𝐿‘𝐾) = (𝐿‘𝑀) ↔ 𝑁 ∥ (𝐾 − 𝑀)))
14	8, 9, 10, 13	syl3anc 1371	. 2 ⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → ((𝐿‘𝐾) = (𝐿‘𝑀) ↔ 𝑁 ∥ (𝐾 − 𝑀)))
15		cygzn.g	. . . . . . 7 ⊢ (𝜑 → 𝐺 ∈ CycGrp)
16		cyggrp 19752	. . . . . . 7 ⊢ (𝐺 ∈ CycGrp → 𝐺 ∈ Grp)
17	15, 16	syl 17	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ Grp)
18		cygzn.x	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝐸)
19		cygzn.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝐺)
20		cygzn.m	. . . . . . 7 ⊢ · = (._g‘𝐺)
21		cygzn.e	. . . . . . 7 ⊢ 𝐸 = {𝑥 ∈ 𝐵 ∣ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = 𝐵}
22		eqid 2732	. . . . . . 7 ⊢ (od‘𝐺) = (od‘𝐺)
23	19, 20, 21, 22	cyggenod2 19747	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐸) → ((od‘𝐺)‘𝑋) = if(𝐵 ∈ Fin, (♯‘𝐵), 0))
24	17, 18, 23	syl2anc 584	. . . . 5 ⊢ (𝜑 → ((od‘𝐺)‘𝑋) = if(𝐵 ∈ Fin, (♯‘𝐵), 0))
25	24, 1	eqtr4di 2790	. . . 4 ⊢ (𝜑 → ((od‘𝐺)‘𝑋) = 𝑁)
26	25	adantr 481	. . 3 ⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → ((od‘𝐺)‘𝑋) = 𝑁)
27	26	breq1d 5157	. 2 ⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → (((od‘𝐺)‘𝑋) ∥ (𝐾 − 𝑀) ↔ 𝑁 ∥ (𝐾 − 𝑀)))
28	17	adantr 481	. . 3 ⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → 𝐺 ∈ Grp)
29	19, 20, 21	iscyggen 19742	. . . . . 6 ⊢ (𝑋 ∈ 𝐸 ↔ (𝑋 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑋)) = 𝐵))
30	29	simplbi 498	. . . . 5 ⊢ (𝑋 ∈ 𝐸 → 𝑋 ∈ 𝐵)
31	18, 30	syl 17	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
32	31	adantr 481	. . 3 ⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → 𝑋 ∈ 𝐵)
33		eqid 2732	. . . 4 ⊢ (0_g‘𝐺) = (0_g‘𝐺)
34	19, 22, 20, 33	odcong 19411	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → (((od‘𝐺)‘𝑋) ∥ (𝐾 − 𝑀) ↔ (𝐾 · 𝑋) = (𝑀 · 𝑋)))
35	28, 32, 9, 10, 34	syl112anc 1374	. 2 ⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → (((od‘𝐺)‘𝑋) ∥ (𝐾 − 𝑀) ↔ (𝐾 · 𝑋) = (𝑀 · 𝑋)))
36	14, 27, 35	3bitr2d 306	1 ⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → ((𝐿‘𝐾) = (𝐿‘𝑀) ↔ (𝐾 · 𝑋) = (𝑀 · 𝑋)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 {crab 3432 ifcif 4527 class class class wbr 5147 ↦ cmpt 5230 ran crn 5676 ‘cfv 6540 (class class class)co 7405 Fincfn 8935 0cc0 11106 − cmin 11440 ℕ₀cn0 12468 ℤcz 12554 ♯chash 14286 ∥ cdvds 16193 Basecbs 17140 0_gc0g 17381 Grpcgrp 18815 ._gcmg 18944 odcod 19386 CycGrpccyg 19739 ℤRHomczrh 21040 ℤ/nℤczn 21043

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-inf2 9632 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-pre-sup 11184 ax-addf 11185 ax-mulf 11186

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-tp 4632 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-se 5631 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-isom 6549 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7852 df-1st 7971 df-2nd 7972 df-tpos 8207 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-1o 8462 df-oadd 8466 df-omul 8467 df-er 8699 df-ec 8701 df-qs 8705 df-map 8818 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-sup 9433 df-inf 9434 df-oi 9501 df-card 9930 df-acn 9933 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-div 11868 df-nn 12209 df-2 12271 df-3 12272 df-4 12273 df-5 12274 df-6 12275 df-7 12276 df-8 12277 df-9 12278 df-n0 12469 df-z 12555 df-dec 12674 df-uz 12819 df-rp 12971 df-fz 13481 df-fl 13753 df-mod 13831 df-seq 13963 df-exp 14024 df-hash 14287 df-cj 15042 df-re 15043 df-im 15044 df-sqrt 15178 df-abs 15179 df-dvds 16194 df-struct 17076 df-sets 17093 df-slot 17111 df-ndx 17123 df-base 17141 df-ress 17170 df-plusg 17206 df-mulr 17207 df-starv 17208 df-sca 17209 df-vsca 17210 df-ip 17211 df-tset 17212 df-ple 17213 df-ds 17215 df-unif 17216 df-0g 17383 df-imas 17450 df-qus 17451 df-mgm 18557 df-sgrp 18606 df-mnd 18622 df-mhm 18667 df-grp 18818 df-minusg 18819 df-sbg 18820 df-mulg 18945 df-subg 18997 df-nsg 18998 df-eqg 18999 df-ghm 19084 df-od 19390 df-cmn 19644 df-abl 19645 df-cyg 19740 df-mgp 19982 df-ur 19999 df-ring 20051 df-cring 20052 df-oppr 20142 df-dvdsr 20163 df-rnghom 20243 df-subrg 20353 df-lmod 20465 df-lss 20535 df-lsp 20575 df-sra 20777 df-rgmod 20778 df-lidl 20779 df-rsp 20780 df-2idl 20849 df-cnfld 20937 df-zring 21010 df-zrh 21044 df-zn 21047

This theorem is referenced by: cygznlem2a 21114 cygznlem3 21116

W3C validator