Theorem lsmsubg 19787

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 19278	. . . 4 ⊢ (𝑇 ∈ (SubGrp‘𝐺) → 𝑇 ∈ (SubMnd‘𝐺))
3	1, 2	syl 18	. . 3 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → 𝑇 ∈ (SubMnd‘𝐺))
4		simp2 1155	. . . 4 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → 𝑈 ∈ (SubGrp‘𝐺))
5		subgsubm 19278	. . . 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 19786	. . 3 ⊢ ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → (𝑇 ⊕ 𝑈) ∈ (SubMnd‘𝐺))
11	3, 6, 7, 10	syl3anc 1398	. 2 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → (𝑇 ⊕ 𝑈) ∈ (SubMnd‘𝐺))
12		eqid 2762	. . . . . 6 ⊢ (+g‘𝐺) = (+g‘𝐺)
13	12, 8	lsmelval 19782	. . . . 5 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → (𝑥 ∈ (𝑇 ⊕ 𝑈) ↔ ∃𝑎 ∈ 𝑇 ∃𝑏 ∈ 𝑈 𝑥 = (𝑎(+g‘𝐺)𝑏)))
14	13	3adant3 1150	. . . 4 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → (𝑥 ∈ (𝑇 ⊕ 𝑈) ↔ ∃𝑎 ∈ 𝑇 ∃𝑏 ∈ 𝑈 𝑥 = (𝑎(+g‘𝐺)𝑏)))
15	1	adantr 486	. . . . . . . . . 10 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → 𝑇 ∈ (SubGrp‘𝐺))
16		subgrcl 19260	. . . . . . . . . 10 ⊢ (𝑇 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
17	15, 16	syl 18	. . . . . . . . 9 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → 𝐺 ∈ Grp)
18		eqid 2762	. . . . . . . . . . . 12 ⊢ (Base‘𝐺) = (Base‘𝐺)
19	18	subgss 19256	. . . . . . . . . . 11 ⊢ (𝑇 ∈ (SubGrp‘𝐺) → 𝑇 ⊆ (Base‘𝐺))
20	15, 19	syl 18	. . . . . . . . . 10 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → 𝑇 ⊆ (Base‘𝐺))
21		simprl 783	. . . . . . . . . 10 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → 𝑎 ∈ 𝑇)
22	20, 21	sseldd 3935	. . . . . . . . 9 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → 𝑎 ∈ (Base‘𝐺))
23	4	adantr 486	. . . . . . . . . . 11 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → 𝑈 ∈ (SubGrp‘𝐺))
24	18	subgss 19256	. . . . . . . . . . 11 ⊢ (𝑈 ∈ (SubGrp‘𝐺) → 𝑈 ⊆ (Base‘𝐺))
25	23, 24	syl 18	. . . . . . . . . 10 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → 𝑈 ⊆ (Base‘𝐺))
26		simprr 785	. . . . . . . . . 10 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → 𝑏 ∈ 𝑈)
27	25, 26	sseldd 3935	. . . . . . . . 9 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → 𝑏 ∈ (Base‘𝐺))
28		eqid 2762	. . . . . . . . . 10 ⊢ (invg‘𝐺) = (invg‘𝐺)
29	18, 12, 28	grpinvadd 19147	. . . . . . . . 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 19264	. . . . . . . . . . 11 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑎 ∈ 𝑇) → ((invg‘𝐺)‘𝑎) ∈ 𝑇)
33	15, 21, 32	syl2anc 596	. . . . . . . . . 10 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → ((invg‘𝐺)‘𝑎) ∈ 𝑇)
34	31, 33	sseldd 3935	. . . . . . . . 9 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → ((invg‘𝐺)‘𝑎) ∈ (𝑍‘𝑈))
35	28	subginvcl 19264	. . . . . . . . . 10 ⊢ ((𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑏 ∈ 𝑈) → ((invg‘𝐺)‘𝑏) ∈ 𝑈)
36	23, 26, 35	syl2anc 596	. . . . . . . . 9 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → ((invg‘𝐺)‘𝑏) ∈ 𝑈)
37	12, 9	cntzi 19462	. . . . . . . . 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 2800	. . . . . . 7 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → ((invg‘𝐺)‘(𝑎(+g‘𝐺)𝑏)) = (((invg‘𝐺)‘𝑎)(+g‘𝐺)((invg‘𝐺)‘𝑏)))
40	12, 8	lsmelvali 19783	. . . . . . . 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 2862	. . . . . 6 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → ((invg‘𝐺)‘(𝑎(+g‘𝐺)𝑏)) ∈ (𝑇 ⊕ 𝑈))
43		fveq2 6882	. . . . . . 7 ⊢ (𝑥 = (𝑎(+g‘𝐺)𝑏) → ((invg‘𝐺)‘𝑥) = ((invg‘𝐺)‘(𝑎(+g‘𝐺)𝑏)))
44	43	eleq1d 2847	. . . . . 6 ⊢ (𝑥 = (𝑎(+g‘𝐺)𝑏) → (((invg‘𝐺)‘𝑥) ∈ (𝑇 ⊕ 𝑈) ↔ ((invg‘𝐺)‘(𝑎(+g‘𝐺)𝑏)) ∈ (𝑇 ⊕ 𝑈)))
45	42, 44	syl5ibrcom 250	. . . . 5 ⊢ (((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑈)) → (𝑥 = (𝑎(+g‘𝐺)𝑏) → ((invg‘𝐺)‘𝑥) ∈ (𝑇 ⊕ 𝑈)))
46	45	rexlimdvva 3221	. . . 4 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → (∃𝑎 ∈ 𝑇 ∃𝑏 ∈ 𝑈 𝑥 = (𝑎(+g‘𝐺)𝑏) → ((invg‘𝐺)‘𝑥) ∈ (𝑇 ⊕ 𝑈)))
47	14, 46	sylbid 243	. . 3 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → (𝑥 ∈ (𝑇 ⊕ 𝑈) → ((invg‘𝐺)‘𝑥) ∈ (𝑇 ⊕ 𝑈)))
48	47	ralrimiv 3155	. 2 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → ∀𝑥 ∈ (𝑇 ⊕ 𝑈)((invg‘𝐺)‘𝑥) ∈ (𝑇 ⊕ 𝑈))
49	1, 16	syl 18	. . 3 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → 𝐺 ∈ Grp)
50	28	issubg3 19274	. . 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 3078  ∃wrex 3088   ⊆ wss 3902  ‘cfv 6537  (class class class)co 7417  Basecbs 17307  +_gcplusg 17348  SubMndcsubmnd 18896  Grpcgrp 19063  inv_gcminusg 19064  SubGrpcsubg 19249  Cntzccntz 19448  LSSumclsm 19767

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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740  ax-cnex 11184  ax-resscn 11185  ax-1cn 11186  ax-icn 11187  ax-addcl 11188  ax-addrcl 11189  ax-mulcl 11190  ax-mulrcl 11191  ax-mulcom 11192  ax-addass 11193  ax-mulass 11194  ax-distr 11195  ax-i2m1 11196  ax-1ne0 11197  ax-1rid 11198  ax-rnegex 11199  ax-rrecex 11200  ax-cnre 11201  ax-pre-lttri 11202  ax-pre-lttrn 11203  ax-pre-ltadd 11204  ax-pre-mulgt0 11205

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7374  df-ov 7420  df-oprab 7421  df-mpo 7422  df-om 7867  df-1st 7990  df-2nd 7991  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-er 8700  df-en 8957  df-dom 8958  df-sdom 8959  df-pnf 11273  df-mnf 11274  df-xr 11275  df-ltxr 11276  df-le 11277  df-sub 11471  df-neg 11472  df-nn 12262  df-2 12331  df-sets 17262  df-slot 17280  df-ndx 17292  df-base 17308  df-ress 17329  df-plusg 17361  df-0g 17532  df-mgm 18736  df-sgrp 18827  df-mnd 18843  df-submnd 18898  df-grp 19066  df-minusg 19067  df-subg 19252  df-cntz 19450  df-lsm 19769

This theorem is used by:  pj1ghm  19836  lsmsubg2  19992  dprd2da  20177  dmdprdsplit2lem  20180  dprdsplit  20183