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

Theorem subgdprd 19151
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 18276 . . . . . 6 (𝐴 ∈ (SubGrp‘𝐺) → 𝐻 ∈ Grp)
41, 3syl 17 . . . . 5 (𝜑𝐻 ∈ Grp)
5 eqid 2821 . . . . . 6 (Base‘𝐻) = (Base‘𝐻)
65subgacs 18307 . . . . 5 (𝐻 ∈ Grp → (SubGrp‘𝐻) ∈ (ACS‘(Base‘𝐻)))
7 acsmre 16917 . . . . 5 ((SubGrp‘𝐻) ∈ (ACS‘(Base‘𝐻)) → (SubGrp‘𝐻) ∈ (Moore‘(Base‘𝐻)))
84, 6, 73syl 18 . . . 4 (𝜑 → (SubGrp‘𝐻) ∈ (Moore‘(Base‘𝐻)))
9 subgrcl 18278 . . . . . . 7 (𝐴 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
101, 9syl 17 . . . . . 6 (𝜑𝐺 ∈ Grp)
11 eqid 2821 . . . . . . 7 (Base‘𝐺) = (Base‘𝐺)
1211subgacs 18307 . . . . . 6 (𝐺 ∈ Grp → (SubGrp‘𝐺) ∈ (ACS‘(Base‘𝐺)))
13 acsmre 16917 . . . . . 6 ((SubGrp‘𝐺) ∈ (ACS‘(Base‘𝐺)) → (SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)))
1410, 12, 133syl 18 . . . . 5 (𝜑 → (SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)))
15 eqid 2821 . . . . 5 (mrCls‘(SubGrp‘𝐺)) = (mrCls‘(SubGrp‘𝐺))
16 subgdprd.3 . . . . . . . 8 (𝜑𝐺dom DProd 𝑆)
17 dprdf 19122 . . . . . . . 8 (𝐺dom DProd 𝑆𝑆:dom 𝑆⟶(SubGrp‘𝐺))
18 frn 6514 . . . . . . . 8 (𝑆:dom 𝑆⟶(SubGrp‘𝐺) → ran 𝑆 ⊆ (SubGrp‘𝐺))
1916, 17, 183syl 18 . . . . . . 7 (𝜑 → ran 𝑆 ⊆ (SubGrp‘𝐺))
20 mresspw 16857 . . . . . . . 8 ((SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)) → (SubGrp‘𝐺) ⊆ 𝒫 (Base‘𝐺))
2114, 20syl 17 . . . . . . 7 (𝜑 → (SubGrp‘𝐺) ⊆ 𝒫 (Base‘𝐺))
2219, 21sstrd 3976 . . . . . 6 (𝜑 → ran 𝑆 ⊆ 𝒫 (Base‘𝐺))
23 sspwuni 5014 . . . . . 6 (ran 𝑆 ⊆ 𝒫 (Base‘𝐺) ↔ ran 𝑆 ⊆ (Base‘𝐺))
2422, 23sylib 220 . . . . 5 (𝜑 ran 𝑆 ⊆ (Base‘𝐺))
2514, 15, 24mrcssidd 16890 . . . 4 (𝜑 ran 𝑆 ⊆ ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆))
2615mrccl 16876 . . . . . 6 (((SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)) ∧ ran 𝑆 ⊆ (Base‘𝐺)) → ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ∈ (SubGrp‘𝐺))
2714, 24, 26syl2anc 586 . . . . 5 (𝜑 → ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ∈ (SubGrp‘𝐺))
28 subgdprd.4 . . . . . . 7 (𝜑 → ran 𝑆 ⊆ 𝒫 𝐴)
29 sspwuni 5014 . . . . . . 7 (ran 𝑆 ⊆ 𝒫 𝐴 ran 𝑆𝐴)
3028, 29sylib 220 . . . . . 6 (𝜑 ran 𝑆𝐴)
3115mrcsscl 16885 . . . . . 6 (((SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)) ∧ ran 𝑆𝐴𝐴 ∈ (SubGrp‘𝐺)) → ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ⊆ 𝐴)
3214, 30, 1, 31syl3anc 1367 . . . . 5 (𝜑 → ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ⊆ 𝐴)
332subsubg 18296 . . . . . 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 711 . . . 4 (𝜑 → ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ∈ (SubGrp‘𝐻))
36 eqid 2821 . . . . 5 (mrCls‘(SubGrp‘𝐻)) = (mrCls‘(SubGrp‘𝐻))
3736mrcsscl 16885 . . . 4 (((SubGrp‘𝐻) ∈ (Moore‘(Base‘𝐻)) ∧ ran 𝑆 ⊆ ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ∧ ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ∈ (SubGrp‘𝐻)) → ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ⊆ ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆))
388, 25, 35, 37syl3anc 1367 . . 3 (𝜑 → ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ⊆ ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆))
392subgdmdprd 19150 . . . . . . . . . . 11 (𝐴 ∈ (SubGrp‘𝐺) → (𝐻dom DProd 𝑆 ↔ (𝐺dom DProd 𝑆 ∧ ran 𝑆 ⊆ 𝒫 𝐴)))
401, 39syl 17 . . . . . . . . . 10 (𝜑 → (𝐻dom DProd 𝑆 ↔ (𝐺dom DProd 𝑆 ∧ ran 𝑆 ⊆ 𝒫 𝐴)))
4116, 28, 40mpbir2and 711 . . . . . . . . 9 (𝜑𝐻dom DProd 𝑆)
42 eqidd 2822 . . . . . . . . 9 (𝜑 → dom 𝑆 = dom 𝑆)
4341, 42dprdf2 19123 . . . . . . . 8 (𝜑𝑆:dom 𝑆⟶(SubGrp‘𝐻))
4443frnd 6515 . . . . . . 7 (𝜑 → ran 𝑆 ⊆ (SubGrp‘𝐻))
45 mresspw 16857 . . . . . . . 8 ((SubGrp‘𝐻) ∈ (Moore‘(Base‘𝐻)) → (SubGrp‘𝐻) ⊆ 𝒫 (Base‘𝐻))
468, 45syl 17 . . . . . . 7 (𝜑 → (SubGrp‘𝐻) ⊆ 𝒫 (Base‘𝐻))
4744, 46sstrd 3976 . . . . . 6 (𝜑 → ran 𝑆 ⊆ 𝒫 (Base‘𝐻))
48 sspwuni 5014 . . . . . 6 (ran 𝑆 ⊆ 𝒫 (Base‘𝐻) ↔ ran 𝑆 ⊆ (Base‘𝐻))
4947, 48sylib 220 . . . . 5 (𝜑 ran 𝑆 ⊆ (Base‘𝐻))
508, 36, 49mrcssidd 16890 . . . 4 (𝜑 ran 𝑆 ⊆ ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆))
5136mrccl 16876 . . . . . . 7 (((SubGrp‘𝐻) ∈ (Moore‘(Base‘𝐻)) ∧ ran 𝑆 ⊆ (Base‘𝐻)) → ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ∈ (SubGrp‘𝐻))
528, 49, 51syl2anc 586 . . . . . 6 (𝜑 → ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ∈ (SubGrp‘𝐻))
532subsubg 18296 . . . . . . 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 234 . . . . 5 (𝜑 → (((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ∈ (SubGrp‘𝐺) ∧ ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ⊆ 𝐴))
5655simpld 497 . . . 4 (𝜑 → ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ∈ (SubGrp‘𝐺))
5715mrcsscl 16885 . . . 4 (((SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)) ∧ ran 𝑆 ⊆ ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ∧ ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ∈ (SubGrp‘𝐺)) → ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ⊆ ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆))
5814, 50, 56, 57syl3anc 1367 . . 3 (𝜑 → ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ⊆ ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆))
5938, 58eqssd 3983 . 2 (𝜑 → ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) = ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆))
6036dprdspan 19143 . . 3 (𝐻dom DProd 𝑆 → (𝐻 DProd 𝑆) = ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆))
6141, 60syl 17 . 2 (𝜑 → (𝐻 DProd 𝑆) = ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆))
6215dprdspan 19143 . . 3 (𝐺dom DProd 𝑆 → (𝐺 DProd 𝑆) = ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆))
6316, 62syl 17 . 2 (𝜑 → (𝐺 DProd 𝑆) = ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆))
6459, 61, 633eqtr4d 2866 1 (𝜑 → (𝐻 DProd 𝑆) = (𝐺 DProd 𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398   = wceq 1533  wcel 2110  wss 3935  𝒫 cpw 4538   cuni 4831   class class class wbr 5058  dom cdm 5549  ran crn 5550  wf 6345  cfv 6349  (class class class)co 7150  Basecbs 16477  s cress 16478  Moorecmre 16847  mrClscmrc 16848  ACScacs 16850  Grpcgrp 18097  SubGrpcsubg 18267   DProd cdprd 19109
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-rep 5182  ax-sep 5195  ax-nul 5202  ax-pow 5258  ax-pr 5321  ax-un 7455  ax-cnex 10587  ax-resscn 10588  ax-1cn 10589  ax-icn 10590  ax-addcl 10591  ax-addrcl 10592  ax-mulcl 10593  ax-mulrcl 10594  ax-mulcom 10595  ax-addass 10596  ax-mulass 10597  ax-distr 10598  ax-i2m1 10599  ax-1ne0 10600  ax-1rid 10601  ax-rnegex 10602  ax-rrecex 10603  ax-cnre 10604  ax-pre-lttri 10605  ax-pre-lttrn 10606  ax-pre-ltadd 10607  ax-pre-mulgt0 10608
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-pss 3953  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4561  df-pr 4563  df-tp 4565  df-op 4567  df-uni 4832  df-int 4869  df-iun 4913  df-iin 4914  df-br 5059  df-opab 5121  df-mpt 5139  df-tr 5165  df-id 5454  df-eprel 5459  df-po 5468  df-so 5469  df-fr 5508  df-se 5509  df-we 5510  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-rn 5560  df-res 5561  df-ima 5562  df-pred 6142  df-ord 6188  df-on 6189  df-lim 6190  df-suc 6191  df-iota 6308  df-fun 6351  df-fn 6352  df-f 6353  df-f1 6354  df-fo 6355  df-f1o 6356  df-fv 6357  df-isom 6358  df-riota 7108  df-ov 7153  df-oprab 7154  df-mpo 7155  df-of 7403  df-om 7575  df-1st 7683  df-2nd 7684  df-supp 7825  df-tpos 7886  df-wrecs 7941  df-recs 8002  df-rdg 8040  df-1o 8096  df-oadd 8100  df-er 8283  df-map 8402  df-ixp 8456  df-en 8504  df-dom 8505  df-sdom 8506  df-fin 8507  df-fsupp 8828  df-oi 8968  df-card 9362  df-pnf 10671  df-mnf 10672  df-xr 10673  df-ltxr 10674  df-le 10675  df-sub 10866  df-neg 10867  df-nn 11633  df-2 11694  df-n0 11892  df-z 11976  df-uz 12238  df-fz 12887  df-fzo 13028  df-seq 13364  df-hash 13685  df-ndx 16480  df-slot 16481  df-base 16483  df-sets 16484  df-ress 16485  df-plusg 16572  df-0g 16709  df-gsum 16710  df-mre 16851  df-mrc 16852  df-acs 16854  df-mgm 17846  df-sgrp 17895  df-mnd 17906  df-mhm 17950  df-submnd 17951  df-grp 18100  df-minusg 18101  df-sbg 18102  df-mulg 18219  df-subg 18270  df-ghm 18350  df-gim 18393  df-cntz 18441  df-oppg 18468  df-cmn 18902  df-dprd 19111
This theorem is referenced by:  ablfaclem3  19203
  Copyright terms: Public domain W3C validator