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

Theorem subgdprd 20003
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 19096 . . . . . 6 (𝐴 ∈ (SubGrp‘𝐺) → 𝐻 ∈ Grp)
41, 3syl 17 . . . . 5 (𝜑𝐻 ∈ Grp)
5 eqid 2737 . . . . . 6 (Base‘𝐻) = (Base‘𝐻)
65subgacs 19127 . . . . 5 (𝐻 ∈ Grp → (SubGrp‘𝐻) ∈ (ACS‘(Base‘𝐻)))
7 acsmre 17609 . . . . 5 ((SubGrp‘𝐻) ∈ (ACS‘(Base‘𝐻)) → (SubGrp‘𝐻) ∈ (Moore‘(Base‘𝐻)))
84, 6, 73syl 18 . . . 4 (𝜑 → (SubGrp‘𝐻) ∈ (Moore‘(Base‘𝐻)))
9 subgrcl 19098 . . . . . . 7 (𝐴 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
101, 9syl 17 . . . . . 6 (𝜑𝐺 ∈ Grp)
11 eqid 2737 . . . . . . 7 (Base‘𝐺) = (Base‘𝐺)
1211subgacs 19127 . . . . . 6 (𝐺 ∈ Grp → (SubGrp‘𝐺) ∈ (ACS‘(Base‘𝐺)))
13 acsmre 17609 . . . . . 6 ((SubGrp‘𝐺) ∈ (ACS‘(Base‘𝐺)) → (SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)))
1410, 12, 133syl 18 . . . . 5 (𝜑 → (SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)))
15 eqid 2737 . . . . 5 (mrCls‘(SubGrp‘𝐺)) = (mrCls‘(SubGrp‘𝐺))
16 subgdprd.3 . . . . . . . 8 (𝜑𝐺dom DProd 𝑆)
17 dprdf 19974 . . . . . . . 8 (𝐺dom DProd 𝑆𝑆:dom 𝑆⟶(SubGrp‘𝐺))
18 frn 6669 . . . . . . . 8 (𝑆:dom 𝑆⟶(SubGrp‘𝐺) → ran 𝑆 ⊆ (SubGrp‘𝐺))
1916, 17, 183syl 18 . . . . . . 7 (𝜑 → ran 𝑆 ⊆ (SubGrp‘𝐺))
20 mresspw 17545 . . . . . . . 8 ((SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)) → (SubGrp‘𝐺) ⊆ 𝒫 (Base‘𝐺))
2114, 20syl 17 . . . . . . 7 (𝜑 → (SubGrp‘𝐺) ⊆ 𝒫 (Base‘𝐺))
2219, 21sstrd 3933 . . . . . 6 (𝜑 → ran 𝑆 ⊆ 𝒫 (Base‘𝐺))
23 sspwuni 5043 . . . . . 6 (ran 𝑆 ⊆ 𝒫 (Base‘𝐺) ↔ ran 𝑆 ⊆ (Base‘𝐺))
2422, 23sylib 218 . . . . 5 (𝜑 ran 𝑆 ⊆ (Base‘𝐺))
2514, 15, 24mrcssidd 17582 . . . 4 (𝜑 ran 𝑆 ⊆ ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆))
2615mrccl 17568 . . . . . 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 5043 . . . . . . 7 (ran 𝑆 ⊆ 𝒫 𝐴 ran 𝑆𝐴)
3028, 29sylib 218 . . . . . 6 (𝜑 ran 𝑆𝐴)
3115mrcsscl 17577 . . . . . 6 (((SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)) ∧ ran 𝑆𝐴𝐴 ∈ (SubGrp‘𝐺)) → ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ⊆ 𝐴)
3214, 30, 1, 31syl3anc 1374 . . . . 5 (𝜑 → ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ⊆ 𝐴)
332subsubg 19116 . . . . . 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 2737 . . . . 5 (mrCls‘(SubGrp‘𝐻)) = (mrCls‘(SubGrp‘𝐻))
3736mrcsscl 17577 . . . 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 20002 . . . . . . . . . . 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 2738 . . . . . . . . 9 (𝜑 → dom 𝑆 = dom 𝑆)
4341, 42dprdf2 19975 . . . . . . . 8 (𝜑𝑆:dom 𝑆⟶(SubGrp‘𝐻))
4443frnd 6670 . . . . . . 7 (𝜑 → ran 𝑆 ⊆ (SubGrp‘𝐻))
45 mresspw 17545 . . . . . . . 8 ((SubGrp‘𝐻) ∈ (Moore‘(Base‘𝐻)) → (SubGrp‘𝐻) ⊆ 𝒫 (Base‘𝐻))
468, 45syl 17 . . . . . . 7 (𝜑 → (SubGrp‘𝐻) ⊆ 𝒫 (Base‘𝐻))
4744, 46sstrd 3933 . . . . . 6 (𝜑 → ran 𝑆 ⊆ 𝒫 (Base‘𝐻))
48 sspwuni 5043 . . . . . 6 (ran 𝑆 ⊆ 𝒫 (Base‘𝐻) ↔ ran 𝑆 ⊆ (Base‘𝐻))
4947, 48sylib 218 . . . . 5 (𝜑 ran 𝑆 ⊆ (Base‘𝐻))
508, 36, 49mrcssidd 17582 . . . 4 (𝜑 ran 𝑆 ⊆ ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆))
5136mrccl 17568 . . . . . . 7 (((SubGrp‘𝐻) ∈ (Moore‘(Base‘𝐻)) ∧ ran 𝑆 ⊆ (Base‘𝐻)) → ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ∈ (SubGrp‘𝐻))
528, 49, 51syl2anc 585 . . . . . 6 (𝜑 → ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ∈ (SubGrp‘𝐻))
532subsubg 19116 . . . . . . 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 17577 . . . 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 3940 . 2 (𝜑 → ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) = ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆))
6036dprdspan 19995 . . 3 (𝐻dom DProd 𝑆 → (𝐻 DProd 𝑆) = ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆))
6141, 60syl 17 . 2 (𝜑 → (𝐻 DProd 𝑆) = ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆))
6215dprdspan 19995 . . 3 (𝐺dom DProd 𝑆 → (𝐺 DProd 𝑆) = ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆))
6316, 62syl 17 . 2 (𝜑 → (𝐺 DProd 𝑆) = ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆))
6459, 61, 633eqtr4d 2782 1 (𝜑 → (𝐻 DProd 𝑆) = (𝐺 DProd 𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  wss 3890  𝒫 cpw 4542   cuni 4851   class class class wbr 5086  dom cdm 5624  ran crn 5625  wf 6488  cfv 6492  (class class class)co 7360  Basecbs 17170  s cress 17191  Moorecmre 17535  mrClscmrc 17536  ACScacs 17538  Grpcgrp 18900  SubGrpcsubg 19087   DProd cdprd 19961
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 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682  ax-cnex 11085  ax-resscn 11086  ax-1cn 11087  ax-icn 11088  ax-addcl 11089  ax-addrcl 11090  ax-mulcl 11091  ax-mulrcl 11092  ax-mulcom 11093  ax-addass 11094  ax-mulass 11095  ax-distr 11096  ax-i2m1 11097  ax-1ne0 11098  ax-1rid 11099  ax-rnegex 11100  ax-rrecex 11101  ax-cnre 11102  ax-pre-lttri 11103  ax-pre-lttrn 11104  ax-pre-ltadd 11105  ax-pre-mulgt0 11106
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 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-int 4891  df-iun 4936  df-iin 4937  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-se 5578  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-isom 6501  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-of 7624  df-om 7811  df-1st 7935  df-2nd 7936  df-supp 8104  df-tpos 8169  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8342  df-1o 8398  df-2o 8399  df-er 8636  df-map 8768  df-ixp 8839  df-en 8887  df-dom 8888  df-sdom 8889  df-fin 8890  df-fsupp 9268  df-oi 9418  df-card 9854  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-sub 11370  df-neg 11371  df-nn 12166  df-2 12235  df-n0 12429  df-z 12516  df-uz 12780  df-fz 13453  df-fzo 13600  df-seq 13955  df-hash 14284  df-sets 17125  df-slot 17143  df-ndx 17155  df-base 17171  df-ress 17192  df-plusg 17224  df-0g 17395  df-gsum 17396  df-mre 17539  df-mrc 17540  df-acs 17542  df-mgm 18599  df-sgrp 18678  df-mnd 18694  df-mhm 18742  df-submnd 18743  df-grp 18903  df-minusg 18904  df-sbg 18905  df-mulg 19035  df-subg 19090  df-ghm 19179  df-gim 19225  df-cntz 19283  df-oppg 19312  df-cmn 19748  df-dprd 19963
This theorem is referenced by:  ablfaclem3  20055
  Copyright terms: Public domain W3C validator