ablfaclem1 - Metamath Proof Explorer

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

Theorem ablfaclem1 20047

Description: Lemma for ablfac 20050. (Contributed by Mario Carneiro, 27-Apr-2016.) (Revised by Mario Carneiro, 3-May-2016.)

**Hypotheses**
Ref	Expression
ablfac.b	⊢ 𝐵 = (Base‘𝐺)
ablfac.c	⊢ 𝐶 = {𝑟 ∈ (SubGrp‘𝐺) ∣ (𝐺 ↾_s 𝑟) ∈ (CycGrp ∩ ran pGrp )}
ablfac.1	⊢ (𝜑 → 𝐺 ∈ Abel)
ablfac.2	⊢ (𝜑 → 𝐵 ∈ Fin)
ablfac.o	⊢ 𝑂 = (od‘𝐺)
ablfac.a	⊢ 𝐴 = {𝑤 ∈ ℙ ∣ 𝑤 ∥ (♯‘𝐵)}
ablfac.s	⊢ 𝑆 = (𝑝 ∈ 𝐴 ↦ {𝑥 ∈ 𝐵 ∣ (𝑂‘𝑥) ∥ (𝑝↑(𝑝 pCnt (♯‘𝐵)))})
ablfac.w	⊢ 𝑊 = (𝑔 ∈ (SubGrp‘𝐺) ↦ {𝑠 ∈ Word 𝐶 ∣ (𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑔)})

**Assertion**
Ref	Expression
ablfaclem1	⊢ (𝑈 ∈ (SubGrp‘𝐺) → (𝑊‘𝑈) = {𝑠 ∈ Word 𝐶 ∣ (𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑈)})

Distinct variable groups: 𝑠,𝑝,𝑥,𝐴 𝑔,𝑟,𝑠,𝑆 𝑔,𝑝,𝑤,𝑥,𝐵,𝑟,𝑠 𝑂,𝑝,𝑥 𝐶,𝑔,𝑝,𝑠,𝑤,𝑥 𝑊,𝑝,𝑤,𝑥 𝜑,𝑝,𝑠,𝑤,𝑥 𝑈,𝑔,𝑠 𝑔,𝐺,𝑝,𝑟,𝑠,𝑤,𝑥 Allowed substitution hints: 𝜑(𝑔,𝑟) 𝐴(𝑤,𝑔,𝑟) 𝐶(𝑟) 𝑆(𝑥,𝑤,𝑝) 𝑈(𝑥,𝑤,𝑟,𝑝) 𝑂(𝑤,𝑔,𝑠,𝑟) 𝑊(𝑔,𝑠,𝑟)

**Proof of Theorem ablfaclem1**
Step	Hyp	Ref	Expression
1		eqeq2 2739	. . . 4 ⊢ (𝑔 = 𝑈 → ((𝐺 DProd 𝑠) = 𝑔 ↔ (𝐺 DProd 𝑠) = 𝑈))
2	1	anbi2d 628	. . 3 ⊢ (𝑔 = 𝑈 → ((𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑔) ↔ (𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑈)))
3	2	rabbidv 3436	. 2 ⊢ (𝑔 = 𝑈 → {𝑠 ∈ Word 𝐶 ∣ (𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑔)} = {𝑠 ∈ Word 𝐶 ∣ (𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑈)})
4		ablfac.w	. 2 ⊢ 𝑊 = (𝑔 ∈ (SubGrp‘𝐺) ↦ {𝑠 ∈ Word 𝐶 ∣ (𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑔)})
5		ablfac.c	. . . . 5 ⊢ 𝐶 = {𝑟 ∈ (SubGrp‘𝐺) ∣ (𝐺 ↾_s 𝑟) ∈ (CycGrp ∩ ran pGrp )}
6		fvex 6913	. . . . 5 ⊢ (SubGrp‘𝐺) ∈ V
7	5, 6	rabex2 5338	. . . 4 ⊢ 𝐶 ∈ V
8	7	wrdexi 14514	. . 3 ⊢ Word 𝐶 ∈ V
9	8	rabex 5336	. 2 ⊢ {𝑠 ∈ Word 𝐶 ∣ (𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑈)} ∈ V
10	3, 4, 9	fvmpt 7008	1 ⊢ (𝑈 ∈ (SubGrp‘𝐺) → (𝑊‘𝑈) = {𝑠 ∈ Word 𝐶 ∣ (𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑈)})

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 394 = wceq 1533 ∈ wcel 2098 {crab 3428 ∩ cin 3946 class class class wbr 5150 ↦ cmpt 5233 dom cdm 5680 ran crn 5681 ‘cfv 6551 (class class class)co 7424 Fincfn 8968 ↑cexp 14064 ♯chash 14327 Word cword 14502 ∥ cdvds 16236 ℙcprime 16647 pCnt cpc 16810 Basecbs 17185 ↾_s cress 17214 SubGrpcsubg 19080 odcod 19484 pGrp cpgp 19486 Abelcabl 19741 CycGrpccyg 19837 DProd cdprd 19955

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 2166 ax-ext 2698 ax-rep 5287 ax-sep 5301 ax-nul 5308 ax-pow 5367 ax-pr 5431 ax-un 7744 ax-cnex 11200 ax-1cn 11202 ax-addcl 11204

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2529 df-eu 2558 df-clab 2705 df-cleq 2719 df-clel 2805 df-nfc 2880 df-ne 2937 df-ral 3058 df-rex 3067 df-reu 3373 df-rab 3429 df-v 3473 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4325 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4911 df-iun 5000 df-br 5151 df-opab 5213 df-mpt 5234 df-tr 5268 df-id 5578 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5635 df-we 5637 df-xp 5686 df-rel 5687 df-cnv 5688 df-co 5689 df-dm 5690 df-rn 5691 df-res 5692 df-ima 5693 df-pred 6308 df-ord 6375 df-on 6376 df-lim 6377 df-suc 6378 df-iota 6503 df-fun 6553 df-fn 6554 df-f 6555 df-f1 6556 df-fo 6557 df-f1o 6558 df-fv 6559 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7875 df-2nd 7998 df-frecs 8291 df-wrecs 8322 df-recs 8396 df-rdg 8435 df-map 8851 df-nn 12249 df-n0 12509 df-word 14503

This theorem is referenced by: ablfaclem2 20048 ablfaclem3 20049 ablfac 20050

W3C validator

	
		OSZAR »