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

Theorem subgdprd 20012
Description: A direct product in a subgroup. (Contributed by Mario Carneiro, 27-Apr-2016.)
Hypotheses
Ref Expression
subgdprd.1 𝐻 = (𝐺s 𝐴)
subgdprd.2 (𝜑𝐴 ∈ (SubGrp‘𝐺))
subgdprd.3 (𝜑𝐺dom DProd 𝑆)
subgdprd.4 (𝜑 → ran 𝑆 ⊆ 𝒫 𝐴)
Assertion
Ref Expression
subgdprd (𝜑 → (𝐻 DProd 𝑆) = (𝐺 DProd 𝑆))

Proof of Theorem subgdprd
StepHypRef Expression
1 subgdprd.2 . . . . . 6 (𝜑𝐴 ∈ (SubGrp‘𝐺))
2 subgdprd.1 . . . . . . 7 𝐻 = (𝐺s 𝐴)
32subggrp 19105 . . . . . 6 (𝐴 ∈ (SubGrp‘𝐺) → 𝐻 ∈ Grp)
41, 3syl 17 . . . . 5 (𝜑𝐻 ∈ Grp)
5 eqid 2736 . . . . . 6 (Base‘𝐻) = (Base‘𝐻)
65subgacs 19136 . . . . 5 (𝐻 ∈ Grp → (SubGrp‘𝐻) ∈ (ACS‘(Base‘𝐻)))
7 acsmre 17618 . . . . 5 ((SubGrp‘𝐻) ∈ (ACS‘(Base‘𝐻)) → (SubGrp‘𝐻) ∈ (Moore‘(Base‘𝐻)))
84, 6, 73syl 18 . . . 4 (𝜑 → (SubGrp‘𝐻) ∈ (Moore‘(Base‘𝐻)))
9 subgrcl 19107 . . . . . . 7 (𝐴 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
101, 9syl 17 . . . . . 6 (𝜑𝐺 ∈ Grp)
11 eqid 2736 . . . . . . 7 (Base‘𝐺) = (Base‘𝐺)
1211subgacs 19136 . . . . . 6 (𝐺 ∈ Grp → (SubGrp‘𝐺) ∈ (ACS‘(Base‘𝐺)))
13 acsmre 17618 . . . . . 6 ((SubGrp‘𝐺) ∈ (ACS‘(Base‘𝐺)) → (SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)))
1410, 12, 133syl 18 . . . . 5 (𝜑 → (SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)))
15 eqid 2736 . . . . 5 (mrCls‘(SubGrp‘𝐺)) = (mrCls‘(SubGrp‘𝐺))
16 subgdprd.3 . . . . . . . 8 (𝜑𝐺dom DProd 𝑆)
17 dprdf 19983 . . . . . . . 8 (𝐺dom DProd 𝑆𝑆:dom 𝑆⟶(SubGrp‘𝐺))
18 frn 6675 . . . . . . . 8 (𝑆:dom 𝑆⟶(SubGrp‘𝐺) → ran 𝑆 ⊆ (SubGrp‘𝐺))
1916, 17, 183syl 18 . . . . . . 7 (𝜑 → ran 𝑆 ⊆ (SubGrp‘𝐺))
20 mresspw 17554 . . . . . . . 8 ((SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)) → (SubGrp‘𝐺) ⊆ 𝒫 (Base‘𝐺))
2114, 20syl 17 . . . . . . 7 (𝜑 → (SubGrp‘𝐺) ⊆ 𝒫 (Base‘𝐺))
2219, 21sstrd 3932 . . . . . 6 (𝜑 → ran 𝑆 ⊆ 𝒫 (Base‘𝐺))
23 sspwuni 5042 . . . . . 6 (ran 𝑆 ⊆ 𝒫 (Base‘𝐺) ↔ ran 𝑆 ⊆ (Base‘𝐺))
2422, 23sylib 218 . . . . 5 (𝜑 ran 𝑆 ⊆ (Base‘𝐺))
2514, 15, 24mrcssidd 17591 . . . 4 (𝜑 ran 𝑆 ⊆ ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆))
2615mrccl 17577 . . . . . 6 (((SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)) ∧ ran 𝑆 ⊆ (Base‘𝐺)) → ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ∈ (SubGrp‘𝐺))
2714, 24, 26syl2anc 585 . . . . 5 (𝜑 → ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ∈ (SubGrp‘𝐺))
28 subgdprd.4 . . . . . . 7 (𝜑 → ran 𝑆 ⊆ 𝒫 𝐴)
29 sspwuni 5042 . . . . . . 7 (ran 𝑆 ⊆ 𝒫 𝐴 ran 𝑆𝐴)
3028, 29sylib 218 . . . . . 6 (𝜑 ran 𝑆𝐴)
3115mrcsscl 17586 . . . . . 6 (((SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)) ∧ ran 𝑆𝐴𝐴 ∈ (SubGrp‘𝐺)) → ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ⊆ 𝐴)
3214, 30, 1, 31syl3anc 1374 . . . . 5 (𝜑 → ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ⊆ 𝐴)
332subsubg 19125 . . . . . 6 (𝐴 ∈ (SubGrp‘𝐺) → (((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ∈ (SubGrp‘𝐻) ↔ (((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ∈ (SubGrp‘𝐺) ∧ ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ⊆ 𝐴)))
341, 33syl 17 . . . . 5 (𝜑 → (((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ∈ (SubGrp‘𝐻) ↔ (((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ∈ (SubGrp‘𝐺) ∧ ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ⊆ 𝐴)))
3527, 32, 34mpbir2and 714 . . . 4 (𝜑 → ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ∈ (SubGrp‘𝐻))
36 eqid 2736 . . . . 5 (mrCls‘(SubGrp‘𝐻)) = (mrCls‘(SubGrp‘𝐻))
3736mrcsscl 17586 . . . 4 (((SubGrp‘𝐻) ∈ (Moore‘(Base‘𝐻)) ∧ ran 𝑆 ⊆ ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ∧ ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ∈ (SubGrp‘𝐻)) → ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ⊆ ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆))
388, 25, 35, 37syl3anc 1374 . . 3 (𝜑 → ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ⊆ ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆))
392subgdmdprd 20011 . . . . . . . . . . 11 (𝐴 ∈ (SubGrp‘𝐺) → (𝐻dom DProd 𝑆 ↔ (𝐺dom DProd 𝑆 ∧ ran 𝑆 ⊆ 𝒫 𝐴)))
401, 39syl 17 . . . . . . . . . 10 (𝜑 → (𝐻dom DProd 𝑆 ↔ (𝐺dom DProd 𝑆 ∧ ran 𝑆 ⊆ 𝒫 𝐴)))
4116, 28, 40mpbir2and 714 . . . . . . . . 9 (𝜑𝐻dom DProd 𝑆)
42 eqidd 2737 . . . . . . . . 9 (𝜑 → dom 𝑆 = dom 𝑆)
4341, 42dprdf2 19984 . . . . . . . 8 (𝜑𝑆:dom 𝑆⟶(SubGrp‘𝐻))
4443frnd 6676 . . . . . . 7 (𝜑 → ran 𝑆 ⊆ (SubGrp‘𝐻))
45 mresspw 17554 . . . . . . . 8 ((SubGrp‘𝐻) ∈ (Moore‘(Base‘𝐻)) → (SubGrp‘𝐻) ⊆ 𝒫 (Base‘𝐻))
468, 45syl 17 . . . . . . 7 (𝜑 → (SubGrp‘𝐻) ⊆ 𝒫 (Base‘𝐻))
4744, 46sstrd 3932 . . . . . 6 (𝜑 → ran 𝑆 ⊆ 𝒫 (Base‘𝐻))
48 sspwuni 5042 . . . . . 6 (ran 𝑆 ⊆ 𝒫 (Base‘𝐻) ↔ ran 𝑆 ⊆ (Base‘𝐻))
4947, 48sylib 218 . . . . 5 (𝜑 ran 𝑆 ⊆ (Base‘𝐻))
508, 36, 49mrcssidd 17591 . . . 4 (𝜑 ran 𝑆 ⊆ ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆))
5136mrccl 17577 . . . . . . 7 (((SubGrp‘𝐻) ∈ (Moore‘(Base‘𝐻)) ∧ ran 𝑆 ⊆ (Base‘𝐻)) → ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ∈ (SubGrp‘𝐻))
528, 49, 51syl2anc 585 . . . . . 6 (𝜑 → ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ∈ (SubGrp‘𝐻))
532subsubg 19125 . . . . . . 7 (𝐴 ∈ (SubGrp‘𝐺) → (((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ∈ (SubGrp‘𝐻) ↔ (((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ∈ (SubGrp‘𝐺) ∧ ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ⊆ 𝐴)))
541, 53syl 17 . . . . . 6 (𝜑 → (((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ∈ (SubGrp‘𝐻) ↔ (((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ∈ (SubGrp‘𝐺) ∧ ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ⊆ 𝐴)))
5552, 54mpbid 232 . . . . 5 (𝜑 → (((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ∈ (SubGrp‘𝐺) ∧ ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ⊆ 𝐴))
5655simpld 494 . . . 4 (𝜑 → ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ∈ (SubGrp‘𝐺))
5715mrcsscl 17586 . . . 4 (((SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)) ∧ ran 𝑆 ⊆ ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ∧ ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ∈ (SubGrp‘𝐺)) → ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ⊆ ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆))
5814, 50, 56, 57syl3anc 1374 . . 3 (𝜑 → ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ⊆ ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆))
5938, 58eqssd 3939 . 2 (𝜑 → ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) = ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆))
6036dprdspan 20004 . . 3 (𝐻dom DProd 𝑆 → (𝐻 DProd 𝑆) = ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆))
6141, 60syl 17 . 2 (𝜑 → (𝐻 DProd 𝑆) = ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆))
6215dprdspan 20004 . . 3 (𝐺dom DProd 𝑆 → (𝐺 DProd 𝑆) = ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆))
6316, 62syl 17 . 2 (𝜑 → (𝐺 DProd 𝑆) = ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆))
6459, 61, 633eqtr4d 2781 1 (𝜑 → (𝐻 DProd 𝑆) = (𝐺 DProd 𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  wss 3889  𝒫 cpw 4541   cuni 4850   class class class wbr 5085  dom cdm 5631  ran crn 5632  wf 6494  cfv 6498  (class class class)co 7367  Basecbs 17179  s cress 17200  Moorecmre 17544  mrClscmrc 17545  ACScacs 17547  Grpcgrp 18909  SubGrpcsubg 19096   DProd cdprd 19970
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-iin 4936  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-se 5585  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-isom 6507  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-of 7631  df-om 7818  df-1st 7942  df-2nd 7943  df-supp 8111  df-tpos 8176  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-1o 8405  df-2o 8406  df-er 8643  df-map 8775  df-ixp 8846  df-en 8894  df-dom 8895  df-sdom 8896  df-fin 8897  df-fsupp 9275  df-oi 9425  df-card 9863  df-pnf 11181  df-mnf 11182  df-xr 11183  df-ltxr 11184  df-le 11185  df-sub 11379  df-neg 11380  df-nn 12175  df-2 12244  df-n0 12438  df-z 12525  df-uz 12789  df-fz 13462  df-fzo 13609  df-seq 13964  df-hash 14293  df-sets 17134  df-slot 17152  df-ndx 17164  df-base 17180  df-ress 17201  df-plusg 17233  df-0g 17404  df-gsum 17405  df-mre 17548  df-mrc 17549  df-acs 17551  df-mgm 18608  df-sgrp 18687  df-mnd 18703  df-mhm 18751  df-submnd 18752  df-grp 18912  df-minusg 18913  df-sbg 18914  df-mulg 19044  df-subg 19099  df-ghm 19188  df-gim 19234  df-cntz 19292  df-oppg 19321  df-cmn 19757  df-dprd 19972
This theorem is referenced by:  ablfaclem3  20064
  Copyright terms: Public domain W3C validator