Theorem lsmsubg 19848

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 19339	. . . 4 ⊢ (𝑇 ∈ (SubGrp‘𝐺) → 𝑇 ∈ (SubMnd‘𝐺))
3	1, 2	syl 18	. . 3 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → 𝑇 ∈ (SubMnd‘𝐺))
4		simp2 1155	. . . 4 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → 𝑈 ∈ (SubGrp‘𝐺))
5		subgsubm 19339	. . . 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 19847	. . 3 ⊢ ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → (𝑇 ⊕ 𝑈) ∈ (SubMnd‘𝐺))
11	3, 6, 7, 10	syl3anc 1398	. 2 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → (𝑇 ⊕ 𝑈) ∈ (SubMnd‘𝐺))
12		eqid 2761	. . . . . 6 ⊢ (+g‘𝐺) = (+g‘𝐺)
13	12, 8	lsmelval 19843	. . . . 5 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → (𝑥 ∈ (𝑇 ⊕ 𝑈) ↔ ∃𝑎 ∈ 𝑇 ∃𝑏 ∈ 𝑈 𝑥 = (𝑎(+g‘𝐺)𝑏)))
14	13	3adant3 1150	. . . 4 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → (𝑥 ∈ (𝑇 ⊕ 𝑈) ↔ ∃𝑎 ∈ 𝑇 ∃𝑏 ∈ 𝑈 𝑥 = (𝑎(+g‘𝐺)𝑏)))
15	1	adantr 486	. . . . . . . . . 10 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → 𝑇 ∈ (SubGrp‘𝐺))
16		subgrcl 19321	. . . . . . . . . 10 ⊢ (𝑇 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
17	15, 16	syl 18	. . . . . . . . 9 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → 𝐺 ∈ Grp)
18		eqid 2761	. . . . . . . . . . . 12 ⊢ (Base‘𝐺) = (Base‘𝐺)
19	18	subgss 19317	. . . . . . . . . . 11 ⊢ (𝑇 ∈ (SubGrp‘𝐺) → 𝑇 ⊆ (Base‘𝐺))
20	15, 19	syl 18	. . . . . . . . . 10 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → 𝑇 ⊆ (Base‘𝐺))
21		simprl 783	. . . . . . . . . 10 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → 𝑎 ∈ 𝑇)
22	20, 21	sseldd 3932	. . . . . . . . 9 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → 𝑎 ∈ (Base‘𝐺))
23	4	adantr 486	. . . . . . . . . . 11 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → 𝑈 ∈ (SubGrp‘𝐺))
24	18	subgss 19317	. . . . . . . . . . 11 ⊢ (𝑈 ∈ (SubGrp‘𝐺) → 𝑈 ⊆ (Base‘𝐺))
25	23, 24	syl 18	. . . . . . . . . 10 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → 𝑈 ⊆ (Base‘𝐺))
26		simprr 785	. . . . . . . . . 10 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → 𝑏 ∈ 𝑈)
27	25, 26	sseldd 3932	. . . . . . . . 9 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → 𝑏 ∈ (Base‘𝐺))
28		eqid 2761	. . . . . . . . . 10 ⊢ (invg‘𝐺) = (invg‘𝐺)
29	18, 12, 28	grpinvadd 19208	. . . . . . . . 9 ⊢ ((𝐺 ∈ Grp ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → ((invg‘𝐺)‘(𝑎(+g‘𝐺)𝑏)) = (((invg‘𝐺)‘𝑏)(+g‘𝐺)((invg‘𝐺)‘𝑎)))
30	17, 22, 27, 29	syl3anc 1398	. . . . . . . 8 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → ((invg‘𝐺)‘(𝑎(+g‘𝐺)𝑏)) = (((invg‘𝐺)‘𝑏)(+g‘𝐺)((invg‘𝐺)‘𝑎)))
31	7	adantr 486	. . . . . . . . . 10 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → 𝑇 ⊆ (𝑍‘𝑈))
32	28	subginvcl 19325	. . . . . . . . . . 11 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑎 ∈ 𝑇) → ((invg‘𝐺)‘𝑎) ∈ 𝑇)
33	15, 21, 32	syl2anc 596	. . . . . . . . . 10 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → ((invg‘𝐺)‘𝑎) ∈ 𝑇)
34	31, 33	sseldd 3932	. . . . . . . . 9 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → ((invg‘𝐺)‘𝑎) ∈ (𝑍‘𝑈))
35	28	subginvcl 19325	. . . . . . . . . 10 ⊢ ((𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑏 ∈ 𝑈) → ((invg‘𝐺)‘𝑏) ∈ 𝑈)
36	23, 26, 35	syl2anc 596	. . . . . . . . 9 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → ((invg‘𝐺)‘𝑏) ∈ 𝑈)
37	12, 9	cntzi 19523	. . . . . . . . 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 2799	. . . . . . 7 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → ((invg‘𝐺)‘(𝑎(+g‘𝐺)𝑏)) = (((invg‘𝐺)‘𝑎)(+g‘𝐺)((invg‘𝐺)‘𝑏)))
40	12, 8	lsmelvali 19844	. . . . . . . 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 2861	. . . . . 6 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → ((invg‘𝐺)‘(𝑎(+g‘𝐺)𝑏)) ∈ (𝑇 ⊕ 𝑈))
43		fveq2 6877	. . . . . . 7 ⊢ (𝑥 = (𝑎(+g‘𝐺)𝑏) → ((invg‘𝐺)‘𝑥) = ((invg‘𝐺)‘(𝑎(+g‘𝐺)𝑏)))
44	43	eleq1d 2846	. . . . . 6 ⊢ (𝑥 = (𝑎(+g‘𝐺)𝑏) → (((invg‘𝐺)‘𝑥) ∈ (𝑇 ⊕ 𝑈) ↔ ((invg‘𝐺)‘(𝑎(+g‘𝐺)𝑏)) ∈ (𝑇 ⊕ 𝑈)))
45	42, 44	syl5ibrcom 250	. . . . 5 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → (𝑥 = (𝑎(+g‘𝐺)𝑏) → ((invg‘𝐺)‘𝑥) ∈ (𝑇 ⊕ 𝑈)))
46	45	rexlimdvva 3220	. . . 4 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → (∃𝑎 ∈ 𝑇 ∃𝑏 ∈ 𝑈 𝑥 = (𝑎(+g‘𝐺)𝑏) → ((invg‘𝐺)‘𝑥) ∈ (𝑇 ⊕ 𝑈)))
47	14, 46	sylbid 243	. . 3 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → (𝑥 ∈ (𝑇 ⊕ 𝑈) → ((invg‘𝐺)‘𝑥) ∈ (𝑇 ⊕ 𝑈)))
48	47	ralrimiv 3154	. 2 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → ∀𝑥 ∈ (𝑇 ⊕ 𝑈)((invg‘𝐺)‘𝑥) ∈ (𝑇 ⊕ 𝑈))
49	1, 16	syl 18	. . 3 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → 𝐺 ∈ Grp)
50	28	issubg3 19335	. . 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 2145  ∀wral 3077  ∃wrex 3087   ⊆ wss 3899  ‘cfv 6531  (class class class)co 7412  Basecbs 17367  +_gcplusg 17408  SubMndcsubmnd 18957  Grpcgrp 19124  inv_gcminusg 19125  SubGrpcsubg 19310  Cntzccntz 19509  LSSumclsm 19828

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740  ax-cnex 11237  ax-resscn 11238  ax-1cn 11239  ax-icn 11240  ax-addcl 11241  ax-addrcl 11242  ax-mulcl 11243  ax-mulrcl 11244  ax-mulcom 11245  ax-addass 11246  ax-mulass 11247  ax-distr 11248  ax-i2m1 11249  ax-1ne0 11250  ax-1rid 11251  ax-rnegex 11252  ax-rrecex 11253  ax-cnre 11254  ax-pre-lttri 11255  ax-pre-lttrn 11256  ax-pre-ltadd 11257  ax-pre-mulgt0 11258

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  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 6297  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7867  df-1st 7990  df-2nd 7991  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-er 8701  df-en 8958  df-dom 8959  df-sdom 8960  df-pnf 11326  df-mnf 11327  df-xr 11328  df-ltxr 11329  df-le 11330  df-sub 11524  df-neg 11525  df-nn 12317  df-2 12386  df-sets 17322  df-slot 17340  df-ndx 17352  df-base 17368  df-ress 17389  df-plusg 17421  df-0g 17592  df-mgm 18796  df-sgrp 18888  df-mnd 18904  df-submnd 18959  df-grp 19127  df-minusg 19128  df-subg 19313  df-cntz 19511  df-lsm 19830

This theorem is used by:  pj1ghm  19897  lsmsubg2  20053  dprd2da  20238  dmdprdsplit2lem  20241  dprdsplit  20244