Theorem lsmdisj2 19901

Description: Association of the disjointness constraint in a subgroup sum. (Contributed by Mario Carneiro, 22-Apr-2016.)

Hypotheses

Ref	Expression
lsmcntz.p	⊢ ⊕ = (LSSum‘𝐺)
lsmcntz.s	⊢ (𝜑 → 𝑆 ∈ (SubGrp‘𝐺))
lsmcntz.t	⊢ (𝜑 → 𝑇 ∈ (SubGrp‘𝐺))
lsmcntz.u	⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝐺))
lsmdisj.o	⊢ 0 = (0g‘𝐺)
lsmdisj.i	⊢ (𝜑 → ((𝑆 ⊕ 𝑇) ∩ 𝑈) = { 0 })
lsmdisj2.i	⊢ (𝜑 → (𝑆 ∩ 𝑇) = { 0 })

Assertion

Ref	Expression
lsmdisj2	⊢ (𝜑 → (𝑇 ∩ (𝑆 ⊕ 𝑈)) = { 0 })

Proof of Theorem lsmdisj2

Dummy variables 𝑥 𝑢 𝑠 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		lsmcntz.s	. . . . . . 7 ⊢ (𝜑 → 𝑆 ∈ (SubGrp‘𝐺))
2		lsmcntz.u	. . . . . . 7 ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝐺))
3		eqid 2760	. . . . . . . 8 ⊢ (+g‘𝐺) = (+g‘𝐺)
4		lsmcntz.p	. . . . . . . 8 ⊢ ⊕ = (LSSum‘𝐺)
5	3, 4	lsmelval 19868	. . . . . . 7 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → (𝑥 ∈ (𝑆 ⊕ 𝑈) ↔ ∃𝑠 ∈ 𝑆 ∃𝑢 ∈ 𝑈 𝑥 = (𝑠(+g‘𝐺)𝑢)))
6	1, 2, 5	syl2anc 596	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ (𝑆 ⊕ 𝑈) ↔ ∃𝑠 ∈ 𝑆 ∃𝑢 ∈ 𝑈 𝑥 = (𝑠(+g‘𝐺)𝑢)))
7		simplrl 789	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑠 ∈ 𝑆)
8		subgrcl 19346	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
9	1, 8	syl 18	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝜑 → 𝐺 ∈ Grp)
10	9	ad2antrr 739	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝐺 ∈ Grp)
11	1	ad2antrr 739	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑆 ∈ (SubGrp‘𝐺))
12		eqid 2760	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (Base‘𝐺) = (Base‘𝐺)
13	12	subgss 19342	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺))
14	11, 13	syl 18	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑆 ⊆ (Base‘𝐺))
15	14, 7	sseldd 3909	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑠 ∈ (Base‘𝐺))
16		lsmdisj.o	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ 0 = (0g‘𝐺)
17		eqid 2760	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (invg‘𝐺) = (invg‘𝐺)
18	12, 3, 16, 17	grplinv 19205	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝐺 ∈ Grp ∧ 𝑠 ∈ (Base‘𝐺)) → (((invg‘𝐺)‘𝑠)(+g‘𝐺)𝑠) = 0 )
19	10, 15, 18	syl2anc 596	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → (((invg‘𝐺)‘𝑠)(+g‘𝐺)𝑠) = 0 )
20	19	oveq1d 7435	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → ((((invg‘𝐺)‘𝑠)(+g‘𝐺)𝑠)(+g‘𝐺)𝑢) = ( 0 (+g‘𝐺)𝑢))
21	17	subginvcl 19350	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑠 ∈ 𝑆) → ((invg‘𝐺)‘𝑠) ∈ 𝑆)
22	11, 7, 21	syl2anc 596	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → ((invg‘𝐺)‘𝑠) ∈ 𝑆)
23	14, 22	sseldd 3909	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → ((invg‘𝐺)‘𝑠) ∈ (Base‘𝐺))
24	2	ad2antrr 739	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑈 ∈ (SubGrp‘𝐺))
25	12	subgss 19342	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑈 ∈ (SubGrp‘𝐺) → 𝑈 ⊆ (Base‘𝐺))
26	24, 25	syl 18	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑈 ⊆ (Base‘𝐺))
27		simplrr 790	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑢 ∈ 𝑈)
28	26, 27	sseldd 3909	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑢 ∈ (Base‘𝐺))
29	12, 3	grpass 19158	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝐺 ∈ Grp ∧ (((invg‘𝐺)‘𝑠) ∈ (Base‘𝐺) ∧ 𝑠 ∈ (Base‘𝐺) ∧ 𝑢 ∈ (Base‘𝐺))) → ((((invg‘𝐺)‘𝑠)(+g‘𝐺)𝑠)(+g‘𝐺)𝑢) = (((invg‘𝐺)‘𝑠)(+g‘𝐺)(𝑠(+g‘𝐺)𝑢)))
30	10, 23, 15, 28, 29	syl13anc 1399	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → ((((invg‘𝐺)‘𝑠)(+g‘𝐺)𝑠)(+g‘𝐺)𝑢) = (((invg‘𝐺)‘𝑠)(+g‘𝐺)(𝑠(+g‘𝐺)𝑢)))
31	12, 3, 16	grplid 19183	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝐺 ∈ Grp ∧ 𝑢 ∈ (Base‘𝐺)) → ( 0 (+g‘𝐺)𝑢) = 𝑢)
32	10, 28, 31	syl2anc 596	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → ( 0 (+g‘𝐺)𝑢) = 𝑢)
33	20, 30, 32	3eqtr3d 2803	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → (((invg‘𝐺)‘𝑠)(+g‘𝐺)(𝑠(+g‘𝐺)𝑢)) = 𝑢)
34		lsmcntz.t	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝜑 → 𝑇 ∈ (SubGrp‘𝐺))
35	34	ad2antrr 739	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑇 ∈ (SubGrp‘𝐺))
36		simpr 490	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → (𝑠(+g‘𝐺)𝑢) ∈ 𝑇)
37	3, 4	lsmelvali 19869	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺)) ∧ (((invg‘𝐺)‘𝑠) ∈ 𝑆 ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇)) → (((invg‘𝐺)‘𝑠)(+g‘𝐺)(𝑠(+g‘𝐺)𝑢)) ∈ (𝑆 ⊕ 𝑇))
38	11, 35, 22, 36, 37	syl22anc 852	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → (((invg‘𝐺)‘𝑠)(+g‘𝐺)(𝑠(+g‘𝐺)𝑢)) ∈ (𝑆 ⊕ 𝑇))
39	33, 38	eqeltrrd 2861	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑢 ∈ (𝑆 ⊕ 𝑇))
40	39, 27	elind 4097	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑢 ∈ ((𝑆 ⊕ 𝑇) ∩ 𝑈))
41		lsmdisj.i	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → ((𝑆 ⊕ 𝑇) ∩ 𝑈) = { 0 })
42	41	ad2antrr 739	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → ((𝑆 ⊕ 𝑇) ∩ 𝑈) = { 0 })
43	40, 42	eleqtrd 2862	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑢 ∈ { 0 })
44		elsni 4597	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑢 ∈ { 0 } → 𝑢 = 0 )
45	43, 44	syl 18	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑢 = 0 )
46	45	oveq2d 7436	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → (𝑠(+g‘𝐺)𝑢) = (𝑠(+g‘𝐺) 0 ))
47	12, 3, 16	grprid 19184	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐺 ∈ Grp ∧ 𝑠 ∈ (Base‘𝐺)) → (𝑠(+g‘𝐺) 0 ) = 𝑠)
48	10, 15, 47	syl2anc 596	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → (𝑠(+g‘𝐺) 0 ) = 𝑠)
49	46, 48	eqtrd 2795	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → (𝑠(+g‘𝐺)𝑢) = 𝑠)
50	49, 36	eqeltrrd 2861	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑠 ∈ 𝑇)
51	7, 50	elind 4097	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑠 ∈ (𝑆 ∩ 𝑇))
52		lsmdisj2.i	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑆 ∩ 𝑇) = { 0 })
53	52	ad2antrr 739	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → (𝑆 ∩ 𝑇) = { 0 })
54	51, 53	eleqtrd 2862	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑠 ∈ { 0 })
55		elsni 4597	. . . . . . . . . . . 12 ⊢ (𝑠 ∈ { 0 } → 𝑠 = 0 )
56	54, 55	syl 18	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑠 = 0 )
57	56, 45	oveq12d 7438	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → (𝑠(+g‘𝐺)𝑢) = ( 0 (+g‘𝐺) 0 ))
58	12, 16	grpidcl 19181	. . . . . . . . . . . 12 ⊢ (𝐺 ∈ Grp → 0 ∈ (Base‘𝐺))
59	12, 3, 16	grplid 19183	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ Grp ∧ 0 ∈ (Base‘𝐺)) → ( 0 (+g‘𝐺) 0 ) = 0 )
60	9, 58, 59	syl2anc2 597	. . . . . . . . . . 11 ⊢ (𝜑 → ( 0 (+g‘𝐺) 0 ) = 0 )
61	60	ad2antrr 739	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → ( 0 (+g‘𝐺) 0 ) = 0 )
62	57, 61	eqtrd 2795	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → (𝑠(+g‘𝐺)𝑢) = 0 )
63	62	ex 418	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) → ((𝑠(+g‘𝐺)𝑢) ∈ 𝑇 → (𝑠(+g‘𝐺)𝑢) = 0 ))
64		eleq1 2848	. . . . . . . . 9 ⊢ (𝑥 = (𝑠(+g‘𝐺)𝑢) → (𝑥 ∈ 𝑇 ↔ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇))
65		eqeq1 2764	. . . . . . . . 9 ⊢ (𝑥 = (𝑠(+g‘𝐺)𝑢) → (𝑥 = 0 ↔ (𝑠(+g‘𝐺)𝑢) = 0 ))
66	64, 65	imbi12d 347	. . . . . . . 8 ⊢ (𝑥 = (𝑠(+g‘𝐺)𝑢) → ((𝑥 ∈ 𝑇 → 𝑥 = 0 ) ↔ ((𝑠(+g‘𝐺)𝑢) ∈ 𝑇 → (𝑠(+g‘𝐺)𝑢) = 0 )))
67	63, 66	syl5ibrcom 250	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) → (𝑥 = (𝑠(+g‘𝐺)𝑢) → (𝑥 ∈ 𝑇 → 𝑥 = 0 )))
68	67	rexlimdvva 3219	. . . . . 6 ⊢ (𝜑 → (∃𝑠 ∈ 𝑆 ∃𝑢 ∈ 𝑈 𝑥 = (𝑠(+g‘𝐺)𝑢) → (𝑥 ∈ 𝑇 → 𝑥 = 0 )))
69	6, 68	sylbid 243	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ (𝑆 ⊕ 𝑈) → (𝑥 ∈ 𝑇 → 𝑥 = 0 )))
70	69	impcomd 417	. . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝑇 ∧ 𝑥 ∈ (𝑆 ⊕ 𝑈)) → 𝑥 = 0 ))
71		elin 4093	. . . 4 ⊢ (𝑥 ∈ (𝑇 ∩ (𝑆 ⊕ 𝑈)) ↔ (𝑥 ∈ 𝑇 ∧ 𝑥 ∈ (𝑆 ⊕ 𝑈)))
72		velsn 4596	. . . 4 ⊢ (𝑥 ∈ { 0 } ↔ 𝑥 = 0 )
73	70, 71, 72	3imtr4g 299	. . 3 ⊢ (𝜑 → (𝑥 ∈ (𝑇 ∩ (𝑆 ⊕ 𝑈)) → 𝑥 ∈ { 0 }))
74	73	ssrdv 3914	. 2 ⊢ (𝜑 → (𝑇 ∩ (𝑆 ⊕ 𝑈)) ⊆ { 0 })
75	16	subg0cl 19349	. . . . 5 ⊢ (𝑇 ∈ (SubGrp‘𝐺) → 0 ∈ 𝑇)
76	34, 75	syl 18	. . . 4 ⊢ (𝜑 → 0 ∈ 𝑇)
77	4	lsmub1 19876	. . . . . 6 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → 𝑆 ⊆ (𝑆 ⊕ 𝑈))
78	1, 2, 77	syl2anc 596	. . . . 5 ⊢ (𝜑 → 𝑆 ⊆ (𝑆 ⊕ 𝑈))
79	16	subg0cl 19349	. . . . . 6 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 0 ∈ 𝑆)
80	1, 79	syl 18	. . . . 5 ⊢ (𝜑 → 0 ∈ 𝑆)
81	78, 80	sseldd 3909	. . . 4 ⊢ (𝜑 → 0 ∈ (𝑆 ⊕ 𝑈))
82	76, 81	elind 4097	. . 3 ⊢ (𝜑 → 0 ∈ (𝑇 ∩ (𝑆 ⊕ 𝑈)))
83	82	snssd 4743	. 2 ⊢ (𝜑 → { 0 } ⊆ (𝑇 ∩ (𝑆 ⊕ 𝑈)))
84	74, 83	eqssd 3925	1 ⊢ (𝜑 → (𝑇 ∩ (𝑆 ⊕ 𝑈)) = { 0 })

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∃wrex 3086   ⊆ wss 3895   ∩ cin 4089  {csn 4584  ‘cfv 6538  (class class class)co 7420  Basecbs 17392  +_gcplusg 17433  0_gc0g 17615  Grpcgrp 19149  inv_gcminusg 19150  SubGrpcsubg 19335  LSSumclsm 19853

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751  ax-cnex 11259  ax-resscn 11260  ax-1cn 11261  ax-icn 11262  ax-addcl 11263  ax-addrcl 11264  ax-mulcl 11265  ax-mulrcl 11266  ax-mulcom 11267  ax-addass 11268  ax-mulass 11269  ax-distr 11270  ax-i2m1 11271  ax-1ne0 11272  ax-1rid 11273  ax-rnegex 11274  ax-rrecex 11275  ax-cnre 11276  ax-pre-lttri 11277  ax-pre-lttrn 11278  ax-pre-ltadd 11279  ax-pre-mulgt0 11280

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-1st 8001  df-2nd 8002  df-frecs 8302  df-wrecs 8333  df-recs 8382  df-rdg 8421  df-er 8720  df-en 8977  df-dom 8978  df-sdom 8979  df-pnf 11348  df-mnf 11349  df-xr 11350  df-ltxr 11351  df-le 11352  df-sub 11546  df-neg 11547  df-nn 12339  df-2 12408  df-sets 17347  df-slot 17365  df-ndx 17377  df-base 17393  df-ress 17414  df-plusg 17446  df-0g 17617  df-mgm 18821  df-sgrp 18913  df-mnd 18929  df-submnd 18984  df-grp 19152  df-minusg 19153  df-subg 19338  df-lsm 19855

This theorem is used by:  lsmdisj3  19902  lsmdisj2r  19904  lsmdisj2a  19906  dprd2da  20263