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

Theorem ablfaclem1 18800
Description: Lemma for ablfac 18803. (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
StepHypRef Expression
1 eqeq2 2810 . . . 4 (𝑔 = 𝑈 → ((𝐺 DProd 𝑠) = 𝑔 ↔ (𝐺 DProd 𝑠) = 𝑈))
21anbi2d 623 . . 3 (𝑔 = 𝑈 → ((𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑔) ↔ (𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑈)))
32rabbidv 3373 . 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 6424 . . . . 5 (SubGrp‘𝐺) ∈ V
75, 6rabex2 5009 . . . 4 𝐶 ∈ V
8 wrdexg 13544 . . . 4 (𝐶 ∈ V → Word 𝐶 ∈ V)
97, 8ax-mp 5 . . 3 Word 𝐶 ∈ V
109rabex 5007 . 2 {𝑠 ∈ Word 𝐶 ∣ (𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑈)} ∈ V
113, 4, 10fvmpt 6507 1 (𝑈 ∈ (SubGrp‘𝐺) → (𝑊𝑈) = {𝑠 ∈ Word 𝐶 ∣ (𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑈)})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 385   = wceq 1653  wcel 2157  {crab 3093  Vcvv 3385  cin 3768   class class class wbr 4843  cmpt 4922  dom cdm 5312  ran crn 5313  cfv 6101  (class class class)co 6878  Fincfn 8195  cexp 13114  chash 13370  Word cword 13534  cdvds 15319  cprime 15719   pCnt cpc 15874  Basecbs 16184  s cress 16185  SubGrpcsubg 17901  odcod 18257   pGrp cpgp 18259  Abelcabl 18509  CycGrpccyg 18594   DProd cdprd 18708
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1891  ax-4 1905  ax-5 2006  ax-6 2072  ax-7 2107  ax-8 2159  ax-9 2166  ax-10 2185  ax-11 2200  ax-12 2213  ax-13 2377  ax-ext 2777  ax-sep 4975  ax-nul 4983  ax-pow 5035  ax-pr 5097  ax-un 7183  ax-cnex 10280  ax-resscn 10281
This theorem depends on definitions:  df-bi 199  df-an 386  df-or 875  df-3or 1109  df-3an 1110  df-tru 1657  df-ex 1876  df-nf 1880  df-sb 2065  df-mo 2591  df-eu 2609  df-clab 2786  df-cleq 2792  df-clel 2795  df-nfc 2930  df-ne 2972  df-ral 3094  df-rex 3095  df-rab 3098  df-v 3387  df-sbc 3634  df-csb 3729  df-dif 3772  df-un 3774  df-in 3776  df-ss 3783  df-nul 4116  df-if 4278  df-pw 4351  df-sn 4369  df-pr 4371  df-op 4375  df-uni 4629  df-iun 4712  df-br 4844  df-opab 4906  df-mpt 4923  df-id 5220  df-xp 5318  df-rel 5319  df-cnv 5320  df-co 5321  df-dm 5322  df-rn 5323  df-res 5324  df-ima 5325  df-iota 6064  df-fun 6103  df-fn 6104  df-f 6105  df-fv 6109  df-ov 6881  df-oprab 6882  df-mpt2 6883  df-1st 7401  df-2nd 7402  df-map 8097  df-pm 8098  df-neg 10559  df-z 11667  df-uz 11931  df-fz 12581  df-fzo 12721  df-word 13535
This theorem is referenced by:  ablfaclem2  18801  ablfaclem3  18802  ablfac  18803
  Copyright terms: Public domain W3C validator