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 21461

Description: Lemma for cygzn 21465. (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 14321	. . . . . . 7 ⊢ (𝐵 ∈ Fin → (♯‘𝐵) ∈ ℕ₀)
3	2	adantl 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ Fin) → (♯‘𝐵) ∈ ℕ₀)
4		0nn0 12491	. . . . . . 7 ⊢ 0 ∈ ℕ₀
5	4	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐵 ∈ Fin) → 0 ∈ ℕ₀)
6	3, 5	ifclda 4558	. . . . 5 ⊢ (𝜑 → if(𝐵 ∈ Fin, (♯‘𝐵), 0) ∈ ℕ₀)
7	1, 6	eqeltrid 2831	. . . 4 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
8	7	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → 𝑁 ∈ ℕ₀)
9		simprl 768	. . 3 ⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → 𝐾 ∈ ℤ)
10		simprr 770	. . 3 ⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → 𝑀 ∈ ℤ)
11		cygzn.y	. . . 4 ⊢ 𝑌 = (ℤ/nℤ‘𝑁)
12		cygzn.l	. . . 4 ⊢ 𝐿 = (ℤRHom‘𝑌)
13	11, 12	zndvds 21444	. . 3 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ) → ((𝐿‘𝐾) = (𝐿‘𝑀) ↔ 𝑁 ∥ (𝐾 − 𝑀)))
14	8, 9, 10, 13	syl3anc 1368	. 2 ⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → ((𝐿‘𝐾) = (𝐿‘𝑀) ↔ 𝑁 ∥ (𝐾 − 𝑀)))
15		cygzn.g	. . . . . . 7 ⊢ (𝜑 → 𝐺 ∈ CycGrp)
16		cyggrp 19810	. . . . . . 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 2726	. . . . . . 7 ⊢ (od‘𝐺) = (od‘𝐺)
23	19, 20, 21, 22	cyggenod2 19805	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐸) → ((od‘𝐺)‘𝑋) = if(𝐵 ∈ Fin, (♯‘𝐵), 0))
24	17, 18, 23	syl2anc 583	. . . . 5 ⊢ (𝜑 → ((od‘𝐺)‘𝑋) = if(𝐵 ∈ Fin, (♯‘𝐵), 0))
25	24, 1	eqtr4di 2784	. . . 4 ⊢ (𝜑 → ((od‘𝐺)‘𝑋) = 𝑁)
26	25	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → ((od‘𝐺)‘𝑋) = 𝑁)
27	26	breq1d 5151	. 2 ⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → (((od‘𝐺)‘𝑋) ∥ (𝐾 − 𝑀) ↔ 𝑁 ∥ (𝐾 − 𝑀)))
28	17	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → 𝐺 ∈ Grp)
29	19, 20, 21	iscyggen 19800	. . . . . 6 ⊢ (𝑋 ∈ 𝐸 ↔ (𝑋 ∈ 𝐵 ∧ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑋)) = 𝐵))
30	29	simplbi 497	. . . . 5 ⊢ (𝑋 ∈ 𝐸 → 𝑋 ∈ 𝐵)
31	18, 30	syl 17	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
32	31	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → 𝑋 ∈ 𝐵)
33		eqid 2726	. . . 4 ⊢ (0_g‘𝐺) = (0_g‘𝐺)
34	19, 22, 20, 33	odcong 19469	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → (((od‘𝐺)‘𝑋) ∥ (𝐾 − 𝑀) ↔ (𝐾 · 𝑋) = (𝑀 · 𝑋)))
35	28, 32, 9, 10, 34	syl112anc 1371	. 2 ⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → (((od‘𝐺)‘𝑋) ∥ (𝐾 − 𝑀) ↔ (𝐾 · 𝑋) = (𝑀 · 𝑋)))
36	14, 27, 35	3bitr2d 307	1 ⊢ ((𝜑 ∧ (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → ((𝐿‘𝐾) = (𝐿‘𝑀) ↔ (𝐾 · 𝑋) = (𝑀 · 𝑋)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1533 ∈ wcel 2098 {crab 3426 ifcif 4523 class class class wbr 5141 ↦ cmpt 5224 ran crn 5670 ‘cfv 6537 (class class class)co 7405 Fincfn 8941 0cc0 11112 − cmin 11448 ℕ₀cn0 12476 ℤcz 12562 ♯chash 14295 ∥ cdvds 16204 Basecbs 17153 0_gc0g 17394 Grpcgrp 18863 ._gcmg 18995 odcod 19444 CycGrpccyg 19797 ℤRHomczrh 21386 ℤ/nℤczn 21389

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2697 ax-rep 5278 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7722 ax-inf2 9638 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189 ax-pre-sup 11190 ax-addf 11191 ax-mulf 11192

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2704 df-cleq 2718 df-clel 2804 df-nfc 2879 df-ne 2935 df-nel 3041 df-ral 3056 df-rex 3065 df-rmo 3370 df-reu 3371 df-rab 3427 df-v 3470 df-sbc 3773 df-csb 3889 df-dif 3946 df-un 3948 df-in 3950 df-ss 3960 df-pss 3962 df-nul 4318 df-if 4524 df-pw 4599 df-sn 4624 df-pr 4626 df-tp 4628 df-op 4630 df-uni 4903 df-int 4944 df-iun 4992 df-br 5142 df-opab 5204 df-mpt 5225 df-tr 5259 df-id 5567 df-eprel 5573 df-po 5581 df-so 5582 df-fr 5624 df-se 5625 df-we 5626 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-pred 6294 df-ord 6361 df-on 6362 df-lim 6363 df-suc 6364 df-iota 6489 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-isom 6546 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7853 df-1st 7974 df-2nd 7975 df-tpos 8212 df-frecs 8267 df-wrecs 8298 df-recs 8372 df-rdg 8411 df-1o 8467 df-oadd 8471 df-omul 8472 df-er 8705 df-ec 8707 df-qs 8711 df-map 8824 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-sup 9439 df-inf 9440 df-oi 9507 df-card 9936 df-acn 9939 df-pnf 11254 df-mnf 11255 df-xr 11256 df-ltxr 11257 df-le 11258 df-sub 11450 df-neg 11451 df-div 11876 df-nn 12217 df-2 12279 df-3 12280 df-4 12281 df-5 12282 df-6 12283 df-7 12284 df-8 12285 df-9 12286 df-n0 12477 df-z 12563 df-dec 12682 df-uz 12827 df-rp 12981 df-fz 13491 df-fl 13763 df-mod 13841 df-seq 13973 df-exp 14033 df-hash 14296 df-cj 15052 df-re 15053 df-im 15054 df-sqrt 15188 df-abs 15189 df-dvds 16205 df-struct 17089 df-sets 17106 df-slot 17124 df-ndx 17136 df-base 17154 df-ress 17183 df-plusg 17219 df-mulr 17220 df-starv 17221 df-sca 17222 df-vsca 17223 df-ip 17224 df-tset 17225 df-ple 17226 df-ds 17228 df-unif 17229 df-0g 17396 df-imas 17463 df-qus 17464 df-mgm 18573 df-sgrp 18652 df-mnd 18668 df-mhm 18713 df-grp 18866 df-minusg 18867 df-sbg 18868 df-mulg 18996 df-subg 19050 df-nsg 19051 df-eqg 19052 df-ghm 19139 df-od 19448 df-cmn 19702 df-abl 19703 df-cyg 19798 df-mgp 20040 df-rng 20058 df-ur 20087 df-ring 20140 df-cring 20141 df-oppr 20236 df-dvdsr 20259 df-rhm 20374 df-subrng 20446 df-subrg 20471 df-lmod 20708 df-lss 20779 df-lsp 20819 df-sra 21021 df-rgmod 21022 df-lidl 21067 df-rsp 21068 df-2idl 21107 df-cnfld 21241 df-zring 21334 df-zrh 21390 df-zn 21393

This theorem is referenced by: cygznlem2a 21462 cygznlem3 21464

W3C validator