Theorem lcvexchlem4 33342

Description: Lemma for lcvexch 33344. (Contributed by NM, 10-Jan-2015.)

Hypotheses

Ref	Expression
lcvexch.s	⊢ 𝑆 = (LSubSp‘𝑊)
lcvexch.p	⊢ ⊕ = (LSSum‘𝑊)
lcvexch.c	⊢ 𝐶 = ( ⋖L ‘𝑊)
lcvexch.w	⊢ (𝜑 → 𝑊 ∈ LMod)
lcvexch.t	⊢ (𝜑 → 𝑇 ∈ 𝑆)
lcvexch.u	⊢ (𝜑 → 𝑈 ∈ 𝑆)
lcvexch.f	⊢ (𝜑 → 𝑇𝐶(𝑇 ⊕ 𝑈))

Assertion

Ref	Expression
lcvexchlem4	⊢ (𝜑 → (𝑇 ∩ 𝑈)𝐶𝑈)

Proof of Theorem lcvexchlem4

Dummy variables 𝑠 𝑟 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		lcvexch.s	. . . 4 ⊢ 𝑆 = (LSubSp‘𝑊)
2		lcvexch.c	. . . 4 ⊢ 𝐶 = ( ⋖L ‘𝑊)
3		lcvexch.w	. . . 4 ⊢ (𝜑 → 𝑊 ∈ LMod)
4		lcvexch.t	. . . 4 ⊢ (𝜑 → 𝑇 ∈ 𝑆)
5		lcvexch.u	. . . . 5 ⊢ (𝜑 → 𝑈 ∈ 𝑆)
6		lcvexch.p	. . . . . 6 ⊢ ⊕ = (LSSum‘𝑊)
7	1, 6	lsmcl 18904	. . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑇 ⊕ 𝑈) ∈ 𝑆)
8	3, 4, 5, 7	syl3anc 1318	. . . 4 ⊢ (𝜑 → (𝑇 ⊕ 𝑈) ∈ 𝑆)
9		lcvexch.f	. . . 4 ⊢ (𝜑 → 𝑇𝐶(𝑇 ⊕ 𝑈))
10	1, 2, 3, 4, 8, 9	lcvpss 33329	. . 3 ⊢ (𝜑 → 𝑇 ⊊ (𝑇 ⊕ 𝑈))
11	1, 6, 2, 3, 4, 5	lcvexchlem1 33339	. . 3 ⊢ (𝜑 → (𝑇 ⊊ (𝑇 ⊕ 𝑈) ↔ (𝑇 ∩ 𝑈) ⊊ 𝑈))
12	10, 11	mpbid 221	. 2 ⊢ (𝜑 → (𝑇 ∩ 𝑈) ⊊ 𝑈)
13	3	3ad2ant1 1075	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → 𝑊 ∈ LMod)
14	1	lsssssubg 18779	. . . . . . . . 9 ⊢ (𝑊 ∈ LMod → 𝑆 ⊆ (SubGrp‘𝑊))
15	13, 14	syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → 𝑆 ⊆ (SubGrp‘𝑊))
16		simp2 1055	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → 𝑠 ∈ 𝑆)
17	15, 16	sseldd 3569	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → 𝑠 ∈ (SubGrp‘𝑊))
18	4	3ad2ant1 1075	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → 𝑇 ∈ 𝑆)
19	15, 18	sseldd 3569	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → 𝑇 ∈ (SubGrp‘𝑊))
20	6	lsmub2 17895	. . . . . . 7 ⊢ ((𝑠 ∈ (SubGrp‘𝑊) ∧ 𝑇 ∈ (SubGrp‘𝑊)) → 𝑇 ⊆ (𝑠 ⊕ 𝑇))
21	17, 19, 20	syl2anc 691	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → 𝑇 ⊆ (𝑠 ⊕ 𝑇))
22	5	3ad2ant1 1075	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → 𝑈 ∈ 𝑆)
23	15, 22	sseldd 3569	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → 𝑈 ∈ (SubGrp‘𝑊))
24		simp3r 1083	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → 𝑠 ⊆ 𝑈)
25	6	lsmless1 17897	. . . . . . . 8 ⊢ ((𝑈 ∈ (SubGrp‘𝑊) ∧ 𝑇 ∈ (SubGrp‘𝑊) ∧ 𝑠 ⊆ 𝑈) → (𝑠 ⊕ 𝑇) ⊆ (𝑈 ⊕ 𝑇))
26	23, 19, 24, 25	syl3anc 1318	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → (𝑠 ⊕ 𝑇) ⊆ (𝑈 ⊕ 𝑇))
27		lmodabl 18733	. . . . . . . . . 10 ⊢ (𝑊 ∈ LMod → 𝑊 ∈ Abel)
28	3, 27	syl 17	. . . . . . . . 9 ⊢ (𝜑 → 𝑊 ∈ Abel)
29	3, 14	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝑆 ⊆ (SubGrp‘𝑊))
30	29, 4	sseldd 3569	. . . . . . . . 9 ⊢ (𝜑 → 𝑇 ∈ (SubGrp‘𝑊))
31	29, 5	sseldd 3569	. . . . . . . . 9 ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝑊))
32	6	lsmcom 18084	. . . . . . . . 9 ⊢ ((𝑊 ∈ Abel ∧ 𝑇 ∈ (SubGrp‘𝑊) ∧ 𝑈 ∈ (SubGrp‘𝑊)) → (𝑇 ⊕ 𝑈) = (𝑈 ⊕ 𝑇))
33	28, 30, 31, 32	syl3anc 1318	. . . . . . . 8 ⊢ (𝜑 → (𝑇 ⊕ 𝑈) = (𝑈 ⊕ 𝑇))
34	33	3ad2ant1 1075	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → (𝑇 ⊕ 𝑈) = (𝑈 ⊕ 𝑇))
35	26, 34	sseqtr4d 3605	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → (𝑠 ⊕ 𝑇) ⊆ (𝑇 ⊕ 𝑈))
36	9	3ad2ant1 1075	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → 𝑇𝐶(𝑇 ⊕ 𝑈))
37	1, 2, 3, 4, 8	lcvbr3 33328	. . . . . . . . . 10 ⊢ (𝜑 → (𝑇𝐶(𝑇 ⊕ 𝑈) ↔ (𝑇 ⊊ (𝑇 ⊕ 𝑈) ∧ ∀𝑟 ∈ 𝑆 ((𝑇 ⊆ 𝑟 ∧ 𝑟 ⊆ (𝑇 ⊕ 𝑈)) → (𝑟 = 𝑇 ∨ 𝑟 = (𝑇 ⊕ 𝑈))))))
38	37	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆) → (𝑇𝐶(𝑇 ⊕ 𝑈) ↔ (𝑇 ⊊ (𝑇 ⊕ 𝑈) ∧ ∀𝑟 ∈ 𝑆 ((𝑇 ⊆ 𝑟 ∧ 𝑟 ⊆ (𝑇 ⊕ 𝑈)) → (𝑟 = 𝑇 ∨ 𝑟 = (𝑇 ⊕ 𝑈))))))
39	3	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆) → 𝑊 ∈ LMod)
40		simpr 476	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆) → 𝑠 ∈ 𝑆)
41	4	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆) → 𝑇 ∈ 𝑆)
42	1, 6	lsmcl 18904	. . . . . . . . . . . 12 ⊢ ((𝑊 ∈ LMod ∧ 𝑠 ∈ 𝑆 ∧ 𝑇 ∈ 𝑆) → (𝑠 ⊕ 𝑇) ∈ 𝑆)
43	39, 40, 41, 42	syl3anc 1318	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆) → (𝑠 ⊕ 𝑇) ∈ 𝑆)
44		sseq2 3590	. . . . . . . . . . . . . 14 ⊢ (𝑟 = (𝑠 ⊕ 𝑇) → (𝑇 ⊆ 𝑟 ↔ 𝑇 ⊆ (𝑠 ⊕ 𝑇)))
45		sseq1 3589	. . . . . . . . . . . . . 14 ⊢ (𝑟 = (𝑠 ⊕ 𝑇) → (𝑟 ⊆ (𝑇 ⊕ 𝑈) ↔ (𝑠 ⊕ 𝑇) ⊆ (𝑇 ⊕ 𝑈)))
46	44, 45	anbi12d 743	. . . . . . . . . . . . 13 ⊢ (𝑟 = (𝑠 ⊕ 𝑇) → ((𝑇 ⊆ 𝑟 ∧ 𝑟 ⊆ (𝑇 ⊕ 𝑈)) ↔ (𝑇 ⊆ (𝑠 ⊕ 𝑇) ∧ (𝑠 ⊕ 𝑇) ⊆ (𝑇 ⊕ 𝑈))))
47		eqeq1 2614	. . . . . . . . . . . . . 14 ⊢ (𝑟 = (𝑠 ⊕ 𝑇) → (𝑟 = 𝑇 ↔ (𝑠 ⊕ 𝑇) = 𝑇))
48		eqeq1 2614	. . . . . . . . . . . . . 14 ⊢ (𝑟 = (𝑠 ⊕ 𝑇) → (𝑟 = (𝑇 ⊕ 𝑈) ↔ (𝑠 ⊕ 𝑇) = (𝑇 ⊕ 𝑈)))
49	47, 48	orbi12d 742	. . . . . . . . . . . . 13 ⊢ (𝑟 = (𝑠 ⊕ 𝑇) → ((𝑟 = 𝑇 ∨ 𝑟 = (𝑇 ⊕ 𝑈)) ↔ ((𝑠 ⊕ 𝑇) = 𝑇 ∨ (𝑠 ⊕ 𝑇) = (𝑇 ⊕ 𝑈))))
50	46, 49	imbi12d 333	. . . . . . . . . . . 12 ⊢ (𝑟 = (𝑠 ⊕ 𝑇) → (((𝑇 ⊆ 𝑟 ∧ 𝑟 ⊆ (𝑇 ⊕ 𝑈)) → (𝑟 = 𝑇 ∨ 𝑟 = (𝑇 ⊕ 𝑈))) ↔ ((𝑇 ⊆ (𝑠 ⊕ 𝑇) ∧ (𝑠 ⊕ 𝑇) ⊆ (𝑇 ⊕ 𝑈)) → ((𝑠 ⊕ 𝑇) = 𝑇 ∨ (𝑠 ⊕ 𝑇) = (𝑇 ⊕ 𝑈)))))
51	50	rspcv 3278	. . . . . . . . . . 11 ⊢ ((𝑠 ⊕ 𝑇) ∈ 𝑆 → (∀𝑟 ∈ 𝑆 ((𝑇 ⊆ 𝑟 ∧ 𝑟 ⊆ (𝑇 ⊕ 𝑈)) → (𝑟 = 𝑇 ∨ 𝑟 = (𝑇 ⊕ 𝑈))) → ((𝑇 ⊆ (𝑠 ⊕ 𝑇) ∧ (𝑠 ⊕ 𝑇) ⊆ (𝑇 ⊕ 𝑈)) → ((𝑠 ⊕ 𝑇) = 𝑇 ∨ (𝑠 ⊕ 𝑇) = (𝑇 ⊕ 𝑈)))))
52	43, 51	syl 17	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆) → (∀𝑟 ∈ 𝑆 ((𝑇 ⊆ 𝑟 ∧ 𝑟 ⊆ (𝑇 ⊕ 𝑈)) → (𝑟 = 𝑇 ∨ 𝑟 = (𝑇 ⊕ 𝑈))) → ((𝑇 ⊆ (𝑠 ⊕ 𝑇) ∧ (𝑠 ⊕ 𝑇) ⊆ (𝑇 ⊕ 𝑈)) → ((𝑠 ⊕ 𝑇) = 𝑇 ∨ (𝑠 ⊕ 𝑇) = (𝑇 ⊕ 𝑈)))))
53	52	adantld 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆) → ((𝑇 ⊊ (𝑇 ⊕ 𝑈) ∧ ∀𝑟 ∈ 𝑆 ((𝑇 ⊆ 𝑟 ∧ 𝑟 ⊆ (𝑇 ⊕ 𝑈)) → (𝑟 = 𝑇 ∨ 𝑟 = (𝑇 ⊕ 𝑈)))) → ((𝑇 ⊆ (𝑠 ⊕ 𝑇) ∧ (𝑠 ⊕ 𝑇) ⊆ (𝑇 ⊕ 𝑈)) → ((𝑠 ⊕ 𝑇) = 𝑇 ∨ (𝑠 ⊕ 𝑇) = (𝑇 ⊕ 𝑈)))))
54	38, 53	sylbid 229	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆) → (𝑇𝐶(𝑇 ⊕ 𝑈) → ((𝑇 ⊆ (𝑠 ⊕ 𝑇) ∧ (𝑠 ⊕ 𝑇) ⊆ (𝑇 ⊕ 𝑈)) → ((𝑠 ⊕ 𝑇) = 𝑇 ∨ (𝑠 ⊕ 𝑇) = (𝑇 ⊕ 𝑈)))))
55	54	3adant3 1074	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → (𝑇𝐶(𝑇 ⊕ 𝑈) → ((𝑇 ⊆ (𝑠 ⊕ 𝑇) ∧ (𝑠 ⊕ 𝑇) ⊆ (𝑇 ⊕ 𝑈)) → ((𝑠 ⊕ 𝑇) = 𝑇 ∨ (𝑠 ⊕ 𝑇) = (𝑇 ⊕ 𝑈)))))
56	36, 55	mpd 15	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → ((𝑇 ⊆ (𝑠 ⊕ 𝑇) ∧ (𝑠 ⊕ 𝑇) ⊆ (𝑇 ⊕ 𝑈)) → ((𝑠 ⊕ 𝑇) = 𝑇 ∨ (𝑠 ⊕ 𝑇) = (𝑇 ⊕ 𝑈))))
57	21, 35, 56	mp2and 711	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → ((𝑠 ⊕ 𝑇) = 𝑇 ∨ (𝑠 ⊕ 𝑇) = (𝑇 ⊕ 𝑈)))
58		ineq1 3769	. . . . . . 7 ⊢ ((𝑠 ⊕ 𝑇) = 𝑇 → ((𝑠 ⊕ 𝑇) ∩ 𝑈) = (𝑇 ∩ 𝑈))
59		simp3l 1082	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → (𝑇 ∩ 𝑈) ⊆ 𝑠)
60	1, 6, 2, 13, 18, 22, 16, 59, 24	lcvexchlem2 33340	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → ((𝑠 ⊕ 𝑇) ∩ 𝑈) = 𝑠)
61	60	eqeq1d 2612	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → (((𝑠 ⊕ 𝑇) ∩ 𝑈) = (𝑇 ∩ 𝑈) ↔ 𝑠 = (𝑇 ∩ 𝑈)))
62	58, 61	syl5ib 233	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → ((𝑠 ⊕ 𝑇) = 𝑇 → 𝑠 = (𝑇 ∩ 𝑈)))
63		ineq1 3769	. . . . . . 7 ⊢ ((𝑠 ⊕ 𝑇) = (𝑇 ⊕ 𝑈) → ((𝑠 ⊕ 𝑇) ∩ 𝑈) = ((𝑇 ⊕ 𝑈) ∩ 𝑈))
64	6	lsmub2 17895	. . . . . . . . . 10 ⊢ ((𝑇 ∈ (SubGrp‘𝑊) ∧ 𝑈 ∈ (SubGrp‘𝑊)) → 𝑈 ⊆ (𝑇 ⊕ 𝑈))
65	19, 23, 64	syl2anc 691	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → 𝑈 ⊆ (𝑇 ⊕ 𝑈))
66		sseqin2 3779	. . . . . . . . 9 ⊢ (𝑈 ⊆ (𝑇 ⊕ 𝑈) ↔ ((𝑇 ⊕ 𝑈) ∩ 𝑈) = 𝑈)
67	65, 66	sylib 207	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → ((𝑇 ⊕ 𝑈) ∩ 𝑈) = 𝑈)
68	60, 67	eqeq12d 2625	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → (((𝑠 ⊕ 𝑇) ∩ 𝑈) = ((𝑇 ⊕ 𝑈) ∩ 𝑈) ↔ 𝑠 = 𝑈))
69	63, 68	syl5ib 233	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → ((𝑠 ⊕ 𝑇) = (𝑇 ⊕ 𝑈) → 𝑠 = 𝑈))
70	62, 69	orim12d 879	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → (((𝑠 ⊕ 𝑇) = 𝑇 ∨ (𝑠 ⊕ 𝑇) = (𝑇 ⊕ 𝑈)) → (𝑠 = (𝑇 ∩ 𝑈) ∨ 𝑠 = 𝑈)))
71	57, 70	mpd 15	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → (𝑠 = (𝑇 ∩ 𝑈) ∨ 𝑠 = 𝑈))
72	71	3exp 1256	. . 3 ⊢ (𝜑 → (𝑠 ∈ 𝑆 → (((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈) → (𝑠 = (𝑇 ∩ 𝑈) ∨ 𝑠 = 𝑈))))
73	72	ralrimiv 2948	. 2 ⊢ (𝜑 → ∀𝑠 ∈ 𝑆 (((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈) → (𝑠 = (𝑇 ∩ 𝑈) ∨ 𝑠 = 𝑈)))
74	1	lssincl 18786	. . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑇 ∩ 𝑈) ∈ 𝑆)
75	3, 4, 5, 74	syl3anc 1318	. . 3 ⊢ (𝜑 → (𝑇 ∩ 𝑈) ∈ 𝑆)
76	1, 2, 3, 75, 5	lcvbr3 33328	. 2 ⊢ (𝜑 → ((𝑇 ∩ 𝑈)𝐶𝑈 ↔ ((𝑇 ∩ 𝑈) ⊊ 𝑈 ∧ ∀𝑠 ∈ 𝑆 (((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈) → (𝑠 = (𝑇 ∩ 𝑈) ∨ 𝑠 = 𝑈)))))
77	12, 73, 76	mpbir2and 959	1 ⊢ (𝜑 → (𝑇 ∩ 𝑈)𝐶𝑈)

Syntax hints:   → wi 4   ↔ wb 195   ∨ wo 382   ∧ wa 383   ∧ w3a 1031   = wceq 1475   ∈ wcel 1977  ∀wral 2896   ∩ cin 3539   ⊆ wss 3540   ⊊ wpss 3541   class class class wbr 4583  ‘cfv 5804  (class class class)co 6549  SubGrpcsubg 17411  LSSumclsm 17872  Abelcabl 18017  LModclmod 18686  LSubSpclss 18753   ⋖_L clcv 33323

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-iin 4458  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-oadd 7451  df-er 7629  df-en 7842  df-dom 7843  df-sdom 7844  df-fin 7845  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-nn 10898  df-2 10956  df-ndx 15698  df-slot 15699  df-base 15700  df-sets 15701  df-ress 15702  df-plusg 15781  df-0g 15925  df-mre 16069  df-mrc 16070  df-acs 16072  df-mgm 17065  df-sgrp 17107  df-mnd 17118  df-submnd 17159  df-grp 17248  df-minusg 17249  df-sbg 17250  df-subg 17414  df-cntz 17573  df-lsm 17874  df-cmn 18018  df-abl 18019  df-mgp 18313  df-ur 18325  df-ring 18372  df-lmod 18688  df-lss 18754  df-lcv 33324

This theorem is referenced by:  lcvexch  33344  lsatcvat3  33357