Theorem lsmdisj2 19876

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 2761	. . . . . . . 8 ⊢ (+g‘𝐺) = (+g‘𝐺)
4		lsmcntz.p	. . . . . . . 8 ⊢ ⊕ = (LSSum‘𝐺)
5	3, 4	lsmelval 19843	. . . . . . 7 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → (𝑥 ∈ (𝑆 ⊕ 𝑈) ↔ ∃𝑠 ∈ 𝑆 ∃𝑢 ∈ 𝑈 𝑥 = (𝑠(+g‘𝐺)𝑢)))
6	1, 2, 5	syl2anc 596	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ (𝑆 ⊕ 𝑈) ↔ ∃𝑠 ∈ 𝑆 ∃𝑢 ∈ 𝑈 𝑥 = (𝑠(+g‘𝐺)𝑢)))
7		simplrl 789	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑠 ∈ 𝑆)
8		subgrcl 19321	. . . . . . . . . . . . . . . . . . . . . . . . . 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 2761	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (Base‘𝐺) = (Base‘𝐺)
13	12	subgss 19317	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺))
14	11, 13	syl 18	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑆 ⊆ (Base‘𝐺))
15	14, 7	sseldd 3932	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑠 ∈ (Base‘𝐺))
16		lsmdisj.o	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ 0 = (0g‘𝐺)
17		eqid 2761	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (invg‘𝐺) = (invg‘𝐺)
18	12, 3, 16, 17	grplinv 19180	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝐺 ∈ Grp ∧ 𝑠 ∈ (Base‘𝐺)) → (((invg‘𝐺)‘𝑠)(+g‘𝐺)𝑠) = 0 )
19	10, 15, 18	syl2anc 596	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → (((invg‘𝐺)‘𝑠)(+g‘𝐺)𝑠) = 0 )
20	19	oveq1d 7427	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → ((((invg‘𝐺)‘𝑠)(+g‘𝐺)𝑠)(+g‘𝐺)𝑢) = ( 0 (+g‘𝐺)𝑢))
21	17	subginvcl 19325	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑠 ∈ 𝑆) → ((invg‘𝐺)‘𝑠) ∈ 𝑆)
22	11, 7, 21	syl2anc 596	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → ((invg‘𝐺)‘𝑠) ∈ 𝑆)
23	14, 22	sseldd 3932	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → ((invg‘𝐺)‘𝑠) ∈ (Base‘𝐺))
24	2	ad2antrr 739	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑈 ∈ (SubGrp‘𝐺))
25	12	subgss 19317	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑈 ∈ (SubGrp‘𝐺) → 𝑈 ⊆ (Base‘𝐺))
26	24, 25	syl 18	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑈 ⊆ (Base‘𝐺))
27		simplrr 790	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑢 ∈ 𝑈)
28	26, 27	sseldd 3932	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑢 ∈ (Base‘𝐺))
29	12, 3	grpass 19133	. . . . . . . . . . . . . . . . . . . . . . 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 19158	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝐺 ∈ Grp ∧ 𝑢 ∈ (Base‘𝐺)) → ( 0 (+g‘𝐺)𝑢) = 𝑢)
32	10, 28, 31	syl2anc 596	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → ( 0 (+g‘𝐺)𝑢) = 𝑢)
33	20, 30, 32	3eqtr3d 2804	. . . . . . . . . . . . . . . . . . . . 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 19844	. . . . . . . . . . . . . . . . . . . . . 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 2862	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑢 ∈ (𝑆 ⊕ 𝑇))
40	39, 27	elind 4146	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑢 ∈ ((𝑆 ⊕ 𝑇) ∩ 𝑈))
41		lsmdisj.i	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → ((𝑆 ⊕ 𝑇) ∩ 𝑈) = { 0 })
42	41	ad2antrr 739	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → ((𝑆 ⊕ 𝑇) ∩ 𝑈) = { 0 })
43	40, 42	eleqtrd 2863	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑢 ∈ { 0 })
44		elsni 4601	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑢 ∈ { 0 } → 𝑢 = 0 )
45	43, 44	syl 18	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑢 = 0 )
46	45	oveq2d 7428	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → (𝑠(+g‘𝐺)𝑢) = (𝑠(+g‘𝐺) 0 ))
47	12, 3, 16	grprid 19159	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐺 ∈ Grp ∧ 𝑠 ∈ (Base‘𝐺)) → (𝑠(+g‘𝐺) 0 ) = 𝑠)
48	10, 15, 47	syl2anc 596	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → (𝑠(+g‘𝐺) 0 ) = 𝑠)
49	46, 48	eqtrd 2796	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → (𝑠(+g‘𝐺)𝑢) = 𝑠)
50	49, 36	eqeltrrd 2862	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑠 ∈ 𝑇)
51	7, 50	elind 4146	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑠 ∈ (𝑆 ∩ 𝑇))
52		lsmdisj2.i	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑆 ∩ 𝑇) = { 0 })
53	52	ad2antrr 739	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → (𝑆 ∩ 𝑇) = { 0 })
54	51, 53	eleqtrd 2863	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑠 ∈ { 0 })
55		elsni 4601	. . . . . . . . . . . 12 ⊢ (𝑠 ∈ { 0 } → 𝑠 = 0 )
56	54, 55	syl 18	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → 𝑠 = 0 )
57	56, 45	oveq12d 7430	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → (𝑠(+g‘𝐺)𝑢) = ( 0 (+g‘𝐺) 0 ))
58	12, 16	grpidcl 19156	. . . . . . . . . . . 12 ⊢ (𝐺 ∈ Grp → 0 ∈ (Base‘𝐺))
59	12, 3, 16	grplid 19158	. . . . . . . . . . . 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 2796	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) ∧ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇) → (𝑠(+g‘𝐺)𝑢) = 0 )
63	62	ex 418	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑠 ∈ 𝑆 ∧ 𝑢 ∈ 𝑈)) → ((𝑠(+g‘𝐺)𝑢) ∈ 𝑇 → (𝑠(+g‘𝐺)𝑢) = 0 ))
64		eleq1 2849	. . . . . . . . 9 ⊢ (𝑥 = (𝑠(+g‘𝐺)𝑢) → (𝑥 ∈ 𝑇 ↔ (𝑠(+g‘𝐺)𝑢) ∈ 𝑇))
65		eqeq1 2765	. . . . . . . . 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 3220	. . . . . 6 ⊢ (𝜑 → (∃𝑠 ∈ 𝑆 ∃𝑢 ∈ 𝑈 𝑥 = (𝑠(+g‘𝐺)𝑢) → (𝑥 ∈ 𝑇 → 𝑥 = 0 )))
69	6, 68	sylbid 243	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ (𝑆 ⊕ 𝑈) → (𝑥 ∈ 𝑇 → 𝑥 = 0 )))
70	69	impcomd 417	. . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝑇 ∧ 𝑥 ∈ (𝑆 ⊕ 𝑈)) → 𝑥 = 0 ))
71		elin 3915	. . . 4 ⊢ (𝑥 ∈ (𝑇 ∩ (𝑆 ⊕ 𝑈)) ↔ (𝑥 ∈ 𝑇 ∧ 𝑥 ∈ (𝑆 ⊕ 𝑈)))
72		velsn 4600	. . . 4 ⊢ (𝑥 ∈ { 0 } ↔ 𝑥 = 0 )
73	70, 71, 72	3imtr4g 299	. . 3 ⊢ (𝜑 → (𝑥 ∈ (𝑇 ∩ (𝑆 ⊕ 𝑈)) → 𝑥 ∈ { 0 }))
74	73	ssrdv 3937	. 2 ⊢ (𝜑 → (𝑇 ∩ (𝑆 ⊕ 𝑈)) ⊆ { 0 })
75	16	subg0cl 19324	. . . . 5 ⊢ (𝑇 ∈ (SubGrp‘𝐺) → 0 ∈ 𝑇)
76	34, 75	syl 18	. . . 4 ⊢ (𝜑 → 0 ∈ 𝑇)
77	4	lsmub1 19851	. . . . . 6 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → 𝑆 ⊆ (𝑆 ⊕ 𝑈))
78	1, 2, 77	syl2anc 596	. . . . 5 ⊢ (𝜑 → 𝑆 ⊆ (𝑆 ⊕ 𝑈))
79	16	subg0cl 19324	. . . . . 6 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 0 ∈ 𝑆)
80	1, 79	syl 18	. . . . 5 ⊢ (𝜑 → 0 ∈ 𝑆)
81	78, 80	sseldd 3932	. . . 4 ⊢ (𝜑 → 0 ∈ (𝑆 ⊕ 𝑈))
82	76, 81	elind 4146	. . 3 ⊢ (𝜑 → 0 ∈ (𝑇 ∩ (𝑆 ⊕ 𝑈)))
83	82	snssd 4747	. 2 ⊢ (𝜑 → { 0 } ⊆ (𝑇 ∩ (𝑆 ⊕ 𝑈)))
84	74, 83	eqssd 3948	1 ⊢ (𝜑 → (𝑇 ∩ (𝑆 ⊕ 𝑈)) = { 0 })

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∃wrex 3087   ∩ cin 3898   ⊆ wss 3899  {csn 4584  ‘cfv 6531  (class class class)co 7412  Basecbs 17367  +_gcplusg 17408  0_gc0g 17590  Grpcgrp 19124  inv_gcminusg 19125  SubGrpcsubg 19310  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-lsm 19830

This theorem is used by:  lsmdisj3  19877  lsmdisj2r  19879  lsmdisj2a  19881  dprd2da  20238