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

Theorem lsmsubg 19755
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 1154 . . . 4 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → 𝑇 ∈ (SubGrp‘𝐺))
2 subgsubm 19246 . . . 4 (𝑇 ∈ (SubGrp‘𝐺) → 𝑇 ∈ (SubMnd‘𝐺))
31, 2syl 18 . . 3 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → 𝑇 ∈ (SubMnd‘𝐺))
4 simp2 1155 . . . 4 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → 𝑈 ∈ (SubGrp‘𝐺))
5 subgsubm 19246 . . . 4 (𝑈 ∈ (SubGrp‘𝐺) → 𝑈 ∈ (SubMnd‘𝐺))
64, 5syl 18 . . 3 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → 𝑈 ∈ (SubMnd‘𝐺))
7 simp3 1156 . . 3 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → 𝑇 ⊆ (𝑍𝑈))
8 lsmsubg.p . . . 4 = (LSSum‘𝐺)
9 lsmsubg.z . . . 4 𝑍 = (Cntz‘𝐺)
108, 9lsmsubm 19754 . . 3 ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → (𝑇 𝑈) ∈ (SubMnd‘𝐺))
113, 6, 7, 10syl3anc 1398 . 2 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → (𝑇 𝑈) ∈ (SubMnd‘𝐺))
12 eqid 2766 . . . . . 6 (+g𝐺) = (+g𝐺)
1312, 8lsmelval 19750 . . . . 5 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → (𝑥 ∈ (𝑇 𝑈) ↔ ∃𝑎𝑇𝑏𝑈 𝑥 = (𝑎(+g𝐺)𝑏)))
14133adant3 1150 . . . 4 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → (𝑥 ∈ (𝑇 𝑈) ↔ ∃𝑎𝑇𝑏𝑈 𝑥 = (𝑎(+g𝐺)𝑏)))
151adantr 486 . . . . . . . . . 10 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → 𝑇 ∈ (SubGrp‘𝐺))
16 subgrcl 19228 . . . . . . . . . 10 (𝑇 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
1715, 16syl 18 . . . . . . . . 9 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → 𝐺 ∈ Grp)
18 eqid 2766 . . . . . . . . . . . 12 (Base‘𝐺) = (Base‘𝐺)
1918subgss 19224 . . . . . . . . . . 11 (𝑇 ∈ (SubGrp‘𝐺) → 𝑇 ⊆ (Base‘𝐺))
2015, 19syl 18 . . . . . . . . . 10 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → 𝑇 ⊆ (Base‘𝐺))
21 simprl 783 . . . . . . . . . 10 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → 𝑎𝑇)
2220, 21sseldd 3941 . . . . . . . . 9 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → 𝑎 ∈ (Base‘𝐺))
234adantr 486 . . . . . . . . . . 11 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → 𝑈 ∈ (SubGrp‘𝐺))
2418subgss 19224 . . . . . . . . . . 11 (𝑈 ∈ (SubGrp‘𝐺) → 𝑈 ⊆ (Base‘𝐺))
2523, 24syl 18 . . . . . . . . . 10 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → 𝑈 ⊆ (Base‘𝐺))
26 simprr 785 . . . . . . . . . 10 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → 𝑏𝑈)
2725, 26sseldd 3941 . . . . . . . . 9 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → 𝑏 ∈ (Base‘𝐺))
28 eqid 2766 . . . . . . . . . 10 (invg𝐺) = (invg𝐺)
2918, 12, 28grpinvadd 19115 . . . . . . . . 9 ((𝐺 ∈ Grp ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → ((invg𝐺)‘(𝑎(+g𝐺)𝑏)) = (((invg𝐺)‘𝑏)(+g𝐺)((invg𝐺)‘𝑎)))
3017, 22, 27, 29syl3anc 1398 . . . . . . . 8 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → ((invg𝐺)‘(𝑎(+g𝐺)𝑏)) = (((invg𝐺)‘𝑏)(+g𝐺)((invg𝐺)‘𝑎)))
317adantr 486 . . . . . . . . . 10 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → 𝑇 ⊆ (𝑍𝑈))
3228subginvcl 19232 . . . . . . . . . . 11 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑎𝑇) → ((invg𝐺)‘𝑎) ∈ 𝑇)
3315, 21, 32syl2anc 596 . . . . . . . . . 10 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → ((invg𝐺)‘𝑎) ∈ 𝑇)
3431, 33sseldd 3941 . . . . . . . . 9 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → ((invg𝐺)‘𝑎) ∈ (𝑍𝑈))
3528subginvcl 19232 . . . . . . . . . 10 ((𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑏𝑈) → ((invg𝐺)‘𝑏) ∈ 𝑈)
3623, 26, 35syl2anc 596 . . . . . . . . 9 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → ((invg𝐺)‘𝑏) ∈ 𝑈)
3712, 9cntzi 19430 . . . . . . . . 9 ((((invg𝐺)‘𝑎) ∈ (𝑍𝑈) ∧ ((invg𝐺)‘𝑏) ∈ 𝑈) → (((invg𝐺)‘𝑎)(+g𝐺)((invg𝐺)‘𝑏)) = (((invg𝐺)‘𝑏)(+g𝐺)((invg𝐺)‘𝑎)))
3834, 36, 37syl2anc 596 . . . . . . . 8 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → (((invg𝐺)‘𝑎)(+g𝐺)((invg𝐺)‘𝑏)) = (((invg𝐺)‘𝑏)(+g𝐺)((invg𝐺)‘𝑎)))
3930, 38eqtr4d 2804 . . . . . . 7 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → ((invg𝐺)‘(𝑎(+g𝐺)𝑏)) = (((invg𝐺)‘𝑎)(+g𝐺)((invg𝐺)‘𝑏)))
4012, 8lsmelvali 19751 . . . . . . . 8 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ (((invg𝐺)‘𝑎) ∈ 𝑇 ∧ ((invg𝐺)‘𝑏) ∈ 𝑈)) → (((invg𝐺)‘𝑎)(+g𝐺)((invg𝐺)‘𝑏)) ∈ (𝑇 𝑈))
4115, 23, 33, 36, 40syl22anc 852 . . . . . . 7 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → (((invg𝐺)‘𝑎)(+g𝐺)((invg𝐺)‘𝑏)) ∈ (𝑇 𝑈))
4239, 41eqeltrd 2866 . . . . . 6 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → ((invg𝐺)‘(𝑎(+g𝐺)𝑏)) ∈ (𝑇 𝑈))
43 fveq2 6888 . . . . . . 7 (𝑥 = (𝑎(+g𝐺)𝑏) → ((invg𝐺)‘𝑥) = ((invg𝐺)‘(𝑎(+g𝐺)𝑏)))
4443eleq1d 2851 . . . . . 6 (𝑥 = (𝑎(+g𝐺)𝑏) → (((invg𝐺)‘𝑥) ∈ (𝑇 𝑈) ↔ ((invg𝐺)‘(𝑎(+g𝐺)𝑏)) ∈ (𝑇 𝑈)))
4542, 44syl5ibrcom 250 . . . . 5 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → (𝑥 = (𝑎(+g𝐺)𝑏) → ((invg𝐺)‘𝑥) ∈ (𝑇 𝑈)))
4645rexlimdvva 3225 . . . 4 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → (∃𝑎𝑇𝑏𝑈 𝑥 = (𝑎(+g𝐺)𝑏) → ((invg𝐺)‘𝑥) ∈ (𝑇 𝑈)))
4714, 46sylbid 243 . . 3 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → (𝑥 ∈ (𝑇 𝑈) → ((invg𝐺)‘𝑥) ∈ (𝑇 𝑈)))
4847ralrimiv 3159 . 2 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → ∀𝑥 ∈ (𝑇 𝑈)((invg𝐺)‘𝑥) ∈ (𝑇 𝑈))
491, 16syl 18 . . 3 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → 𝐺 ∈ Grp)
5028issubg3 19242 . . 3 (𝐺 ∈ Grp → ((𝑇 𝑈) ∈ (SubGrp‘𝐺) ↔ ((𝑇 𝑈) ∈ (SubMnd‘𝐺) ∧ ∀𝑥 ∈ (𝑇 𝑈)((invg𝐺)‘𝑥) ∈ (𝑇 𝑈))))
5149, 50syl 18 . 2 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → ((𝑇 𝑈) ∈ (SubGrp‘𝐺) ↔ ((𝑇 𝑈) ∈ (SubMnd‘𝐺) ∧ ∀𝑥 ∈ (𝑇 𝑈)((invg𝐺)‘𝑥) ∈ (𝑇 𝑈))))
5211, 48, 51mpbir2and 726 1 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → (𝑇 𝑈) ∈ (SubGrp‘𝐺))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401  w3a 1103   = wceq 1570  wcel 2146  wral 3082  wrex 3092  wss 3908  cfv 6543  (class class class)co 7423  Basecbs 17294  +gcplusg 17335  SubMndcsubmnd 18871  Grpcgrp 19031  invgcminusg 19032  SubGrpcsubg 19217  Cntzccntz 19416  LSSumclsm 19735
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745  ax-cnex 11174  ax-resscn 11175  ax-1cn 11176  ax-icn 11177  ax-addcl 11178  ax-addrcl 11179  ax-mulcl 11180  ax-mulrcl 11181  ax-mulcom 11182  ax-addass 11183  ax-mulass 11184  ax-distr 11185  ax-i2m1 11186  ax-1ne0 11187  ax-1rid 11188  ax-rnegex 11189  ax-rrecex 11190  ax-cnre 11191  ax-pre-lttri 11192  ax-pre-lttrn 11193  ax-pre-ltadd 11194  ax-pre-mulgt0 11195
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-nel 3068  df-ral 3083  df-rex 3093  df-rmo 3372  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3928  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-tr 5224  df-id 5561  df-eprel 5566  df-po 5574  df-so 5575  df-fr 5619  df-we 5621  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-pred 6309  df-ord 6370  df-on 6371  df-lim 6372  df-suc 6373  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7380  df-ov 7426  df-oprab 7427  df-mpo 7428  df-om 7872  df-1st 7995  df-2nd 7996  df-frecs 8287  df-wrecs 8318  df-recs 8367  df-rdg 8406  df-er 8703  df-en 8953  df-dom 8954  df-sdom 8955  df-pnf 11263  df-mnf 11264  df-xr 11265  df-ltxr 11266  df-le 11267  df-sub 11461  df-neg 11462  df-nn 12252  df-2 12321  df-sets 17249  df-slot 17267  df-ndx 17279  df-base 17295  df-ress 17316  df-plusg 17348  df-0g 17519  df-mgm 18723  df-sgrp 18806  df-mnd 18822  df-submnd 18873  df-grp 19034  df-minusg 19035  df-subg 19220  df-cntz 19418  df-lsm 19737
This theorem is used by:  pj1ghm  19804  lsmsubg2  19960  dprd2da  20145  dmdprdsplit2lem  20148  dprdsplit  20151
  Copyright terms: Public domain W3C validator