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 39251

Description: A condition implying that a certain subspace is an atom. Part of Lemma 3.2.20 of [PtakPulmannova] p. 68. (atcvat3i 32420 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 2734	. 2 ⊢ ( ⋖_L ‘𝑊) = ( ⋖_L ‘𝑊)
5		lsatcvat3.w	. 2 ⊢ (𝜑 → 𝑊 ∈ LVec)
6		lveclmod 21056	. . . 4 ⊢ (𝑊 ∈ LVec → 𝑊 ∈ LMod)
7	5, 6	syl 17	. . 3 ⊢ (𝜑 → 𝑊 ∈ LMod)
8		lsatcvat3.u	. . 3 ⊢ (𝜑 → 𝑈 ∈ 𝑆)
9		lsatcvat3.q	. . . . 5 ⊢ (𝜑 → 𝑄 ∈ 𝐴)
10	1, 3, 7, 9	lsatlssel 39196	. . . 4 ⊢ (𝜑 → 𝑄 ∈ 𝑆)
11		lsatcvat3.r	. . . . 5 ⊢ (𝜑 → 𝑅 ∈ 𝐴)
12	1, 3, 7, 11	lsatlssel 39196	. . . 4 ⊢ (𝜑 → 𝑅 ∈ 𝑆)
13	1, 2	lsmcl 21033	. . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑄 ∈ 𝑆 ∧ 𝑅 ∈ 𝑆) → (𝑄 ⊕ 𝑅) ∈ 𝑆)
14	7, 10, 12, 13	syl3anc 1373	. . 3 ⊢ (𝜑 → (𝑄 ⊕ 𝑅) ∈ 𝑆)
15	1	lssincl 20914	. . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆 ∧ (𝑄 ⊕ 𝑅) ∈ 𝑆) → (𝑈 ∩ (𝑄 ⊕ 𝑅)) ∈ 𝑆)
16	7, 8, 14, 15	syl3anc 1373	. 2 ⊢ (𝜑 → (𝑈 ∩ (𝑄 ⊕ 𝑅)) ∈ 𝑆)
17		lsatcvat3.n	. 2 ⊢ (𝜑 → 𝑄 ≠ 𝑅)
18		lsatcvat3.m	. . . . 5 ⊢ (𝜑 → ¬ 𝑅 ⊆ 𝑈)
19	1, 2, 3, 4, 5, 8, 11	lcv1 39240	. . . . 5 ⊢ (𝜑 → (¬ 𝑅 ⊆ 𝑈 ↔ 𝑈( ⋖_L ‘𝑊)(𝑈 ⊕ 𝑅)))
20	18, 19	mpbid 232	. . . 4 ⊢ (𝜑 → 𝑈( ⋖_L ‘𝑊)(𝑈 ⊕ 𝑅))
21		lmodabl 20858	. . . . . . . . . . 11 ⊢ (𝑊 ∈ LMod → 𝑊 ∈ Abel)
22	7, 21	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝑊 ∈ Abel)
23	1	lsssssubg 20907	. . . . . . . . . . . 12 ⊢ (𝑊 ∈ LMod → 𝑆 ⊆ (SubGrp‘𝑊))
24	7, 23	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑆 ⊆ (SubGrp‘𝑊))
25	24, 10	sseldd 3932	. . . . . . . . . 10 ⊢ (𝜑 → 𝑄 ∈ (SubGrp‘𝑊))
26	24, 12	sseldd 3932	. . . . . . . . . 10 ⊢ (𝜑 → 𝑅 ∈ (SubGrp‘𝑊))
27	2	lsmcom 19785	. . . . . . . . . 10 ⊢ ((𝑊 ∈ Abel ∧ 𝑄 ∈ (SubGrp‘𝑊) ∧ 𝑅 ∈ (SubGrp‘𝑊)) → (𝑄 ⊕ 𝑅) = (𝑅 ⊕ 𝑄))
28	22, 25, 26, 27	syl3anc 1373	. . . . . . . . 9 ⊢ (𝜑 → (𝑄 ⊕ 𝑅) = (𝑅 ⊕ 𝑄))
29	28	oveq2d 7372	. . . . . . . 8 ⊢ (𝜑 → (𝑈 ⊕ (𝑄 ⊕ 𝑅)) = (𝑈 ⊕ (𝑅 ⊕ 𝑄)))
30	24, 8	sseldd 3932	. . . . . . . . 9 ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝑊))
31	2	lsmass 19596	. . . . . . . . 9 ⊢ ((𝑈 ∈ (SubGrp‘𝑊) ∧ 𝑅 ∈ (SubGrp‘𝑊) ∧ 𝑄 ∈ (SubGrp‘𝑊)) → ((𝑈 ⊕ 𝑅) ⊕ 𝑄) = (𝑈 ⊕ (𝑅 ⊕ 𝑄)))
32	30, 26, 25, 31	syl3anc 1373	. . . . . . . 8 ⊢ (𝜑 → ((𝑈 ⊕ 𝑅) ⊕ 𝑄) = (𝑈 ⊕ (𝑅 ⊕ 𝑄)))
33	29, 32	eqtr4d 2772	. . . . . . 7 ⊢ (𝜑 → (𝑈 ⊕ (𝑄 ⊕ 𝑅)) = ((𝑈 ⊕ 𝑅) ⊕ 𝑄))
34	1, 2	lsmcl 21033	. . . . . . . . . 10 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆 ∧ 𝑅 ∈ 𝑆) → (𝑈 ⊕ 𝑅) ∈ 𝑆)
35	7, 8, 12, 34	syl3anc 1373	. . . . . . . . 9 ⊢ (𝜑 → (𝑈 ⊕ 𝑅) ∈ 𝑆)
36	24, 35	sseldd 3932	. . . . . . . 8 ⊢ (𝜑 → (𝑈 ⊕ 𝑅) ∈ (SubGrp‘𝑊))
37		lsatcvat3.l	. . . . . . . 8 ⊢ (𝜑 → 𝑄 ⊆ (𝑈 ⊕ 𝑅))
38	2	lsmless2 19588	. . . . . . . 8 ⊢ (((𝑈 ⊕ 𝑅) ∈ (SubGrp‘𝑊) ∧ (𝑈 ⊕ 𝑅) ∈ (SubGrp‘𝑊) ∧ 𝑄 ⊆ (𝑈 ⊕ 𝑅)) → ((𝑈 ⊕ 𝑅) ⊕ 𝑄) ⊆ ((𝑈 ⊕ 𝑅) ⊕ (𝑈 ⊕ 𝑅)))
39	36, 36, 37, 38	syl3anc 1373	. . . . . . 7 ⊢ (𝜑 → ((𝑈 ⊕ 𝑅) ⊕ 𝑄) ⊆ ((𝑈 ⊕ 𝑅) ⊕ (𝑈 ⊕ 𝑅)))
40	33, 39	eqsstrd 3966	. . . . . 6 ⊢ (𝜑 → (𝑈 ⊕ (𝑄 ⊕ 𝑅)) ⊆ ((𝑈 ⊕ 𝑅) ⊕ (𝑈 ⊕ 𝑅)))
41	2	lsmidm 19590	. . . . . . 7 ⊢ ((𝑈 ⊕ 𝑅) ∈ (SubGrp‘𝑊) → ((𝑈 ⊕ 𝑅) ⊕ (𝑈 ⊕ 𝑅)) = (𝑈 ⊕ 𝑅))
42	36, 41	syl 17	. . . . . 6 ⊢ (𝜑 → ((𝑈 ⊕ 𝑅) ⊕ (𝑈 ⊕ 𝑅)) = (𝑈 ⊕ 𝑅))
43	40, 42	sseqtrd 3968	. . . . 5 ⊢ (𝜑 → (𝑈 ⊕ (𝑄 ⊕ 𝑅)) ⊆ (𝑈 ⊕ 𝑅))
44	24, 14	sseldd 3932	. . . . . 6 ⊢ (𝜑 → (𝑄 ⊕ 𝑅) ∈ (SubGrp‘𝑊))
45	2	lsmub2 19585	. . . . . . 7 ⊢ ((𝑄 ∈ (SubGrp‘𝑊) ∧ 𝑅 ∈ (SubGrp‘𝑊)) → 𝑅 ⊆ (𝑄 ⊕ 𝑅))
46	25, 26, 45	syl2anc 584	. . . . . 6 ⊢ (𝜑 → 𝑅 ⊆ (𝑄 ⊕ 𝑅))
47	2	lsmless2 19588	. . . . . 6 ⊢ ((𝑈 ∈ (SubGrp‘𝑊) ∧ (𝑄 ⊕ 𝑅) ∈ (SubGrp‘𝑊) ∧ 𝑅 ⊆ (𝑄 ⊕ 𝑅)) → (𝑈 ⊕ 𝑅) ⊆ (𝑈 ⊕ (𝑄 ⊕ 𝑅)))
48	30, 44, 46, 47	syl3anc 1373	. . . . 5 ⊢ (𝜑 → (𝑈 ⊕ 𝑅) ⊆ (𝑈 ⊕ (𝑄 ⊕ 𝑅)))
49	43, 48	eqssd 3949	. . . 4 ⊢ (𝜑 → (𝑈 ⊕ (𝑄 ⊕ 𝑅)) = (𝑈 ⊕ 𝑅))
50	20, 49	breqtrrd 5124	. . 3 ⊢ (𝜑 → 𝑈( ⋖_L ‘𝑊)(𝑈 ⊕ (𝑄 ⊕ 𝑅)))
51	1, 2, 4, 7, 8, 14, 50	lcvexchlem4 39236	. 2 ⊢ (𝜑 → (𝑈 ∩ (𝑄 ⊕ 𝑅))( ⋖_L ‘𝑊)(𝑄 ⊕ 𝑅))
52	1, 2, 3, 4, 5, 16, 9, 11, 17, 51	lsatcvat2 39250	1 ⊢ (𝜑 → (𝑈 ∩ (𝑄 ⊕ 𝑅)) ∈ 𝐴)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 = wceq 1541 ∈ wcel 2113 ≠ wne 2930 ∩ cin 3898 ⊆ wss 3899 class class class wbr 5096 ‘cfv 6490 (class class class)co 7356 SubGrpcsubg 19048 LSSumclsm 19561 Abelcabl 19708 LModclmod 20809 LSubSpclss 20880 LVecclvec 21052 LSAtomsclsa 39173 ⋖_L clcv 39217

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-rep 5222 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-cnex 11080 ax-resscn 11081 ax-1cn 11082 ax-icn 11083 ax-addcl 11084 ax-addrcl 11085 ax-mulcl 11086 ax-mulrcl 11087 ax-mulcom 11088 ax-addass 11089 ax-mulass 11090 ax-distr 11091 ax-i2m1 11092 ax-1ne0 11093 ax-1rid 11094 ax-rnegex 11095 ax-rrecex 11096 ax-cnre 11097 ax-pre-lttri 11098 ax-pre-lttrn 11099 ax-pre-ltadd 11100 ax-pre-mulgt0 11101

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-int 4901 df-iun 4946 df-iin 4947 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1st 7931 df-2nd 7932 df-tpos 8166 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-2o 8396 df-er 8633 df-en 8882 df-dom 8883 df-sdom 8884 df-fin 8885 df-pnf 11166 df-mnf 11167 df-xr 11168 df-ltxr 11169 df-le 11170 df-sub 11364 df-neg 11365 df-nn 12144 df-2 12206 df-3 12207 df-sets 17089 df-slot 17107 df-ndx 17119 df-base 17135 df-ress 17156 df-plusg 17188 df-mulr 17189 df-0g 17359 df-mre 17503 df-mrc 17504 df-acs 17506 df-mgm 18563 df-sgrp 18642 df-mnd 18658 df-submnd 18707 df-grp 18864 df-minusg 18865 df-sbg 18866 df-subg 19051 df-cntz 19244 df-oppg 19273 df-lsm 19563 df-cmn 19709 df-abl 19710 df-mgp 20074 df-rng 20086 df-ur 20115 df-ring 20168 df-oppr 20271 df-dvdsr 20291 df-unit 20292 df-invr 20322 df-drng 20662 df-lmod 20811 df-lss 20881 df-lsp 20921 df-lvec 21053 df-lsatoms 39175 df-lcv 39218

This theorem is referenced by: l1cvat 39254

W3C validator