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

Theorem subgdprd 19149
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 18274 . . . . . 6 (𝐴 ∈ (SubGrp‘𝐺) → 𝐻 ∈ Grp)
41, 3syl 17 . . . . 5 (𝜑𝐻 ∈ Grp)
5 eqid 2819 . . . . . 6 (Base‘𝐻) = (Base‘𝐻)
65subgacs 18305 . . . . 5 (𝐻 ∈ Grp → (SubGrp‘𝐻) ∈ (ACS‘(Base‘𝐻)))
7 acsmre 16915 . . . . 5 ((SubGrp‘𝐻) ∈ (ACS‘(Base‘𝐻)) → (SubGrp‘𝐻) ∈ (Moore‘(Base‘𝐻)))
84, 6, 73syl 18 . . . 4 (𝜑 → (SubGrp‘𝐻) ∈ (Moore‘(Base‘𝐻)))
9 subgrcl 18276 . . . . . . 7 (𝐴 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
101, 9syl 17 . . . . . 6 (𝜑𝐺 ∈ Grp)
11 eqid 2819 . . . . . . 7 (Base‘𝐺) = (Base‘𝐺)
1211subgacs 18305 . . . . . 6 (𝐺 ∈ Grp → (SubGrp‘𝐺) ∈ (ACS‘(Base‘𝐺)))
13 acsmre 16915 . . . . . 6 ((SubGrp‘𝐺) ∈ (ACS‘(Base‘𝐺)) → (SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)))
1410, 12, 133syl 18 . . . . 5 (𝜑 → (SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)))
15 eqid 2819 . . . . 5 (mrCls‘(SubGrp‘𝐺)) = (mrCls‘(SubGrp‘𝐺))
16 subgdprd.3 . . . . . . . 8 (𝜑𝐺dom DProd 𝑆)
17 dprdf 19120 . . . . . . . 8 (𝐺dom DProd 𝑆𝑆:dom 𝑆⟶(SubGrp‘𝐺))
18 frn 6513 . . . . . . . 8 (𝑆:dom 𝑆⟶(SubGrp‘𝐺) → ran 𝑆 ⊆ (SubGrp‘𝐺))
1916, 17, 183syl 18 . . . . . . 7 (𝜑 → ran 𝑆 ⊆ (SubGrp‘𝐺))
20 mresspw 16855 . . . . . . . 8 ((SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)) → (SubGrp‘𝐺) ⊆ 𝒫 (Base‘𝐺))
2114, 20syl 17 . . . . . . 7 (𝜑 → (SubGrp‘𝐺) ⊆ 𝒫 (Base‘𝐺))
2219, 21sstrd 3975 . . . . . 6 (𝜑 → ran 𝑆 ⊆ 𝒫 (Base‘𝐺))
23 sspwuni 5013 . . . . . 6 (ran 𝑆 ⊆ 𝒫 (Base‘𝐺) ↔ ran 𝑆 ⊆ (Base‘𝐺))
2422, 23sylib 220 . . . . 5 (𝜑 ran 𝑆 ⊆ (Base‘𝐺))
2514, 15, 24mrcssidd 16888 . . . 4 (𝜑 ran 𝑆 ⊆ ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆))
2615mrccl 16874 . . . . . 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 5013 . . . . . . 7 (ran 𝑆 ⊆ 𝒫 𝐴 ran 𝑆𝐴)
3028, 29sylib 220 . . . . . 6 (𝜑 ran 𝑆𝐴)
3115mrcsscl 16883 . . . . . 6 (((SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)) ∧ ran 𝑆𝐴𝐴 ∈ (SubGrp‘𝐺)) → ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ⊆ 𝐴)
3214, 30, 1, 31syl3anc 1366 . . . . 5 (𝜑 → ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ⊆ 𝐴)
332subsubg 18294 . . . . . 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 2819 . . . . 5 (mrCls‘(SubGrp‘𝐻)) = (mrCls‘(SubGrp‘𝐻))
3736mrcsscl 16883 . . . 4 (((SubGrp‘𝐻) ∈ (Moore‘(Base‘𝐻)) ∧ ran 𝑆 ⊆ ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ∧ ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ∈ (SubGrp‘𝐻)) → ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ⊆ ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆))
388, 25, 35, 37syl3anc 1366 . . 3 (𝜑 → ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ⊆ ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆))
392subgdmdprd 19148 . . . . . . . . . . 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 2820 . . . . . . . . 9 (𝜑 → dom 𝑆 = dom 𝑆)
4341, 42dprdf2 19121 . . . . . . . 8 (𝜑𝑆:dom 𝑆⟶(SubGrp‘𝐻))
4443frnd 6514 . . . . . . 7 (𝜑 → ran 𝑆 ⊆ (SubGrp‘𝐻))
45 mresspw 16855 . . . . . . . 8 ((SubGrp‘𝐻) ∈ (Moore‘(Base‘𝐻)) → (SubGrp‘𝐻) ⊆ 𝒫 (Base‘𝐻))
468, 45syl 17 . . . . . . 7 (𝜑 → (SubGrp‘𝐻) ⊆ 𝒫 (Base‘𝐻))
4744, 46sstrd 3975 . . . . . 6 (𝜑 → ran 𝑆 ⊆ 𝒫 (Base‘𝐻))
48 sspwuni 5013 . . . . . 6 (ran 𝑆 ⊆ 𝒫 (Base‘𝐻) ↔ ran 𝑆 ⊆ (Base‘𝐻))
4947, 48sylib 220 . . . . 5 (𝜑 ran 𝑆 ⊆ (Base‘𝐻))
508, 36, 49mrcssidd 16888 . . . 4 (𝜑 ran 𝑆 ⊆ ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆))
5136mrccl 16874 . . . . . . 7 (((SubGrp‘𝐻) ∈ (Moore‘(Base‘𝐻)) ∧ ran 𝑆 ⊆ (Base‘𝐻)) → ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ∈ (SubGrp‘𝐻))
528, 49, 51syl2anc 586 . . . . . 6 (𝜑 → ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ∈ (SubGrp‘𝐻))
532subsubg 18294 . . . . . . 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 16883 . . . 4 (((SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)) ∧ ran 𝑆 ⊆ ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ∧ ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) ∈ (SubGrp‘𝐺)) → ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ⊆ ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆))
5814, 50, 56, 57syl3anc 1366 . . 3 (𝜑 → ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆) ⊆ ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆))
5938, 58eqssd 3982 . 2 (𝜑 → ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆) = ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆))
6036dprdspan 19141 . . 3 (𝐻dom DProd 𝑆 → (𝐻 DProd 𝑆) = ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆))
6141, 60syl 17 . 2 (𝜑 → (𝐻 DProd 𝑆) = ((mrCls‘(SubGrp‘𝐻))‘ ran 𝑆))
6215dprdspan 19141 . . 3 (𝐺dom DProd 𝑆 → (𝐺 DProd 𝑆) = ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆))
6316, 62syl 17 . 2 (𝜑 → (𝐺 DProd 𝑆) = ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆))
6459, 61, 633eqtr4d 2864 1 (𝜑 → (𝐻 DProd 𝑆) = (𝐺 DProd 𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398   = wceq 1531  wcel 2108  wss 3934  𝒫 cpw 4537   cuni 4830   class class class wbr 5057  dom cdm 5548  ran crn 5549  wf 6344  cfv 6348  (class class class)co 7148  Basecbs 16475  s cress 16476  Moorecmre 16845  mrClscmrc 16846  ACScacs 16848  Grpcgrp 18095  SubGrpcsubg 18265   DProd cdprd 19107
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1905  ax-6 1964  ax-7 2009  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2154  ax-12 2170  ax-ext 2791  ax-rep 5181  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320  ax-un 7453  ax-cnex 10585  ax-resscn 10586  ax-1cn 10587  ax-icn 10588  ax-addcl 10589  ax-addrcl 10590  ax-mulcl 10591  ax-mulrcl 10592  ax-mulcom 10593  ax-addass 10594  ax-mulass 10595  ax-distr 10596  ax-i2m1 10597  ax-1ne0 10598  ax-1rid 10599  ax-rnegex 10600  ax-rrecex 10601  ax-cnre 10602  ax-pre-lttri 10603  ax-pre-lttrn 10604  ax-pre-ltadd 10605  ax-pre-mulgt0 10606
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1083  df-3an 1084  df-tru 1534  df-ex 1775  df-nf 1779  df-sb 2064  df-mo 2616  df-eu 2648  df-clab 2798  df-cleq 2812  df-clel 2891  df-nfc 2961  df-ne 3015  df-nel 3122  df-ral 3141  df-rex 3142  df-reu 3143  df-rmo 3144  df-rab 3145  df-v 3495  df-sbc 3771  df-csb 3882  df-dif 3937  df-un 3939  df-in 3941  df-ss 3950  df-pss 3952  df-nul 4290  df-if 4466  df-pw 4539  df-sn 4560  df-pr 4562  df-tp 4564  df-op 4566  df-uni 4831  df-int 4868  df-iun 4912  df-iin 4913  df-br 5058  df-opab 5120  df-mpt 5138  df-tr 5164  df-id 5453  df-eprel 5458  df-po 5467  df-so 5468  df-fr 5507  df-se 5508  df-we 5509  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-pred 6141  df-ord 6187  df-on 6188  df-lim 6189  df-suc 6190  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-f1 6353  df-fo 6354  df-f1o 6355  df-fv 6356  df-isom 6357  df-riota 7106  df-ov 7151  df-oprab 7152  df-mpo 7153  df-of 7401  df-om 7573  df-1st 7681  df-2nd 7682  df-supp 7823  df-tpos 7884  df-wrecs 7939  df-recs 8000  df-rdg 8038  df-1o 8094  df-oadd 8098  df-er 8281  df-map 8400  df-ixp 8454  df-en 8502  df-dom 8503  df-sdom 8504  df-fin 8505  df-fsupp 8826  df-oi 8966  df-card 9360  df-pnf 10669  df-mnf 10670  df-xr 10671  df-ltxr 10672  df-le 10673  df-sub 10864  df-neg 10865  df-nn 11631  df-2 11692  df-n0 11890  df-z 11974  df-uz 12236  df-fz 12885  df-fzo 13026  df-seq 13362  df-hash 13683  df-ndx 16478  df-slot 16479  df-base 16481  df-sets 16482  df-ress 16483  df-plusg 16570  df-0g 16707  df-gsum 16708  df-mre 16849  df-mrc 16850  df-acs 16852  df-mgm 17844  df-sgrp 17893  df-mnd 17904  df-mhm 17948  df-submnd 17949  df-grp 18098  df-minusg 18099  df-sbg 18100  df-mulg 18217  df-subg 18268  df-ghm 18348  df-gim 18391  df-cntz 18439  df-oppg 18466  df-cmn 18900  df-dprd 19109
This theorem is referenced by:  ablfaclem3  19201
  Copyright terms: Public domain W3C validator