cygznlem2a - Metamath Proof Explorer

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

Theorem cygznlem2a 21506

Description: Lemma for cygzn 21509. (Contributed by Mario Carneiro, 23-Dec-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	⊢ (𝜑 → 𝑋 ∈ 𝐸)
cygzn.f	⊢ 𝐹 = ran (𝑚 ∈ ℤ ↦ ⟨(𝐿‘𝑚), (𝑚 · 𝑋)⟩)

**Assertion**
Ref	Expression
cygznlem2a	⊢ (𝜑 → 𝐹:(Base‘𝑌)⟶𝐵)

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

Proof of Theorem cygznlem2a Dummy variable 𝑘 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cygzn.f	. . . 4 ⊢ 𝐹 = ran (𝑚 ∈ ℤ ↦ ⟨(𝐿‘𝑚), (𝑚 · 𝑋)⟩)
2		fvexd 6843	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ ℤ) → (𝐿‘𝑚) ∈ V)
3		cygzn.g	. . . . . . 7 ⊢ (𝜑 → 𝐺 ∈ CycGrp)
4		cyggrp 19804	. . . . . . 7 ⊢ (𝐺 ∈ CycGrp → 𝐺 ∈ Grp)
5	3, 4	syl 17	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ Grp)
6	5	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ ℤ) → 𝐺 ∈ Grp)
7		simpr 484	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ ℤ) → 𝑚 ∈ ℤ)
8		cygzn.e	. . . . . . . 8 ⊢ 𝐸 = {𝑥 ∈ 𝐵 ∣ ran (𝑛 ∈ ℤ ↦ (𝑛 · 𝑥)) = 𝐵}
9	8	ssrab3 4031	. . . . . . 7 ⊢ 𝐸 ⊆ 𝐵
10		cygzn.x	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝐸)
11	9, 10	sselid 3928	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
12	11	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ ℤ) → 𝑋 ∈ 𝐵)
13		cygzn.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐺)
14		cygzn.m	. . . . . 6 ⊢ · = (._g‘𝐺)
15	13, 14	mulgcl 19006	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑚 ∈ ℤ ∧ 𝑋 ∈ 𝐵) → (𝑚 · 𝑋) ∈ 𝐵)
16	6, 7, 12, 15	syl3anc 1373	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ ℤ) → (𝑚 · 𝑋) ∈ 𝐵)
17		fveq2 6828	. . . 4 ⊢ (𝑚 = 𝑘 → (𝐿‘𝑚) = (𝐿‘𝑘))
18		oveq1 7359	. . . 4 ⊢ (𝑚 = 𝑘 → (𝑚 · 𝑋) = (𝑘 · 𝑋))
19		cygzn.n	. . . . . . . 8 ⊢ 𝑁 = if(𝐵 ∈ Fin, (♯‘𝐵), 0)
20		cygzn.y	. . . . . . . 8 ⊢ 𝑌 = (ℤ/nℤ‘𝑁)
21		cygzn.l	. . . . . . . 8 ⊢ 𝐿 = (ℤRHom‘𝑌)
22	13, 19, 20, 14, 21, 8, 3, 10	cygznlem1 21505	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑘 ∈ ℤ)) → ((𝐿‘𝑚) = (𝐿‘𝑘) ↔ (𝑚 · 𝑋) = (𝑘 · 𝑋)))
23	22	biimpd 229	. . . . . 6 ⊢ ((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑘 ∈ ℤ)) → ((𝐿‘𝑚) = (𝐿‘𝑘) → (𝑚 · 𝑋) = (𝑘 · 𝑋)))
24	23	exp32 420	. . . . 5 ⊢ (𝜑 → (𝑚 ∈ ℤ → (𝑘 ∈ ℤ → ((𝐿‘𝑚) = (𝐿‘𝑘) → (𝑚 · 𝑋) = (𝑘 · 𝑋)))))
25	24	3imp2 1350	. . . 4 ⊢ ((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑘 ∈ ℤ ∧ (𝐿‘𝑚) = (𝐿‘𝑘))) → (𝑚 · 𝑋) = (𝑘 · 𝑋))
26	1, 2, 16, 17, 18, 25	fliftfund 7253	. . 3 ⊢ (𝜑 → Fun 𝐹)
27	1, 2, 16	fliftf 7255	. . 3 ⊢ (𝜑 → (Fun 𝐹 ↔ 𝐹:ran (𝑚 ∈ ℤ ↦ (𝐿‘𝑚))⟶𝐵))
28	26, 27	mpbid 232	. 2 ⊢ (𝜑 → 𝐹:ran (𝑚 ∈ ℤ ↦ (𝐿‘𝑚))⟶𝐵)
29		hashcl 14265	. . . . . . . . . . 11 ⊢ (𝐵 ∈ Fin → (♯‘𝐵) ∈ ℕ₀)
30	29	adantl 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐵 ∈ Fin) → (♯‘𝐵) ∈ ℕ₀)
31		0nn0 12403	. . . . . . . . . . 11 ⊢ 0 ∈ ℕ₀
32	31	a1i 11	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐵 ∈ Fin) → 0 ∈ ℕ₀)
33	30, 32	ifclda 4510	. . . . . . . . 9 ⊢ (𝜑 → if(𝐵 ∈ Fin, (♯‘𝐵), 0) ∈ ℕ₀)
34	19, 33	eqeltrid 2837	. . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
35		eqid 2733	. . . . . . . . 9 ⊢ (Base‘𝑌) = (Base‘𝑌)
36	20, 35, 21	znzrhfo 21486	. . . . . . . 8 ⊢ (𝑁 ∈ ℕ₀ → 𝐿:ℤ–onto→(Base‘𝑌))
37	34, 36	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐿:ℤ–onto→(Base‘𝑌))
38		fof 6740	. . . . . . 7 ⊢ (𝐿:ℤ–onto→(Base‘𝑌) → 𝐿:ℤ⟶(Base‘𝑌))
39	37, 38	syl 17	. . . . . 6 ⊢ (𝜑 → 𝐿:ℤ⟶(Base‘𝑌))
40	39	feqmptd 6896	. . . . 5 ⊢ (𝜑 → 𝐿 = (𝑚 ∈ ℤ ↦ (𝐿‘𝑚)))
41	40	rneqd 5882	. . . 4 ⊢ (𝜑 → ran 𝐿 = ran (𝑚 ∈ ℤ ↦ (𝐿‘𝑚)))
42		forn 6743	. . . . 5 ⊢ (𝐿:ℤ–onto→(Base‘𝑌) → ran 𝐿 = (Base‘𝑌))
43	37, 42	syl 17	. . . 4 ⊢ (𝜑 → ran 𝐿 = (Base‘𝑌))
44	41, 43	eqtr3d 2770	. . 3 ⊢ (𝜑 → ran (𝑚 ∈ ℤ ↦ (𝐿‘𝑚)) = (Base‘𝑌))
45	44	feq2d 6640	. 2 ⊢ (𝜑 → (𝐹:ran (𝑚 ∈ ℤ ↦ (𝐿‘𝑚))⟶𝐵 ↔ 𝐹:(Base‘𝑌)⟶𝐵))
46	28, 45	mpbid 232	1 ⊢ (𝜑 → 𝐹:(Base‘𝑌)⟶𝐵)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 {crab 3396 Vcvv 3437 ifcif 4474 ⟨cop 4581 ↦ cmpt 5174 ran crn 5620 Fun wfun 6480 ⟶wf 6482 –onto→wfo 6484 ‘cfv 6486 (class class class)co 7352 Fincfn 8875 0cc0 11013 ℕ₀cn0 12388 ℤcz 12475 ♯chash 14239 Basecbs 17122 Grpcgrp 18848 ._gcmg 18982 CycGrpccyg 19791 ℤRHomczrh 21438 ℤ/nℤczn 21441

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 2182 ax-ext 2705 ax-rep 5219 ax-sep 5236 ax-nul 5246 ax-pow 5305 ax-pr 5372 ax-un 7674 ax-inf2 9538 ax-cnex 11069 ax-resscn 11070 ax-1cn 11071 ax-icn 11072 ax-addcl 11073 ax-addrcl 11074 ax-mulcl 11075 ax-mulrcl 11076 ax-mulcom 11077 ax-addass 11078 ax-mulass 11079 ax-distr 11080 ax-i2m1 11081 ax-1ne0 11082 ax-1rid 11083 ax-rnegex 11084 ax-rrecex 11085 ax-cnre 11086 ax-pre-lttri 11087 ax-pre-lttrn 11088 ax-pre-ltadd 11089 ax-pre-mulgt0 11090 ax-pre-sup 11091 ax-addf 11092 ax-mulf 11093

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 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-nel 3034 df-ral 3049 df-rex 3058 df-rmo 3347 df-reu 3348 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4283 df-if 4475 df-pw 4551 df-sn 4576 df-pr 4578 df-tp 4580 df-op 4582 df-uni 4859 df-int 4898 df-iun 4943 df-br 5094 df-opab 5156 df-mpt 5175 df-tr 5201 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-se 5573 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6253 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-isom 6495 df-riota 7309 df-ov 7355 df-oprab 7356 df-mpo 7357 df-om 7803 df-1st 7927 df-2nd 7928 df-tpos 8162 df-frecs 8217 df-wrecs 8248 df-recs 8297 df-rdg 8335 df-1o 8391 df-oadd 8395 df-omul 8396 df-er 8628 df-ec 8630 df-qs 8634 df-map 8758 df-en 8876 df-dom 8877 df-sdom 8878 df-fin 8879 df-sup 9333 df-inf 9334 df-oi 9403 df-card 9839 df-acn 9842 df-pnf 11155 df-mnf 11156 df-xr 11157 df-ltxr 11158 df-le 11159 df-sub 11353 df-neg 11354 df-div 11782 df-nn 12133 df-2 12195 df-3 12196 df-4 12197 df-5 12198 df-6 12199 df-7 12200 df-8 12201 df-9 12202 df-n0 12389 df-z 12476 df-dec 12595 df-uz 12739 df-rp 12893 df-fz 13410 df-fl 13698 df-mod 13776 df-seq 13911 df-exp 13971 df-hash 14240 df-cj 15008 df-re 15009 df-im 15010 df-sqrt 15144 df-abs 15145 df-dvds 16166 df-struct 17060 df-sets 17077 df-slot 17095 df-ndx 17107 df-base 17123 df-ress 17144 df-plusg 17176 df-mulr 17177 df-starv 17178 df-sca 17179 df-vsca 17180 df-ip 17181 df-tset 17182 df-ple 17183 df-ds 17185 df-unif 17186 df-0g 17347 df-imas 17414 df-qus 17415 df-mgm 18550 df-sgrp 18629 df-mnd 18645 df-mhm 18693 df-grp 18851 df-minusg 18852 df-sbg 18853 df-mulg 18983 df-subg 19038 df-nsg 19039 df-eqg 19040 df-ghm 19127 df-od 19442 df-cmn 19696 df-abl 19697 df-cyg 19792 df-mgp 20061 df-rng 20073 df-ur 20102 df-ring 20155 df-cring 20156 df-oppr 20257 df-dvdsr 20277 df-rhm 20392 df-subrng 20463 df-subrg 20487 df-lmod 20797 df-lss 20867 df-lsp 20907 df-sra 21109 df-rgmod 21110 df-lidl 21147 df-rsp 21148 df-2idl 21189 df-cnfld 21294 df-zring 21386 df-zrh 21442 df-zn 21445

This theorem is referenced by: cygznlem2 21507 cygznlem3 21508

W3C validator