![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ablfaclem1 | Structured version Visualization version GIF version |
Description: Lemma for ablfac 19867. (Contributed by Mario Carneiro, 27-Apr-2016.) (Revised by Mario Carneiro, 3-May-2016.) |
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 𝑠) = 𝑔)}) |
Ref | Expression |
---|---|
ablfaclem1 | ⊢ (𝑈 ∈ (SubGrp‘𝐺) → (𝑊‘𝑈) = {𝑠 ∈ Word 𝐶 ∣ (𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑈)}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqeq2 2748 | . . . 4 ⊢ (𝑔 = 𝑈 → ((𝐺 DProd 𝑠) = 𝑔 ↔ (𝐺 DProd 𝑠) = 𝑈)) | |
2 | 1 | anbi2d 629 | . . 3 ⊢ (𝑔 = 𝑈 → ((𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑔) ↔ (𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑈))) |
3 | 2 | rabbidv 3415 | . 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 6855 | . . . . 5 ⊢ (SubGrp‘𝐺) ∈ V | |
7 | 5, 6 | rabex2 5291 | . . . 4 ⊢ 𝐶 ∈ V |
8 | 7 | wrdexi 14414 | . . 3 ⊢ Word 𝐶 ∈ V |
9 | 8 | rabex 5289 | . 2 ⊢ {𝑠 ∈ Word 𝐶 ∣ (𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑈)} ∈ V |
10 | 3, 4, 9 | fvmpt 6948 | 1 ⊢ (𝑈 ∈ (SubGrp‘𝐺) → (𝑊‘𝑈) = {𝑠 ∈ Word 𝐶 ∣ (𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑈)}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1541 ∈ wcel 2106 {crab 3407 ∩ cin 3909 class class class wbr 5105 ↦ cmpt 5188 dom cdm 5633 ran crn 5634 ‘cfv 6496 (class class class)co 7357 Fincfn 8883 ↑cexp 13967 ♯chash 14230 Word cword 14402 ∥ cdvds 16136 ℙcprime 16547 pCnt cpc 16708 Basecbs 17083 ↾s cress 17112 SubGrpcsubg 18922 odcod 19306 pGrp cpgp 19308 Abelcabl 19563 CycGrpccyg 19654 DProd cdprd 19772 |
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 2707 ax-rep 5242 ax-sep 5256 ax-nul 5263 ax-pow 5320 ax-pr 5384 ax-un 7672 ax-cnex 11107 ax-1cn 11109 ax-addcl 11111 |
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 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-ral 3065 df-rex 3074 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-pss 3929 df-nul 4283 df-if 4487 df-pw 4562 df-sn 4587 df-pr 4589 df-op 4593 df-uni 4866 df-iun 4956 df-br 5106 df-opab 5168 df-mpt 5189 df-tr 5223 df-id 5531 df-eprel 5537 df-po 5545 df-so 5546 df-fr 5588 df-we 5590 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-pred 6253 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-ov 7360 df-oprab 7361 df-mpo 7362 df-om 7803 df-2nd 7922 df-frecs 8212 df-wrecs 8243 df-recs 8317 df-rdg 8356 df-map 8767 df-nn 12154 df-n0 12414 df-word 14403 |
This theorem is referenced by: ablfaclem2 19865 ablfaclem3 19866 ablfac 19867 |
Copyright terms: Public domain | W3C validator |