Theorem lsmsubg 19901

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.

Step	Hyp	Ref	Expression
1		simp1 1154	. . . 4 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → 𝑇 ∈ (SubGrp‘𝐺))
2		subgsubm 19391	. . . 4 ⊢ (𝑇 ∈ (SubGrp‘𝐺) → 𝑇 ∈ (SubMnd‘𝐺))
3	1, 2	syl 18	. . 3 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → 𝑇 ∈ (SubMnd‘𝐺))
4		simp2 1155	. . . 4 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → 𝑈 ∈ (SubGrp‘𝐺))
5		subgsubm 19391	. . . 4 ⊢ (𝑈 ∈ (SubGrp‘𝐺) → 𝑈 ∈ (SubMnd‘𝐺))
6	4, 5	syl 18	. . 3 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → 𝑈 ∈ (SubMnd‘𝐺))
7		simp3 1156	. . 3 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → 𝑇 ⊆ (𝑍‘𝑈))
8		lsmsubg.p	. . . 4 ⊢ ⊕ = (LSSum‘𝐺)
9		lsmsubg.z	. . . 4 ⊢ 𝑍 = (Cntz‘𝐺)
10	8, 9	lsmsubm 19900	. . 3 ⊢ ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → (𝑇 ⊕ 𝑈) ∈ (SubMnd‘𝐺))
11	3, 6, 7, 10	syl3anc 1399	. 2 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → (𝑇 ⊕ 𝑈) ∈ (SubMnd‘𝐺))
12		eqid 2763	. . . . . 6 ⊢ (+g‘𝐺) = (+g‘𝐺)
13	12, 8	lsmelval 19896	. . . . 5 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → (𝑥 ∈ (𝑇 ⊕ 𝑈) ↔ ∃𝑎 ∈ 𝑇 ∃𝑏 ∈ 𝑈 𝑥 = (𝑎(+g‘𝐺)𝑏)))
14	13	3adant3 1150	. . . 4 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → (𝑥 ∈ (𝑇 ⊕ 𝑈) ↔ ∃𝑎 ∈ 𝑇 ∃𝑏 ∈ 𝑈 𝑥 = (𝑎(+g‘𝐺)𝑏)))
15	1	adantr 486	. . . . . . . . . 10 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → 𝑇 ∈ (SubGrp‘𝐺))
16		subgrcl 19373	. . . . . . . . . 10 ⊢ (𝑇 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
17	15, 16	syl 18	. . . . . . . . 9 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → 𝐺 ∈ Grp)
18		eqid 2763	. . . . . . . . . . . 12 ⊢ (Base‘𝐺) = (Base‘𝐺)
19	18	subgss 19369	. . . . . . . . . . 11 ⊢ (𝑇 ∈ (SubGrp‘𝐺) → 𝑇 ⊆ (Base‘𝐺))
20	15, 19	syl 18	. . . . . . . . . 10 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → 𝑇 ⊆ (Base‘𝐺))
21		simprl 783	. . . . . . . . . 10 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → 𝑎 ∈ 𝑇)
22	20, 21	sseldd 3914	. . . . . . . . 9 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → 𝑎 ∈ (Base‘𝐺))
23	4	adantr 486	. . . . . . . . . . 11 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → 𝑈 ∈ (SubGrp‘𝐺))
24	18	subgss 19369	. . . . . . . . . . 11 ⊢ (𝑈 ∈ (SubGrp‘𝐺) → 𝑈 ⊆ (Base‘𝐺))
25	23, 24	syl 18	. . . . . . . . . 10 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → 𝑈 ⊆ (Base‘𝐺))
26		simprr 785	. . . . . . . . . 10 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → 𝑏 ∈ 𝑈)
27	25, 26	sseldd 3914	. . . . . . . . 9 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → 𝑏 ∈ (Base‘𝐺))
28		eqid 2763	. . . . . . . . . 10 ⊢ (invg‘𝐺) = (invg‘𝐺)
29	18, 12, 28	grpinvadd 19260	. . . . . . . . 9 ⊢ ((𝐺 ∈ Grp ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → ((invg‘𝐺)‘(𝑎(+g‘𝐺)𝑏)) = (((invg‘𝐺)‘𝑏)(+g‘𝐺)((invg‘𝐺)‘𝑎)))
30	17, 22, 27, 29	syl3anc 1399	. . . . . . . 8 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → ((invg‘𝐺)‘(𝑎(+g‘𝐺)𝑏)) = (((invg‘𝐺)‘𝑏)(+g‘𝐺)((invg‘𝐺)‘𝑎)))
31	7	adantr 486	. . . . . . . . . 10 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → 𝑇 ⊆ (𝑍‘𝑈))
32	28	subginvcl 19377	. . . . . . . . . . 11 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑎 ∈ 𝑇) → ((invg‘𝐺)‘𝑎) ∈ 𝑇)
33	15, 21, 32	syl2anc 596	. . . . . . . . . 10 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → ((invg‘𝐺)‘𝑎) ∈ 𝑇)
34	31, 33	sseldd 3914	. . . . . . . . 9 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → ((invg‘𝐺)‘𝑎) ∈ (𝑍‘𝑈))
35	28	subginvcl 19377	. . . . . . . . . 10 ⊢ ((𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑏 ∈ 𝑈) → ((invg‘𝐺)‘𝑏) ∈ 𝑈)
36	23, 26, 35	syl2anc 596	. . . . . . . . 9 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → ((invg‘𝐺)‘𝑏) ∈ 𝑈)
37	12, 9	cntzi 19576	. . . . . . . . 9 ⊢ ((((invg‘𝐺)‘𝑎) ∈ (𝑍‘𝑈) ∧ ((invg‘𝐺)‘𝑏) ∈ 𝑈) → (((invg‘𝐺)‘𝑎)(+g‘𝐺)((invg‘𝐺)‘𝑏)) = (((invg‘𝐺)‘𝑏)(+g‘𝐺)((invg‘𝐺)‘𝑎)))
38	34, 36, 37	syl2anc 596	. . . . . . . 8 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → (((invg‘𝐺)‘𝑎)(+g‘𝐺)((invg‘𝐺)‘𝑏)) = (((invg‘𝐺)‘𝑏)(+g‘𝐺)((invg‘𝐺)‘𝑎)))
39	30, 38	eqtr4d 2801	. . . . . . 7 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → ((invg‘𝐺)‘(𝑎(+g‘𝐺)𝑏)) = (((invg‘𝐺)‘𝑎)(+g‘𝐺)((invg‘𝐺)‘𝑏)))
40	12, 8	lsmelvali 19897	. . . . . . . 8 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ (((invg‘𝐺)‘𝑎) ∈ 𝑇 ∧ ((invg‘𝐺)‘𝑏) ∈ 𝑈)) → (((invg‘𝐺)‘𝑎)(+g‘𝐺)((invg‘𝐺)‘𝑏)) ∈ (𝑇 ⊕ 𝑈))
41	15, 23, 33, 36, 40	syl22anc 852	. . . . . . 7 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → (((invg‘𝐺)‘𝑎)(+g‘𝐺)((invg‘𝐺)‘𝑏)) ∈ (𝑇 ⊕ 𝑈))
42	39, 41	eqeltrd 2864	. . . . . 6 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → ((invg‘𝐺)‘(𝑎(+g‘𝐺)𝑏)) ∈ (𝑇 ⊕ 𝑈))
43		fveq2 6911	. . . . . . 7 ⊢ (𝑥 = (𝑎(+g‘𝐺)𝑏) → ((invg‘𝐺)‘𝑥) = ((invg‘𝐺)‘(𝑎(+g‘𝐺)𝑏)))
44	43	eleq1d 2849	. . . . . 6 ⊢ (𝑥 = (𝑎(+g‘𝐺)𝑏) → (((invg‘𝐺)‘𝑥) ∈ (𝑇 ⊕ 𝑈) ↔ ((invg‘𝐺)‘(𝑎(+g‘𝐺)𝑏)) ∈ (𝑇 ⊕ 𝑈)))
45	42, 44	syl5ibrcom 250	. . . . 5 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → (𝑥 = (𝑎(+g‘𝐺)𝑏) → ((invg‘𝐺)‘𝑥) ∈ (𝑇 ⊕ 𝑈)))
46	45	rexlimdvva 3223	. . . 4 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → (∃𝑎 ∈ 𝑇 ∃𝑏 ∈ 𝑈 𝑥 = (𝑎(+g‘𝐺)𝑏) → ((invg‘𝐺)‘𝑥) ∈ (𝑇 ⊕ 𝑈)))
47	14, 46	sylbid 243	. . 3 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → (𝑥 ∈ (𝑇 ⊕ 𝑈) → ((invg‘𝐺)‘𝑥) ∈ (𝑇 ⊕ 𝑈)))
48	47	ralrimiv 3157	. 2 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → ∀𝑥 ∈ (𝑇 ⊕ 𝑈)((invg‘𝐺)‘𝑥) ∈ (𝑇 ⊕ 𝑈))
49	1, 16	syl 18	. . 3 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → 𝐺 ∈ Grp)
50	28	issubg3 19387	. . 3 ⊢ (𝐺 ∈ Grp → ((𝑇 ⊕ 𝑈) ∈ (SubGrp‘𝐺) ↔ ((𝑇 ⊕ 𝑈) ∈ (SubMnd‘𝐺) ∧ ∀𝑥 ∈ (𝑇 ⊕ 𝑈)((invg‘𝐺)‘𝑥) ∈ (𝑇 ⊕ 𝑈))))
51	49, 50	syl 18	. 2 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → ((𝑇 ⊕ 𝑈) ∈ (SubGrp‘𝐺) ↔ ((𝑇 ⊕ 𝑈) ∈ (SubMnd‘𝐺) ∧ ∀𝑥 ∈ (𝑇 ⊕ 𝑈)((invg‘𝐺)‘𝑥) ∈ (𝑇 ⊕ 𝑈))))
52	11, 48, 51	mpbir2and 726	1 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → (𝑇 ⊕ 𝑈) ∈ (SubGrp‘𝐺))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090   ⊆ wss 3900  ‘cfv 6561  (class class class)co 7446  Basecbs 17419  +_gcplusg 17460  SubMndcsubmnd 19009  Grpcgrp 19176  inv_gcminusg 19177  SubGrpcsubg 19362  Cntzccntz 19562  LSSumclsm 19881

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778  ax-cnex 11286  ax-resscn 11287  ax-1cn 11288  ax-icn 11289  ax-addcl 11290  ax-addrcl 11291  ax-mulcl 11292  ax-mulrcl 11293  ax-mulcom 11294  ax-addass 11295  ax-mulass 11296  ax-distr 11297  ax-i2m1 11298  ax-1ne0 11299  ax-1rid 11300  ax-rnegex 11301  ax-rrecex 11302  ax-cnre 11303  ax-pre-lttri 11304  ax-pre-lttrn 11305  ax-pre-ltadd 11306  ax-pre-mulgt0 11307

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5551  df-eprel 5556  df-po 5564  df-so 5565  df-fr 5609  df-we 5611  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-pred 6325  df-ord 6386  df-on 6387  df-lim 6388  df-suc 6389  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-riota 7403  df-ov 7449  df-oprab 7450  df-mpo 7451  df-om 7905  df-1st 8028  df-2nd 8029  df-frecs 8330  df-wrecs 8361  df-recs 8410  df-rdg 8449  df-er 8748  df-en 9005  df-dom 9006  df-sdom 9007  df-pnf 11375  df-mnf 11376  df-xr 11377  df-ltxr 11378  df-le 11379  df-sub 11573  df-neg 11574  df-nn 12366  df-2 12435  df-sets 17374  df-slot 17392  df-ndx 17404  df-base 17420  df-ress 17441  df-plusg 17473  df-0g 17644  df-mgm 18848  df-sgrp 18940  df-mnd 18956  df-submnd 19011  df-grp 19179  df-minusg 19180  df-subg 19365  df-cntz 19564  df-lsm 19883

This theorem is used by:  pj1ghm  19950  lsmsubg2  20106  dprd2da  20291  dmdprdsplit2lem  20294  dprdsplit  20297