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

Theorem lsmsubg 19712
Description: The sum of two commuting subgroups is a subgroup. (Contributed by Mario Carneiro, 19-Apr-2016.)
Hypotheses
Ref Expression
lsmsubg.p = (LSSum‘𝐺)
lsmsubg.z 𝑍 = (Cntz‘𝐺)
Assertion
Ref Expression
lsmsubg ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → (𝑇 𝑈) ∈ (SubGrp‘𝐺))

Proof of Theorem lsmsubg
Dummy variables 𝑎 𝑏 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simp1 1152 . . . 4 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → 𝑇 ∈ (SubGrp‘𝐺))
2 subgsubm 19203 . . . 4 (𝑇 ∈ (SubGrp‘𝐺) → 𝑇 ∈ (SubMnd‘𝐺))
31, 2syl 18 . . 3 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → 𝑇 ∈ (SubMnd‘𝐺))
4 simp2 1153 . . . 4 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → 𝑈 ∈ (SubGrp‘𝐺))
5 subgsubm 19203 . . . 4 (𝑈 ∈ (SubGrp‘𝐺) → 𝑈 ∈ (SubMnd‘𝐺))
64, 5syl 18 . . 3 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → 𝑈 ∈ (SubMnd‘𝐺))
7 simp3 1154 . . 3 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → 𝑇 ⊆ (𝑍𝑈))
8 lsmsubg.p . . . 4 = (LSSum‘𝐺)
9 lsmsubg.z . . . 4 𝑍 = (Cntz‘𝐺)
108, 9lsmsubm 19711 . . 3 ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → (𝑇 𝑈) ∈ (SubMnd‘𝐺))
113, 6, 7, 10syl3anc 1394 . 2 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → (𝑇 𝑈) ∈ (SubMnd‘𝐺))
12 eqid 2765 . . . . . 6 (+g𝐺) = (+g𝐺)
1312, 8lsmelval 19707 . . . . 5 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → (𝑥 ∈ (𝑇 𝑈) ↔ ∃𝑎𝑇𝑏𝑈 𝑥 = (𝑎(+g𝐺)𝑏)))
14133adant3 1148 . . . 4 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → (𝑥 ∈ (𝑇 𝑈) ↔ ∃𝑎𝑇𝑏𝑈 𝑥 = (𝑎(+g𝐺)𝑏)))
151adantr 485 . . . . . . . . . 10 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → 𝑇 ∈ (SubGrp‘𝐺))
16 subgrcl 19185 . . . . . . . . . 10 (𝑇 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
1715, 16syl 18 . . . . . . . . 9 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → 𝐺 ∈ Grp)
18 eqid 2765 . . . . . . . . . . . 12 (Base‘𝐺) = (Base‘𝐺)
1918subgss 19181 . . . . . . . . . . 11 (𝑇 ∈ (SubGrp‘𝐺) → 𝑇 ⊆ (Base‘𝐺))
2015, 19syl 18 . . . . . . . . . 10 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → 𝑇 ⊆ (Base‘𝐺))
21 simprl 782 . . . . . . . . . 10 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → 𝑎𝑇)
2220, 21sseldd 3940 . . . . . . . . 9 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → 𝑎 ∈ (Base‘𝐺))
234adantr 485 . . . . . . . . . . 11 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → 𝑈 ∈ (SubGrp‘𝐺))
2418subgss 19181 . . . . . . . . . . 11 (𝑈 ∈ (SubGrp‘𝐺) → 𝑈 ⊆ (Base‘𝐺))
2523, 24syl 18 . . . . . . . . . 10 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → 𝑈 ⊆ (Base‘𝐺))
26 simprr 784 . . . . . . . . . 10 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → 𝑏𝑈)
2725, 26sseldd 3940 . . . . . . . . 9 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → 𝑏 ∈ (Base‘𝐺))
28 eqid 2765 . . . . . . . . . 10 (invg𝐺) = (invg𝐺)
2918, 12, 28grpinvadd 19072 . . . . . . . . 9 ((𝐺 ∈ Grp ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → ((invg𝐺)‘(𝑎(+g𝐺)𝑏)) = (((invg𝐺)‘𝑏)(+g𝐺)((invg𝐺)‘𝑎)))
3017, 22, 27, 29syl3anc 1394 . . . . . . . 8 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → ((invg𝐺)‘(𝑎(+g𝐺)𝑏)) = (((invg𝐺)‘𝑏)(+g𝐺)((invg𝐺)‘𝑎)))
317adantr 485 . . . . . . . . . 10 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → 𝑇 ⊆ (𝑍𝑈))
3228subginvcl 19189 . . . . . . . . . . 11 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑎𝑇) → ((invg𝐺)‘𝑎) ∈ 𝑇)
3315, 21, 32syl2anc 595 . . . . . . . . . 10 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → ((invg𝐺)‘𝑎) ∈ 𝑇)
3431, 33sseldd 3940 . . . . . . . . 9 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → ((invg𝐺)‘𝑎) ∈ (𝑍𝑈))
3528subginvcl 19189 . . . . . . . . . 10 ((𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑏𝑈) → ((invg𝐺)‘𝑏) ∈ 𝑈)
3623, 26, 35syl2anc 595 . . . . . . . . 9 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → ((invg𝐺)‘𝑏) ∈ 𝑈)
3712, 9cntzi 19387 . . . . . . . . 9 ((((invg𝐺)‘𝑎) ∈ (𝑍𝑈) ∧ ((invg𝐺)‘𝑏) ∈ 𝑈) → (((invg𝐺)‘𝑎)(+g𝐺)((invg𝐺)‘𝑏)) = (((invg𝐺)‘𝑏)(+g𝐺)((invg𝐺)‘𝑎)))
3834, 36, 37syl2anc 595 . . . . . . . 8 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → (((invg𝐺)‘𝑎)(+g𝐺)((invg𝐺)‘𝑏)) = (((invg𝐺)‘𝑏)(+g𝐺)((invg𝐺)‘𝑎)))
3930, 38eqtr4d 2803 . . . . . . 7 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → ((invg𝐺)‘(𝑎(+g𝐺)𝑏)) = (((invg𝐺)‘𝑎)(+g𝐺)((invg𝐺)‘𝑏)))
4012, 8lsmelvali 19708 . . . . . . . 8 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ (((invg𝐺)‘𝑎) ∈ 𝑇 ∧ ((invg𝐺)‘𝑏) ∈ 𝑈)) → (((invg𝐺)‘𝑎)(+g𝐺)((invg𝐺)‘𝑏)) ∈ (𝑇 𝑈))
4115, 23, 33, 36, 40syl22anc 851 . . . . . . 7 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → (((invg𝐺)‘𝑎)(+g𝐺)((invg𝐺)‘𝑏)) ∈ (𝑇 𝑈))
4239, 41eqeltrd 2865 . . . . . 6 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → ((invg𝐺)‘(𝑎(+g𝐺)𝑏)) ∈ (𝑇 𝑈))
43 fveq2 6871 . . . . . . 7 (𝑥 = (𝑎(+g𝐺)𝑏) → ((invg𝐺)‘𝑥) = ((invg𝐺)‘(𝑎(+g𝐺)𝑏)))
4443eleq1d 2850 . . . . . 6 (𝑥 = (𝑎(+g𝐺)𝑏) → (((invg𝐺)‘𝑥) ∈ (𝑇 𝑈) ↔ ((invg𝐺)‘(𝑎(+g𝐺)𝑏)) ∈ (𝑇 𝑈)))
4542, 44syl5ibrcom 250 . . . . 5 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → (𝑥 = (𝑎(+g𝐺)𝑏) → ((invg𝐺)‘𝑥) ∈ (𝑇 𝑈)))
4645rexlimdvva 3222 . . . 4 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → (∃𝑎𝑇𝑏𝑈 𝑥 = (𝑎(+g𝐺)𝑏) → ((invg𝐺)‘𝑥) ∈ (𝑇 𝑈)))
4714, 46sylbid 243 . . 3 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → (𝑥 ∈ (𝑇 𝑈) → ((invg𝐺)‘𝑥) ∈ (𝑇 𝑈)))
4847ralrimiv 3156 . 2 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → ∀𝑥 ∈ (𝑇 𝑈)((invg𝐺)‘𝑥) ∈ (𝑇 𝑈))
491, 16syl 18 . . 3 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → 𝐺 ∈ Grp)
5028issubg3 19199 . . 3 (𝐺 ∈ Grp → ((𝑇 𝑈) ∈ (SubGrp‘𝐺) ↔ ((𝑇 𝑈) ∈ (SubMnd‘𝐺) ∧ ∀𝑥 ∈ (𝑇 𝑈)((invg𝐺)‘𝑥) ∈ (𝑇 𝑈))))
5149, 50syl 18 . 2 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → ((𝑇 𝑈) ∈ (SubGrp‘𝐺) ↔ ((𝑇 𝑈) ∈ (SubMnd‘𝐺) ∧ ∀𝑥 ∈ (𝑇 𝑈)((invg𝐺)‘𝑥) ∈ (𝑇 𝑈))))
5211, 48, 51mpbir2and 725 1 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → (𝑇 𝑈) ∈ (SubGrp‘𝐺))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  w3a 1101   = wceq 1563  wcel 2145  wral 3079  wrex 3089  wss 3907  cfv 6525  (class class class)co 7400  Basecbs 17257  +gcplusg 17298  SubMndcsubmnd 18828  Grpcgrp 18988  invgcminusg 18989  SubGrpcsubg 19174  Cntzccntz 19373  LSSumclsm 19692
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-rep 5231  ax-sep 5250  ax-nul 5260  ax-pow 5326  ax-pr 5394  ax-un 7722  ax-cnex 11144  ax-resscn 11145  ax-1cn 11146  ax-icn 11147  ax-addcl 11148  ax-addrcl 11149  ax-mulcl 11150  ax-mulrcl 11151  ax-mulcom 11152  ax-addass 11153  ax-mulass 11154  ax-distr 11155  ax-i2m1 11156  ax-1ne0 11157  ax-1rid 11158  ax-rnegex 11159  ax-rrecex 11160  ax-cnre 11161  ax-pre-lttri 11162  ax-pre-lttrn 11163  ax-pre-ltadd 11164  ax-pre-mulgt0 11165
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3065  df-ral 3080  df-rex 3090  df-rmo 3370  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-pss 3927  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-iun 4953  df-br 5105  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6291  df-ord 6352  df-on 6353  df-lim 6354  df-suc 6355  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-riota 7357  df-ov 7403  df-oprab 7404  df-mpo 7405  df-om 7851  df-1st 7974  df-2nd 7975  df-frecs 8266  df-wrecs 8297  df-recs 8346  df-rdg 8385  df-er 8682  df-en 8932  df-dom 8933  df-sdom 8934  df-pnf 11233  df-mnf 11234  df-xr 11235  df-ltxr 11236  df-le 11237  df-sub 11431  df-neg 11432  df-nn 12222  df-2 12291  df-sets 17212  df-slot 17230  df-ndx 17242  df-base 17258  df-ress 17279  df-plusg 17311  df-0g 17482  df-mgm 18686  df-sgrp 18765  df-mnd 18781  df-submnd 18830  df-grp 18991  df-minusg 18992  df-subg 19177  df-cntz 19375  df-lsm 19694
This theorem is referenced by:  pj1ghm  19761  lsmsubg2  19917  dprd2da  20102  dmdprdsplit2lem  20105  dprdsplit  20108
  Copyright terms: Public domain W3C validator