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 21525

Description: Lemma for cygzn 21529. (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 14283	. . . . . . 7 ⊢ (𝐵 ∈ Fin → (♯‘𝐵) ∈ ℕ₀)
3	2	adantl 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ Fin) → (♯‘𝐵) ∈ ℕ₀)
4		0nn0 12420	. . . . . . 7 ⊢ 0 ∈ ℕ₀
5	4	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐵 ∈ Fin) → 0 ∈ ℕ₀)
6	3, 5	ifclda 4516	. . . . 5 ⊢ (𝜑 → if(𝐵 ∈ Fin, (♯‘𝐵), 0) ∈ ℕ₀)
7	1, 6	eqeltrid 2841	. . . 4 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
8	7	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → 𝑁 ∈ ℕ₀)
9		simprl 771	. . 3 ⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → 𝐾 ∈ ℤ)
10		simprr 773	. . 3 ⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → 𝑀 ∈ ℤ)
11		cygzn.y	. . . 4 ⊢ 𝑌 = (ℤ/nℤ‘𝑁)
12		cygzn.l	. . . 4 ⊢ 𝐿 = (ℤRHom‘𝑌)
13	11, 12	zndvds 21508	. . 3 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ) → ((𝐿‘𝐾) = (𝐿‘𝑀) ↔ 𝑁 ∥ (𝐾 − 𝑀)))
14	8, 9, 10, 13	syl3anc 1374	. 2 ⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → ((𝐿‘𝐾) = (𝐿‘𝑀) ↔ 𝑁 ∥ (𝐾 − 𝑀)))
15		cygzn.g	. . . . . . 7 ⊢ (𝜑 → 𝐺 ∈ CycGrp)
16		cyggrp 19823	. . . . . . 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 2737	. . . . . . 7 ⊢ (od‘𝐺) = (od‘𝐺)
23	19, 20, 21, 22	cyggenod2 19818	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐸) → ((od‘𝐺)‘𝑋) = if(𝐵 ∈ Fin, (♯‘𝐵), 0))
24	17, 18, 23	syl2anc 585	. . . . 5 ⊢ (𝜑 → ((od‘𝐺)‘𝑋) = if(𝐵 ∈ Fin, (♯‘𝐵), 0))
25	24, 1	eqtr4di 2790	. . . 4 ⊢ (𝜑 → ((od‘𝐺)‘𝑋) = 𝑁)
26	25	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → ((od‘𝐺)‘𝑋) = 𝑁)
27	26	breq1d 5109	. 2 ⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → (((od‘𝐺)‘𝑋) ∥ (𝐾 − 𝑀) ↔ 𝑁 ∥ (𝐾 − 𝑀)))
28	17	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → 𝐺 ∈ Grp)
29	19, 20, 21	iscyggen 19813	. . . . . 6 ⊢ (𝑋 ∈ 𝐸 ↔ (𝑋 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑋)) = 𝐵))
30	29	simplbi 497	. . . . 5 ⊢ (𝑋 ∈ 𝐸 → 𝑋 ∈ 𝐵)
31	18, 30	syl 17	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
32	31	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → 𝑋 ∈ 𝐵)
33		eqid 2737	. . . 4 ⊢ (0_g‘𝐺) = (0_g‘𝐺)
34	19, 22, 20, 33	odcong 19482	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → (((od‘𝐺)‘𝑋) ∥ (𝐾 − 𝑀) ↔ (𝐾 · 𝑋) = (𝑀 · 𝑋)))
35	28, 32, 9, 10, 34	syl112anc 1377	. 2 ⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → (((od‘𝐺)‘𝑋) ∥ (𝐾 − 𝑀) ↔ (𝐾 · 𝑋) = (𝑀 · 𝑋)))
36	14, 27, 35	3bitr2d 307	1 ⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → ((𝐿‘𝐾) = (𝐿‘𝑀) ↔ (𝐾 · 𝑋) = (𝑀 · 𝑋)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 {crab 3400 ifcif 4480 class class class wbr 5099 ↦ cmpt 5180 ran crn 5626 ‘cfv 6493 (class class class)co 7360 Fincfn 8887 0cc0 11030 − cmin 11368 ℕ₀cn0 12405 ℤcz 12492 ♯chash 14257 ∥ cdvds 16183 Basecbs 17140 0_gc0g 17363 Grpcgrp 18867 ._gcmg 19001 odcod 19457 CycGrpccyg 19810 ℤRHomczrh 21458 ℤ/nℤczn 21461

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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5225 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 ax-inf2 9554 ax-cnex 11086 ax-resscn 11087 ax-1cn 11088 ax-icn 11089 ax-addcl 11090 ax-addrcl 11091 ax-mulcl 11092 ax-mulrcl 11093 ax-mulcom 11094 ax-addass 11095 ax-mulass 11096 ax-distr 11097 ax-i2m1 11098 ax-1ne0 11099 ax-1rid 11100 ax-rnegex 11101 ax-rrecex 11102 ax-cnre 11103 ax-pre-lttri 11104 ax-pre-lttrn 11105 ax-pre-ltadd 11106 ax-pre-mulgt0 11107 ax-pre-sup 11108 ax-addf 11109 ax-mulf 11110

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-rmo 3351 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-tp 4586 df-op 4588 df-uni 4865 df-int 4904 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-se 5579 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-isom 6502 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-tpos 8170 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-oadd 8403 df-omul 8404 df-er 8637 df-ec 8639 df-qs 8643 df-map 8769 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-sup 9349 df-inf 9350 df-oi 9419 df-card 9855 df-acn 9858 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-div 11799 df-nn 12150 df-2 12212 df-3 12213 df-4 12214 df-5 12215 df-6 12216 df-7 12217 df-8 12218 df-9 12219 df-n0 12406 df-z 12493 df-dec 12612 df-uz 12756 df-rp 12910 df-fz 13428 df-fl 13716 df-mod 13794 df-seq 13929 df-exp 13989 df-hash 14258 df-cj 15026 df-re 15027 df-im 15028 df-sqrt 15162 df-abs 15163 df-dvds 16184 df-struct 17078 df-sets 17095 df-slot 17113 df-ndx 17125 df-base 17141 df-ress 17162 df-plusg 17194 df-mulr 17195 df-starv 17196 df-sca 17197 df-vsca 17198 df-ip 17199 df-tset 17200 df-ple 17201 df-ds 17203 df-unif 17204 df-0g 17365 df-imas 17433 df-qus 17434 df-mgm 18569 df-sgrp 18648 df-mnd 18664 df-mhm 18712 df-grp 18870 df-minusg 18871 df-sbg 18872 df-mulg 19002 df-subg 19057 df-nsg 19058 df-eqg 19059 df-ghm 19146 df-od 19461 df-cmn 19715 df-abl 19716 df-cyg 19811 df-mgp 20080 df-rng 20092 df-ur 20121 df-ring 20174 df-cring 20175 df-oppr 20277 df-dvdsr 20297 df-rhm 20412 df-subrng 20483 df-subrg 20507 df-lmod 20817 df-lss 20887 df-lsp 20927 df-sra 21129 df-rgmod 21130 df-lidl 21167 df-rsp 21168 df-2idl 21209 df-cnfld 21314 df-zring 21406 df-zrh 21462 df-zn 21465

This theorem is referenced by: cygznlem2a 21526 cygznlem3 21528

W3C validator