lsatcvat3 - Mathbox for Norm Megill

	Mathbox for Norm Megill		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > lsatcvat3		Structured version Visualization version GIF version

Theorem lsatcvat3 40246

Description: A condition implying that a certain subspace is an atom. Part of Lemma 3.2.20 of [PtakPulmannova] p. 68. (atcvat3i 33007 analog.) (Contributed by NM, 11-Jan-2015.)

**Hypotheses**
Ref	Expression
lsatcvat3.s	⊢ 𝑆 = (LSubSp‘𝑊)
lsatcvat3.p	⊢ ⊕ = (LSSum‘𝑊)
lsatcvat3.a	⊢ 𝐴 = (LSAtoms‘𝑊)
lsatcvat3.w	⊢ (𝜑 → 𝑊 ∈ LVec)
lsatcvat3.u	⊢ (𝜑 → 𝑈 ∈ 𝑆)
lsatcvat3.q	⊢ (𝜑 → 𝑄 ∈ 𝐴)
lsatcvat3.r	⊢ (𝜑 → 𝑅 ∈ 𝐴)
lsatcvat3.n	⊢ (𝜑 → 𝑄 ≠ 𝑅)
lsatcvat3.m	⊢ (𝜑 → ¬ 𝑅 ⊆ 𝑈)
lsatcvat3.l	⊢ (𝜑 → 𝑄 ⊆ (𝑈 ⊕ 𝑅))

**Assertion**
Ref	Expression
lsatcvat3	⊢ (𝜑 → (𝑈 ∩ (𝑄 ⊕ 𝑅)) ∈ 𝐴)

**Proof of Theorem lsatcvat3**
Step	Hyp	Ref	Expression
1		lsatcvat3.s	. 2 ⊢ 𝑆 = (LSubSp‘𝑊)
2		lsatcvat3.p	. 2 ⊢ ⊕ = (LSSum‘𝑊)
3		lsatcvat3.a	. 2 ⊢ 𝐴 = (LSAtoms‘𝑊)
4		eqid 2760	. 2 ⊢ ( ⋖_L ‘𝑊) = ( ⋖_L ‘𝑊)
5		lsatcvat3.w	. 2 ⊢ (𝜑 → 𝑊 ∈ LVec)
6		lveclmod 21390	. . . 4 ⊢ (𝑊 ∈ LVec → 𝑊 ∈ LMod)
7	5, 6	syl 18	. . 3 ⊢ (𝜑 → 𝑊 ∈ LMod)
8		lsatcvat3.u	. . 3 ⊢ (𝜑 → 𝑈 ∈ 𝑆)
9		lsatcvat3.q	. . . . 5 ⊢ (𝜑 → 𝑄 ∈ 𝐴)
10	1, 3, 7, 9	lsatlssel 40191	. . . 4 ⊢ (𝜑 → 𝑄 ∈ 𝑆)
11		lsatcvat3.r	. . . . 5 ⊢ (𝜑 → 𝑅 ∈ 𝐴)
12	1, 3, 7, 11	lsatlssel 40191	. . . 4 ⊢ (𝜑 → 𝑅 ∈ 𝑆)
13	1, 2	lsmcl 21367	. . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑄 ∈ 𝑆 ∧ 𝑅 ∈ 𝑆) → (𝑄 ⊕ 𝑅) ∈ 𝑆)
14	7, 10, 12, 13	syl3anc 1398	. . 3 ⊢ (𝜑 → (𝑄 ⊕ 𝑅) ∈ 𝑆)
15	1	lssincl 21249	. . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆 ∧ (𝑄 ⊕ 𝑅) ∈ 𝑆) → (𝑈 ∩ (𝑄 ⊕ 𝑅)) ∈ 𝑆)
16	7, 8, 14, 15	syl3anc 1398	. 2 ⊢ (𝜑 → (𝑈 ∩ (𝑄 ⊕ 𝑅)) ∈ 𝑆)
17		lsatcvat3.n	. 2 ⊢ (𝜑 → 𝑄 ≠ 𝑅)
18		lsatcvat3.m	. . . . 5 ⊢ (𝜑 → ¬ 𝑅 ⊆ 𝑈)
19	1, 2, 3, 4, 5, 8, 11	lcv1 40235	. . . . 5 ⊢ (𝜑 → (¬ 𝑅 ⊆ 𝑈 ↔ 𝑈( ⋖_L ‘𝑊)(𝑈 ⊕ 𝑅)))
20	18, 19	mpbid 235	. . . 4 ⊢ (𝜑 → 𝑈( ⋖_L ‘𝑊)(𝑈 ⊕ 𝑅))
21		lmodabl 21193	. . . . . . . . . . 11 ⊢ (𝑊 ∈ LMod → 𝑊 ∈ Abel)
22	7, 21	syl 18	. . . . . . . . . 10 ⊢ (𝜑 → 𝑊 ∈ Abel)
23	1	lsssssubg 21242	. . . . . . . . . . . 12 ⊢ (𝑊 ∈ LMod → 𝑆 ⊆ (SubGrp‘𝑊))
24	7, 23	syl 18	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑆 ⊆ (SubGrp‘𝑊))
25	24, 10	sseldd 3910	. . . . . . . . . 10 ⊢ (𝜑 → 𝑄 ∈ (SubGrp‘𝑊))
26	24, 12	sseldd 3910	. . . . . . . . . 10 ⊢ (𝜑 → 𝑅 ∈ (SubGrp‘𝑊))
27	2	lsmcom 20081	. . . . . . . . . 10 ⊢ ((𝑊 ∈ Abel ∧ 𝑄 ∈ (SubGrp‘𝑊) ∧ 𝑅 ∈ (SubGrp‘𝑊)) → (𝑄 ⊕ 𝑅) = (𝑅 ⊕ 𝑄))
28	22, 25, 26, 27	syl3anc 1398	. . . . . . . . 9 ⊢ (𝜑 → (𝑄 ⊕ 𝑅) = (𝑅 ⊕ 𝑄))
29	28	oveq2d 7440	. . . . . . . 8 ⊢ (𝜑 → (𝑈 ⊕ (𝑄 ⊕ 𝑅)) = (𝑈 ⊕ (𝑅 ⊕ 𝑄)))
30	24, 8	sseldd 3910	. . . . . . . . 9 ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝑊))
31	2	lsmass 19892	. . . . . . . . 9 ⊢ ((𝑈 ∈ (SubGrp‘𝑊) ∧ 𝑅 ∈ (SubGrp‘𝑊) ∧ 𝑄 ∈ (SubGrp‘𝑊)) → ((𝑈 ⊕ 𝑅) ⊕ 𝑄) = (𝑈 ⊕ (𝑅 ⊕ 𝑄)))
32	30, 26, 25, 31	syl3anc 1398	. . . . . . . 8 ⊢ (𝜑 → ((𝑈 ⊕ 𝑅) ⊕ 𝑄) = (𝑈 ⊕ (𝑅 ⊕ 𝑄)))
33	29, 32	eqtr4d 2798	. . . . . . 7 ⊢ (𝜑 → (𝑈 ⊕ (𝑄 ⊕ 𝑅)) = ((𝑈 ⊕ 𝑅) ⊕ 𝑄))
34	1, 2	lsmcl 21367	. . . . . . . . . 10 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆 ∧ 𝑅 ∈ 𝑆) → (𝑈 ⊕ 𝑅) ∈ 𝑆)
35	7, 8, 12, 34	syl3anc 1398	. . . . . . . . 9 ⊢ (𝜑 → (𝑈 ⊕ 𝑅) ∈ 𝑆)
36	24, 35	sseldd 3910	. . . . . . . 8 ⊢ (𝜑 → (𝑈 ⊕ 𝑅) ∈ (SubGrp‘𝑊))
37		lsatcvat3.l	. . . . . . . 8 ⊢ (𝜑 → 𝑄 ⊆ (𝑈 ⊕ 𝑅))
38	2	lsmless2 19884	. . . . . . . 8 ⊢ (((𝑈 ⊕ 𝑅) ∈ (SubGrp‘𝑊) ∧ (𝑈 ⊕ 𝑅) ∈ (SubGrp‘𝑊) ∧ 𝑄 ⊆ (𝑈 ⊕ 𝑅)) → ((𝑈 ⊕ 𝑅) ⊕ 𝑄) ⊆ ((𝑈 ⊕ 𝑅) ⊕ (𝑈 ⊕ 𝑅)))
39	36, 36, 37, 38	syl3anc 1398	. . . . . . 7 ⊢ (𝜑 → ((𝑈 ⊕ 𝑅) ⊕ 𝑄) ⊆ ((𝑈 ⊕ 𝑅) ⊕ (𝑈 ⊕ 𝑅)))
40	33, 39	eqsstrd 3943	. . . . . 6 ⊢ (𝜑 → (𝑈 ⊕ (𝑄 ⊕ 𝑅)) ⊆ ((𝑈 ⊕ 𝑅) ⊕ (𝑈 ⊕ 𝑅)))
41	2	lsmidm 19886	. . . . . . 7 ⊢ ((𝑈 ⊕ 𝑅) ∈ (SubGrp‘𝑊) → ((𝑈 ⊕ 𝑅) ⊕ (𝑈 ⊕ 𝑅)) = (𝑈 ⊕ 𝑅))
42	36, 41	syl 18	. . . . . 6 ⊢ (𝜑 → ((𝑈 ⊕ 𝑅) ⊕ (𝑈 ⊕ 𝑅)) = (𝑈 ⊕ 𝑅))
43	40, 42	sseqtrd 3945	. . . . 5 ⊢ (𝜑 → (𝑈 ⊕ (𝑄 ⊕ 𝑅)) ⊆ (𝑈 ⊕ 𝑅))
44	24, 14	sseldd 3910	. . . . . 6 ⊢ (𝜑 → (𝑄 ⊕ 𝑅) ∈ (SubGrp‘𝑊))
45	2	lsmub2 19881	. . . . . . 7 ⊢ ((𝑄 ∈ (SubGrp‘𝑊) ∧ 𝑅 ∈ (SubGrp‘𝑊)) → 𝑅 ⊆ (𝑄 ⊕ 𝑅))
46	25, 26, 45	syl2anc 596	. . . . . 6 ⊢ (𝜑 → 𝑅 ⊆ (𝑄 ⊕ 𝑅))
47	2	lsmless2 19884	. . . . . 6 ⊢ ((𝑈 ∈ (SubGrp‘𝑊) ∧ (𝑄 ⊕ 𝑅) ∈ (SubGrp‘𝑊) ∧ 𝑅 ⊆ (𝑄 ⊕ 𝑅)) → (𝑈 ⊕ 𝑅) ⊆ (𝑈 ⊕ (𝑄 ⊕ 𝑅)))
48	30, 44, 46, 47	syl3anc 1398	. . . . 5 ⊢ (𝜑 → (𝑈 ⊕ 𝑅) ⊆ (𝑈 ⊕ (𝑄 ⊕ 𝑅)))
49	43, 48	eqssd 3926	. . . 4 ⊢ (𝜑 → (𝑈 ⊕ (𝑄 ⊕ 𝑅)) = (𝑈 ⊕ 𝑅))
50	20, 49	breqtrrd 5132	. . 3 ⊢ (𝜑 → 𝑈( ⋖_L ‘𝑊)(𝑈 ⊕ (𝑄 ⊕ 𝑅)))
51	1, 2, 4, 7, 8, 14, 50	lcvexchlem4 40231	. 2 ⊢ (𝜑 → (𝑈 ∩ (𝑄 ⊕ 𝑅))( ⋖_L ‘𝑊)(𝑄 ⊕ 𝑅))
52	1, 2, 3, 4, 5, 16, 9, 11, 17, 51	lsatcvat2 40245	1 ⊢ (𝜑 → (𝑈 ∩ (𝑄 ⊕ 𝑅)) ∈ 𝐴)

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 ⊆ wss 3896 ∩ cin 4088 class class class wbr 5102 ‘cfv 6543 (class class class)co 7424 SubGrpcsubg 19339 LSSumclsm 19857 Abelcabl 20004 LModclmod 21144 LSubSpclss 21215 LVecclvec 21386 LSAtomsclsa 40168 ⋖_L clcv 40212

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 5327 ax-pr 5391 ax-un 7755 ax-cnex 11263 ax-resscn 11264 ax-1cn 11265 ax-icn 11266 ax-addcl 11267 ax-addrcl 11268 ax-mulcl 11269 ax-mulrcl 11270 ax-mulcom 11271 ax-addass 11272 ax-mulass 11273 ax-distr 11274 ax-i2m1 11275 ax-1ne0 11276 ax-1rid 11277 ax-rnegex 11278 ax-rrecex 11279 ax-cnre 11280 ax-pre-lttri 11281 ax-pre-lttrn 11282 ax-pre-ltadd 11283 ax-pre-mulgt0 11284

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 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-iin 4953 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 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 6307 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7381 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7882 df-1st 8005 df-2nd 8006 df-tpos 8251 df-frecs 8307 df-wrecs 8338 df-recs 8387 df-rdg 8426 df-1o 8484 df-2o 8485 df-er 8725 df-en 8982 df-dom 8983 df-sdom 8984 df-fin 8985 df-pnf 11352 df-mnf 11353 df-xr 11354 df-ltxr 11355 df-le 11356 df-sub 11550 df-neg 11551 df-nn 12343 df-2 12412 df-3 12413 df-sets 17351 df-slot 17369 df-ndx 17381 df-base 17397 df-ress 17418 df-plusg 17450 df-mulr 17451 df-0g 17621 df-mre 17765 df-mrc 17766 df-acs 17768 df-mgm 18825 df-sgrp 18917 df-mnd 18933 df-submnd 18988 df-grp 19156 df-minusg 19157 df-sbg 19158 df-subg 19342 df-cntz 19540 df-oppg 19569 df-lsm 19859 df-cmn 20005 df-abl 20006 df-mgp 20370 df-rng 20384 df-ur 20417 df-ring 20470 df-oppr 20576 df-dvdsr 20596 df-unit 20597 df-invr 20627 df-drng 20991 df-lmod 21146 df-lss 21216 df-lsp 21256 df-lvec 21387 df-lsatoms 40170 df-lcv 40213

This theorem is used by: l1cvat 40249

W3C validator