Theorem lsmsubm 19559

Description: The sum of two commuting submonoids is a submonoid. (Contributed by Mario Carneiro, 19-Apr-2016.)

Hypotheses

Ref	Expression
lsmsubg.p	⊢ ⊕ = (LSSum‘𝐺)
lsmsubg.z	⊢ 𝑍 = (Cntz‘𝐺)

Assertion

Ref	Expression
lsmsubm	⊢ ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → (𝑇 ⊕ 𝑈) ∈ (SubMnd‘𝐺))

Proof of Theorem lsmsubm

Dummy variables 𝑎 𝑏 𝑐 𝑑 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		submrcl 18705	. . . 4 ⊢ (𝑇 ∈ (SubMnd‘𝐺) → 𝐺 ∈ Mnd)
2	1	3ad2ant1 1133	. . 3 ⊢ ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → 𝐺 ∈ Mnd)
3		eqid 2729	. . . . 5 ⊢ (Base‘𝐺) = (Base‘𝐺)
4	3	submss 18712	. . . 4 ⊢ (𝑇 ∈ (SubMnd‘𝐺) → 𝑇 ⊆ (Base‘𝐺))
5	4	3ad2ant1 1133	. . 3 ⊢ ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → 𝑇 ⊆ (Base‘𝐺))
6	3	submss 18712	. . . 4 ⊢ (𝑈 ∈ (SubMnd‘𝐺) → 𝑈 ⊆ (Base‘𝐺))
7	6	3ad2ant2 1134	. . 3 ⊢ ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → 𝑈 ⊆ (Base‘𝐺))
8		lsmsubg.p	. . . 4 ⊢ ⊕ = (LSSum‘𝐺)
9	3, 8	lsmssv 19549	. . 3 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ (Base‘𝐺) ∧ 𝑈 ⊆ (Base‘𝐺)) → (𝑇 ⊕ 𝑈) ⊆ (Base‘𝐺))
10	2, 5, 7, 9	syl3anc 1373	. 2 ⊢ ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → (𝑇 ⊕ 𝑈) ⊆ (Base‘𝐺))
11		simp2 1137	. . . 4 ⊢ ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → 𝑈 ∈ (SubMnd‘𝐺))
12	3, 8	lsmub1x 19552	. . . 4 ⊢ ((𝑇 ⊆ (Base‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺)) → 𝑇 ⊆ (𝑇 ⊕ 𝑈))
13	5, 11, 12	syl2anc 584	. . 3 ⊢ ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → 𝑇 ⊆ (𝑇 ⊕ 𝑈))
14		eqid 2729	. . . . 5 ⊢ (0g‘𝐺) = (0g‘𝐺)
15	14	subm0cl 18714	. . . 4 ⊢ (𝑇 ∈ (SubMnd‘𝐺) → (0g‘𝐺) ∈ 𝑇)
16	15	3ad2ant1 1133	. . 3 ⊢ ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → (0g‘𝐺) ∈ 𝑇)
17	13, 16	sseldd 3944	. 2 ⊢ ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → (0g‘𝐺) ∈ (𝑇 ⊕ 𝑈))
18		eqid 2729	. . . . . . 7 ⊢ (+g‘𝐺) = (+g‘𝐺)
19	3, 18, 8	lsmelvalx 19546	. . . . . 6 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ (Base‘𝐺) ∧ 𝑈 ⊆ (Base‘𝐺)) → (𝑥 ∈ (𝑇 ⊕ 𝑈) ↔ ∃𝑎 ∈ 𝑇 ∃𝑐 ∈ 𝑈 𝑥 = (𝑎(+g‘𝐺)𝑐)))
20	2, 5, 7, 19	syl3anc 1373	. . . . 5 ⊢ ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → (𝑥 ∈ (𝑇 ⊕ 𝑈) ↔ ∃𝑎 ∈ 𝑇 ∃𝑐 ∈ 𝑈 𝑥 = (𝑎(+g‘𝐺)𝑐)))
21	3, 18, 8	lsmelvalx 19546	. . . . . 6 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ (Base‘𝐺) ∧ 𝑈 ⊆ (Base‘𝐺)) → (𝑦 ∈ (𝑇 ⊕ 𝑈) ↔ ∃𝑏 ∈ 𝑇 ∃𝑑 ∈ 𝑈 𝑦 = (𝑏(+g‘𝐺)𝑑)))
22	2, 5, 7, 21	syl3anc 1373	. . . . 5 ⊢ ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → (𝑦 ∈ (𝑇 ⊕ 𝑈) ↔ ∃𝑏 ∈ 𝑇 ∃𝑑 ∈ 𝑈 𝑦 = (𝑏(+g‘𝐺)𝑑)))
23	20, 22	anbi12d 632	. . . 4 ⊢ ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → ((𝑥 ∈ (𝑇 ⊕ 𝑈) ∧ 𝑦 ∈ (𝑇 ⊕ 𝑈)) ↔ (∃𝑎 ∈ 𝑇 ∃𝑐 ∈ 𝑈 𝑥 = (𝑎(+g‘𝐺)𝑐) ∧ ∃𝑏 ∈ 𝑇 ∃𝑑 ∈ 𝑈 𝑦 = (𝑏(+g‘𝐺)𝑑))))
24		reeanv 3207	. . . . 5 ⊢ (∃𝑎 ∈ 𝑇 ∃𝑏 ∈ 𝑇 (∃𝑐 ∈ 𝑈 𝑥 = (𝑎(+g‘𝐺)𝑐) ∧ ∃𝑑 ∈ 𝑈 𝑦 = (𝑏(+g‘𝐺)𝑑)) ↔ (∃𝑎 ∈ 𝑇 ∃𝑐 ∈ 𝑈 𝑥 = (𝑎(+g‘𝐺)𝑐) ∧ ∃𝑏 ∈ 𝑇 ∃𝑑 ∈ 𝑈 𝑦 = (𝑏(+g‘𝐺)𝑑)))
25		reeanv 3207	. . . . . . 7 ⊢ (∃𝑐 ∈ 𝑈 ∃𝑑 ∈ 𝑈 (𝑥 = (𝑎(+g‘𝐺)𝑐) ∧ 𝑦 = (𝑏(+g‘𝐺)𝑑)) ↔ (∃𝑐 ∈ 𝑈 𝑥 = (𝑎(+g‘𝐺)𝑐) ∧ ∃𝑑 ∈ 𝑈 𝑦 = (𝑏(+g‘𝐺)𝑑)))
26	2	adantr 480	. . . . . . . . . . . 12 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ ((𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇) ∧ (𝑐 ∈ 𝑈 ∧ 𝑑 ∈ 𝑈))) → 𝐺 ∈ Mnd)
27	5	adantr 480	. . . . . . . . . . . . 13 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ ((𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇) ∧ (𝑐 ∈ 𝑈 ∧ 𝑑 ∈ 𝑈))) → 𝑇 ⊆ (Base‘𝐺))
28		simprll 778	. . . . . . . . . . . . 13 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ ((𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇) ∧ (𝑐 ∈ 𝑈 ∧ 𝑑 ∈ 𝑈))) → 𝑎 ∈ 𝑇)
29	27, 28	sseldd 3944	. . . . . . . . . . . 12 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ ((𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇) ∧ (𝑐 ∈ 𝑈 ∧ 𝑑 ∈ 𝑈))) → 𝑎 ∈ (Base‘𝐺))
30		simprlr 779	. . . . . . . . . . . . 13 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ ((𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇) ∧ (𝑐 ∈ 𝑈 ∧ 𝑑 ∈ 𝑈))) → 𝑏 ∈ 𝑇)
31	27, 30	sseldd 3944	. . . . . . . . . . . 12 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ ((𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇) ∧ (𝑐 ∈ 𝑈 ∧ 𝑑 ∈ 𝑈))) → 𝑏 ∈ (Base‘𝐺))
32	7	adantr 480	. . . . . . . . . . . . 13 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ ((𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇) ∧ (𝑐 ∈ 𝑈 ∧ 𝑑 ∈ 𝑈))) → 𝑈 ⊆ (Base‘𝐺))
33		simprrl 780	. . . . . . . . . . . . 13 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ ((𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇) ∧ (𝑐 ∈ 𝑈 ∧ 𝑑 ∈ 𝑈))) → 𝑐 ∈ 𝑈)
34	32, 33	sseldd 3944	. . . . . . . . . . . 12 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ ((𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇) ∧ (𝑐 ∈ 𝑈 ∧ 𝑑 ∈ 𝑈))) → 𝑐 ∈ (Base‘𝐺))
35		simprrr 781	. . . . . . . . . . . . 13 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ ((𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇) ∧ (𝑐 ∈ 𝑈 ∧ 𝑑 ∈ 𝑈))) → 𝑑 ∈ 𝑈)
36	32, 35	sseldd 3944	. . . . . . . . . . . 12 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ ((𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇) ∧ (𝑐 ∈ 𝑈 ∧ 𝑑 ∈ 𝑈))) → 𝑑 ∈ (Base‘𝐺))
37		simpl3 1194	. . . . . . . . . . . . . 14 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ ((𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇) ∧ (𝑐 ∈ 𝑈 ∧ 𝑑 ∈ 𝑈))) → 𝑇 ⊆ (𝑍‘𝑈))
38	37, 30	sseldd 3944	. . . . . . . . . . . . 13 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ ((𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇) ∧ (𝑐 ∈ 𝑈 ∧ 𝑑 ∈ 𝑈))) → 𝑏 ∈ (𝑍‘𝑈))
39		lsmsubg.z	. . . . . . . . . . . . . 14 ⊢ 𝑍 = (Cntz‘𝐺)
40	18, 39	cntzi 19237	. . . . . . . . . . . . 13 ⊢ ((𝑏 ∈ (𝑍‘𝑈) ∧ 𝑐 ∈ 𝑈) → (𝑏(+g‘𝐺)𝑐) = (𝑐(+g‘𝐺)𝑏))
41	38, 33, 40	syl2anc 584	. . . . . . . . . . . 12 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ ((𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇) ∧ (𝑐 ∈ 𝑈 ∧ 𝑑 ∈ 𝑈))) → (𝑏(+g‘𝐺)𝑐) = (𝑐(+g‘𝐺)𝑏))
42	3, 18, 26, 29, 31, 34, 36, 41	mnd4g 18651	. . . . . . . . . . 11 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ ((𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇) ∧ (𝑐 ∈ 𝑈 ∧ 𝑑 ∈ 𝑈))) → ((𝑎(+g‘𝐺)𝑏)(+g‘𝐺)(𝑐(+g‘𝐺)𝑑)) = ((𝑎(+g‘𝐺)𝑐)(+g‘𝐺)(𝑏(+g‘𝐺)𝑑)))
43		simpl1 1192	. . . . . . . . . . . . 13 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ ((𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇) ∧ (𝑐 ∈ 𝑈 ∧ 𝑑 ∈ 𝑈))) → 𝑇 ∈ (SubMnd‘𝐺))
44	18	submcl 18715	. . . . . . . . . . . . 13 ⊢ ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇) → (𝑎(+g‘𝐺)𝑏) ∈ 𝑇)
45	43, 28, 30, 44	syl3anc 1373	. . . . . . . . . . . 12 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ ((𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇) ∧ (𝑐 ∈ 𝑈 ∧ 𝑑 ∈ 𝑈))) → (𝑎(+g‘𝐺)𝑏) ∈ 𝑇)
46		simpl2 1193	. . . . . . . . . . . . 13 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ ((𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇) ∧ (𝑐 ∈ 𝑈 ∧ 𝑑 ∈ 𝑈))) → 𝑈 ∈ (SubMnd‘𝐺))
47	18	submcl 18715	. . . . . . . . . . . . 13 ⊢ ((𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑐 ∈ 𝑈 ∧ 𝑑 ∈ 𝑈) → (𝑐(+g‘𝐺)𝑑) ∈ 𝑈)
48	46, 33, 35, 47	syl3anc 1373	. . . . . . . . . . . 12 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ ((𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇) ∧ (𝑐 ∈ 𝑈 ∧ 𝑑 ∈ 𝑈))) → (𝑐(+g‘𝐺)𝑑) ∈ 𝑈)
49	3, 18, 8	lsmelvalix 19547	. . . . . . . . . . . 12 ⊢ (((𝐺 ∈ Mnd ∧ 𝑇 ⊆ (Base‘𝐺) ∧ 𝑈 ⊆ (Base‘𝐺)) ∧ ((𝑎(+g‘𝐺)𝑏) ∈ 𝑇 ∧ (𝑐(+g‘𝐺)𝑑) ∈ 𝑈)) → ((𝑎(+g‘𝐺)𝑏)(+g‘𝐺)(𝑐(+g‘𝐺)𝑑)) ∈ (𝑇 ⊕ 𝑈))
50	26, 27, 32, 45, 48, 49	syl32anc 1380	. . . . . . . . . . 11 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ ((𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇) ∧ (𝑐 ∈ 𝑈 ∧ 𝑑 ∈ 𝑈))) → ((𝑎(+g‘𝐺)𝑏)(+g‘𝐺)(𝑐(+g‘𝐺)𝑑)) ∈ (𝑇 ⊕ 𝑈))
51	42, 50	eqeltrrd 2829	. . . . . . . . . 10 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ ((𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇) ∧ (𝑐 ∈ 𝑈 ∧ 𝑑 ∈ 𝑈))) → ((𝑎(+g‘𝐺)𝑐)(+g‘𝐺)(𝑏(+g‘𝐺)𝑑)) ∈ (𝑇 ⊕ 𝑈))
52		oveq12 7378	. . . . . . . . . . 11 ⊢ ((𝑥 = (𝑎(+g‘𝐺)𝑐) ∧ 𝑦 = (𝑏(+g‘𝐺)𝑑)) → (𝑥(+g‘𝐺)𝑦) = ((𝑎(+g‘𝐺)𝑐)(+g‘𝐺)(𝑏(+g‘𝐺)𝑑)))
53	52	eleq1d 2813	. . . . . . . . . 10 ⊢ ((𝑥 = (𝑎(+g‘𝐺)𝑐) ∧ 𝑦 = (𝑏(+g‘𝐺)𝑑)) → ((𝑥(+g‘𝐺)𝑦) ∈ (𝑇 ⊕ 𝑈) ↔ ((𝑎(+g‘𝐺)𝑐)(+g‘𝐺)(𝑏(+g‘𝐺)𝑑)) ∈ (𝑇 ⊕ 𝑈)))
54	51, 53	syl5ibrcom 247	. . . . . . . . 9 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ ((𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇) ∧ (𝑐 ∈ 𝑈 ∧ 𝑑 ∈ 𝑈))) → ((𝑥 = (𝑎(+g‘𝐺)𝑐) ∧ 𝑦 = (𝑏(+g‘𝐺)𝑑)) → (𝑥(+g‘𝐺)𝑦) ∈ (𝑇 ⊕ 𝑈)))
55	54	anassrs 467	. . . . . . . 8 ⊢ ((((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇)) ∧ (𝑐 ∈ 𝑈 ∧ 𝑑 ∈ 𝑈)) → ((𝑥 = (𝑎(+g‘𝐺)𝑐) ∧ 𝑦 = (𝑏(+g‘𝐺)𝑑)) → (𝑥(+g‘𝐺)𝑦) ∈ (𝑇 ⊕ 𝑈)))
56	55	rexlimdvva 3192	. . . . . . 7 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇)) → (∃𝑐 ∈ 𝑈 ∃𝑑 ∈ 𝑈 (𝑥 = (𝑎(+g‘𝐺)𝑐) ∧ 𝑦 = (𝑏(+g‘𝐺)𝑑)) → (𝑥(+g‘𝐺)𝑦) ∈ (𝑇 ⊕ 𝑈)))
57	25, 56	biimtrrid 243	. . . . . 6 ⊢ (((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) ∧ (𝑎 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇)) → ((∃𝑐 ∈ 𝑈 𝑥 = (𝑎(+g‘𝐺)𝑐) ∧ ∃𝑑 ∈ 𝑈 𝑦 = (𝑏(+g‘𝐺)𝑑)) → (𝑥(+g‘𝐺)𝑦) ∈ (𝑇 ⊕ 𝑈)))
58	57	rexlimdvva 3192	. . . . 5 ⊢ ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → (∃𝑎 ∈ 𝑇 ∃𝑏 ∈ 𝑇 (∃𝑐 ∈ 𝑈 𝑥 = (𝑎(+g‘𝐺)𝑐) ∧ ∃𝑑 ∈ 𝑈 𝑦 = (𝑏(+g‘𝐺)𝑑)) → (𝑥(+g‘𝐺)𝑦) ∈ (𝑇 ⊕ 𝑈)))
59	24, 58	biimtrrid 243	. . . 4 ⊢ ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → ((∃𝑎 ∈ 𝑇 ∃𝑐 ∈ 𝑈 𝑥 = (𝑎(+g‘𝐺)𝑐) ∧ ∃𝑏 ∈ 𝑇 ∃𝑑 ∈ 𝑈 𝑦 = (𝑏(+g‘𝐺)𝑑)) → (𝑥(+g‘𝐺)𝑦) ∈ (𝑇 ⊕ 𝑈)))
60	23, 59	sylbid 240	. . 3 ⊢ ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → ((𝑥 ∈ (𝑇 ⊕ 𝑈) ∧ 𝑦 ∈ (𝑇 ⊕ 𝑈)) → (𝑥(+g‘𝐺)𝑦) ∈ (𝑇 ⊕ 𝑈)))
61	60	ralrimivv 3176	. 2 ⊢ ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → ∀𝑥 ∈ (𝑇 ⊕ 𝑈)∀𝑦 ∈ (𝑇 ⊕ 𝑈)(𝑥(+g‘𝐺)𝑦) ∈ (𝑇 ⊕ 𝑈))
62	3, 14, 18	issubm 18706	. . 3 ⊢ (𝐺 ∈ Mnd → ((𝑇 ⊕ 𝑈) ∈ (SubMnd‘𝐺) ↔ ((𝑇 ⊕ 𝑈) ⊆ (Base‘𝐺) ∧ (0g‘𝐺) ∈ (𝑇 ⊕ 𝑈) ∧ ∀𝑥 ∈ (𝑇 ⊕ 𝑈)∀𝑦 ∈ (𝑇 ⊕ 𝑈)(𝑥(+g‘𝐺)𝑦) ∈ (𝑇 ⊕ 𝑈))))
63	2, 62	syl 17	. 2 ⊢ ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → ((𝑇 ⊕ 𝑈) ∈ (SubMnd‘𝐺) ↔ ((𝑇 ⊕ 𝑈) ⊆ (Base‘𝐺) ∧ (0g‘𝐺) ∈ (𝑇 ⊕ 𝑈) ∧ ∀𝑥 ∈ (𝑇 ⊕ 𝑈)∀𝑦 ∈ (𝑇 ⊕ 𝑈)(𝑥(+g‘𝐺)𝑦) ∈ (𝑇 ⊕ 𝑈))))
64	10, 17, 61, 63	mpbir3and 1343	1 ⊢ ((𝑇 ∈ (SubMnd‘𝐺) ∧ 𝑈 ∈ (SubMnd‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → (𝑇 ⊕ 𝑈) ∈ (SubMnd‘𝐺))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109  ∀wral 3044  ∃wrex 3053   ⊆ wss 3911  ‘cfv 6499  (class class class)co 7369  Basecbs 17155  +_gcplusg 17196  0_gc0g 17378  Mndcmnd 18637  SubMndcsubmnd 18685  Cntzccntz 19223  LSSumclsm 19540

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5229  ax-sep 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382  ax-un 7691  ax-cnex 11100  ax-resscn 11101  ax-1cn 11102  ax-icn 11103  ax-addcl 11104  ax-addrcl 11105  ax-mulcl 11106  ax-mulrcl 11107  ax-mulcom 11108  ax-addass 11109  ax-mulass 11110  ax-distr 11111  ax-i2m1 11112  ax-1ne0 11113  ax-1rid 11114  ax-rnegex 11115  ax-rrecex 11116  ax-cnre 11117  ax-pre-lttri 11118  ax-pre-lttrn 11119  ax-pre-ltadd 11120  ax-pre-mulgt0 11121

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-rmo 3351  df-reu 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3931  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-tr 5210  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6262  df-ord 6323  df-on 6324  df-lim 6325  df-suc 6326  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-riota 7326  df-ov 7372  df-oprab 7373  df-mpo 7374  df-om 7823  df-1st 7947  df-2nd 7948  df-frecs 8237  df-wrecs 8268  df-recs 8317  df-rdg 8355  df-er 8648  df-en 8896  df-dom 8897  df-sdom 8898  df-pnf 11186  df-mnf 11187  df-xr 11188  df-ltxr 11189  df-le 11190  df-sub 11383  df-neg 11384  df-nn 12163  df-2 12225  df-sets 17110  df-slot 17128  df-ndx 17140  df-base 17156  df-ress 17177  df-plusg 17209  df-0g 17380  df-mgm 18543  df-sgrp 18622  df-mnd 18638  df-submnd 18687  df-cntz 19225  df-lsm 19542

This theorem is referenced by:  lsmsubg  19560