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

Theorem lsmsubg 19677
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 1148 . . . 4 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → 𝑇 ∈ (SubGrp‘𝐺))
2 subgsubm 19173 . . . 4 (𝑇 ∈ (SubGrp‘𝐺) → 𝑇 ∈ (SubMnd‘𝐺))
31, 2syl 17 . . 3 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → 𝑇 ∈ (SubMnd‘𝐺))
4 simp2 1149 . . . 4 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → 𝑈 ∈ (SubGrp‘𝐺))
5 subgsubm 19173 . . . 4 (𝑈 ∈ (SubGrp‘𝐺) → 𝑈 ∈ (SubMnd‘𝐺))
64, 5syl 17 . . 3 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → 𝑈 ∈ (SubMnd‘𝐺))
7 simp3 1150 . . 3 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → 𝑇 ⊆ (𝑍𝑈))
8 lsmsubg.p . . . 4 = (LSSum‘𝐺)
9 lsmsubg.z . . . 4 𝑍 = (Cntz‘𝐺)
108, 9lsmsubm 19676 . . 3 ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → (𝑇 𝑈) ∈ (SubMnd‘𝐺))
113, 6, 7, 10syl3anc 1389 . 2 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → (𝑇 𝑈) ∈ (SubMnd‘𝐺))
12 eqid 2761 . . . . . 6 (+g𝐺) = (+g𝐺)
1312, 8lsmelval 19672 . . . . 5 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → (𝑥 ∈ (𝑇 𝑈) ↔ ∃𝑎𝑇𝑏𝑈 𝑥 = (𝑎(+g𝐺)𝑏)))
14133adant3 1144 . . . 4 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → (𝑥 ∈ (𝑇 𝑈) ↔ ∃𝑎𝑇𝑏𝑈 𝑥 = (𝑎(+g𝐺)𝑏)))
151adantr 484 . . . . . . . . . 10 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → 𝑇 ∈ (SubGrp‘𝐺))
16 subgrcl 19156 . . . . . . . . . 10 (𝑇 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
1715, 16syl 17 . . . . . . . . 9 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → 𝐺 ∈ Grp)
18 eqid 2761 . . . . . . . . . . . 12 (Base‘𝐺) = (Base‘𝐺)
1918subgss 19152 . . . . . . . . . . 11 (𝑇 ∈ (SubGrp‘𝐺) → 𝑇 ⊆ (Base‘𝐺))
2015, 19syl 17 . . . . . . . . . 10 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → 𝑇 ⊆ (Base‘𝐺))
21 simprl 780 . . . . . . . . . 10 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → 𝑎𝑇)
2220, 21sseldd 3937 . . . . . . . . 9 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → 𝑎 ∈ (Base‘𝐺))
234adantr 484 . . . . . . . . . . 11 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → 𝑈 ∈ (SubGrp‘𝐺))
2418subgss 19152 . . . . . . . . . . 11 (𝑈 ∈ (SubGrp‘𝐺) → 𝑈 ⊆ (Base‘𝐺))
2523, 24syl 17 . . . . . . . . . 10 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → 𝑈 ⊆ (Base‘𝐺))
26 simprr 782 . . . . . . . . . 10 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → 𝑏𝑈)
2725, 26sseldd 3937 . . . . . . . . 9 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → 𝑏 ∈ (Base‘𝐺))
28 eqid 2761 . . . . . . . . . 10 (invg𝐺) = (invg𝐺)
2918, 12, 28grpinvadd 19043 . . . . . . . . 9 ((𝐺 ∈ Grp ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → ((invg𝐺)‘(𝑎(+g𝐺)𝑏)) = (((invg𝐺)‘𝑏)(+g𝐺)((invg𝐺)‘𝑎)))
3017, 22, 27, 29syl3anc 1389 . . . . . . . 8 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → ((invg𝐺)‘(𝑎(+g𝐺)𝑏)) = (((invg𝐺)‘𝑏)(+g𝐺)((invg𝐺)‘𝑎)))
317adantr 484 . . . . . . . . . 10 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → 𝑇 ⊆ (𝑍𝑈))
3228subginvcl 19160 . . . . . . . . . . 11 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑎𝑇) → ((invg𝐺)‘𝑎) ∈ 𝑇)
3315, 21, 32syl2anc 593 . . . . . . . . . 10 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → ((invg𝐺)‘𝑎) ∈ 𝑇)
3431, 33sseldd 3937 . . . . . . . . 9 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → ((invg𝐺)‘𝑎) ∈ (𝑍𝑈))
3528subginvcl 19160 . . . . . . . . . 10 ((𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑏𝑈) → ((invg𝐺)‘𝑏) ∈ 𝑈)
3623, 26, 35syl2anc 593 . . . . . . . . 9 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → ((invg𝐺)‘𝑏) ∈ 𝑈)
3712, 9cntzi 19352 . . . . . . . . 9 ((((invg𝐺)‘𝑎) ∈ (𝑍𝑈) ∧ ((invg𝐺)‘𝑏) ∈ 𝑈) → (((invg𝐺)‘𝑎)(+g𝐺)((invg𝐺)‘𝑏)) = (((invg𝐺)‘𝑏)(+g𝐺)((invg𝐺)‘𝑎)))
3834, 36, 37syl2anc 593 . . . . . . . 8 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → (((invg𝐺)‘𝑎)(+g𝐺)((invg𝐺)‘𝑏)) = (((invg𝐺)‘𝑏)(+g𝐺)((invg𝐺)‘𝑎)))
3930, 38eqtr4d 2799 . . . . . . 7 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → ((invg𝐺)‘(𝑎(+g𝐺)𝑏)) = (((invg𝐺)‘𝑎)(+g𝐺)((invg𝐺)‘𝑏)))
4012, 8lsmelvali 19673 . . . . . . . 8 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ (((invg𝐺)‘𝑎) ∈ 𝑇 ∧ ((invg𝐺)‘𝑏) ∈ 𝑈)) → (((invg𝐺)‘𝑎)(+g𝐺)((invg𝐺)‘𝑏)) ∈ (𝑇 𝑈))
4115, 23, 33, 36, 40syl22anc 849 . . . . . . 7 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → (((invg𝐺)‘𝑎)(+g𝐺)((invg𝐺)‘𝑏)) ∈ (𝑇 𝑈))
4239, 41eqeltrd 2861 . . . . . 6 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → ((invg𝐺)‘(𝑎(+g𝐺)𝑏)) ∈ (𝑇 𝑈))
43 fveq2 6863 . . . . . . 7 (𝑥 = (𝑎(+g𝐺)𝑏) → ((invg𝐺)‘𝑥) = ((invg𝐺)‘(𝑎(+g𝐺)𝑏)))
4443eleq1d 2846 . . . . . 6 (𝑥 = (𝑎(+g𝐺)𝑏) → (((invg𝐺)‘𝑥) ∈ (𝑇 𝑈) ↔ ((invg𝐺)‘(𝑎(+g𝐺)𝑏)) ∈ (𝑇 𝑈)))
4542, 44syl5ibrcom 249 . . . . 5 (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) ∧ (𝑎𝑇𝑏𝑈)) → (𝑥 = (𝑎(+g𝐺)𝑏) → ((invg𝐺)‘𝑥) ∈ (𝑇 𝑈)))
4645rexlimdvva 3218 . . . 4 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → (∃𝑎𝑇𝑏𝑈 𝑥 = (𝑎(+g𝐺)𝑏) → ((invg𝐺)‘𝑥) ∈ (𝑇 𝑈)))
4714, 46sylbid 242 . . 3 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → (𝑥 ∈ (𝑇 𝑈) → ((invg𝐺)‘𝑥) ∈ (𝑇 𝑈)))
4847ralrimiv 3152 . 2 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → ∀𝑥 ∈ (𝑇 𝑈)((invg𝐺)‘𝑥) ∈ (𝑇 𝑈))
491, 16syl 17 . . 3 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → 𝐺 ∈ Grp)
5028issubg3 19169 . . 3 (𝐺 ∈ Grp → ((𝑇 𝑈) ∈ (SubGrp‘𝐺) ↔ ((𝑇 𝑈) ∈ (SubMnd‘𝐺) ∧ ∀𝑥 ∈ (𝑇 𝑈)((invg𝐺)‘𝑥) ∈ (𝑇 𝑈))))
5149, 50syl 17 . 2 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → ((𝑇 𝑈) ∈ (SubGrp‘𝐺) ↔ ((𝑇 𝑈) ∈ (SubMnd‘𝐺) ∧ ∀𝑥 ∈ (𝑇 𝑈)((invg𝐺)‘𝑥) ∈ (𝑇 𝑈))))
5211, 48, 51mpbir2and 723 1 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → (𝑇 𝑈) ∈ (SubGrp‘𝐺))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399  w3a 1097   = wceq 1559  wcel 2141  wral 3075  wrex 3085  wss 3904  cfv 6517  (class class class)co 7392  Basecbs 17228  +gcplusg 17269  SubMndcsubmnd 18799  Grpcgrp 18958  invgcminusg 18959  SubGrpcsubg 19145  Cntzccntz 19338  LSSumclsm 19657
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pow 5321  ax-pr 5389  ax-un 7714  ax-cnex 11126  ax-resscn 11127  ax-1cn 11128  ax-icn 11129  ax-addcl 11130  ax-addrcl 11131  ax-mulcl 11132  ax-mulrcl 11133  ax-mulcom 11134  ax-addass 11135  ax-mulass 11136  ax-distr 11137  ax-i2m1 11138  ax-1ne0 11139  ax-1rid 11140  ax-rnegex 11141  ax-rrecex 11142  ax-cnre 11143  ax-pre-lttri 11144  ax-pre-lttrn 11145  ax-pre-ltadd 11146  ax-pre-mulgt0 11147
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3061  df-ral 3076  df-rex 3086  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-iun 4950  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5540  df-eprel 5545  df-po 5553  df-so 5554  df-fr 5598  df-we 5600  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-res 5657  df-ima 5658  df-pred 6284  df-ord 6345  df-on 6346  df-lim 6347  df-suc 6348  df-iota 6473  df-fun 6519  df-fn 6520  df-f 6521  df-f1 6522  df-fo 6523  df-f1o 6524  df-fv 6525  df-riota 7349  df-ov 7395  df-oprab 7396  df-mpo 7397  df-om 7843  df-1st 7966  df-2nd 7967  df-frecs 8257  df-wrecs 8288  df-recs 8337  df-rdg 8376  df-er 8673  df-en 8924  df-dom 8925  df-sdom 8926  df-pnf 11215  df-mnf 11216  df-xr 11217  df-ltxr 11218  df-le 11219  df-sub 11413  df-neg 11414  df-nn 12208  df-2 12277  df-sets 17183  df-slot 17201  df-ndx 17213  df-base 17229  df-ress 17250  df-plusg 17282  df-0g 17453  df-mgm 18657  df-sgrp 18736  df-mnd 18752  df-submnd 18801  df-grp 18961  df-minusg 18962  df-subg 19148  df-cntz 19340  df-lsm 19659
This theorem is referenced by:  pj1ghm  19726  lsmsubg2  19882  dprd2da  20067  dmdprdsplit2lem  20070  dprdsplit  20073
  Copyright terms: Public domain W3C validator