| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > lsmsatcv | Structured version Visualization version GIF version | ||
| Description: Subspace sum has the covering property (using spans of singletons to represent atoms). Similar to Exercise 5 of [Kalmbach] p. 153. (spansncvi 32075 analog.) Explicit atom version of lsmcv 21315. (Contributed by NM, 29-Oct-2014.) |
| Ref | Expression |
|---|---|
| lsmsatcv.s | ⊢ 𝑆 = (LSubSp‘𝑊) |
| lsmsatcv.p | ⊢ ⊕ = (LSSum‘𝑊) |
| lsmsatcv.a | ⊢ 𝐴 = (LSAtoms‘𝑊) |
| lsmsatcv.w | ⊢ (𝜑 → 𝑊 ∈ LVec) |
| lsmsatcv.t | ⊢ (𝜑 → 𝑇 ∈ 𝑆) |
| lsmsatcv.u | ⊢ (𝜑 → 𝑈 ∈ 𝑆) |
| lsmsatcv.x | ⊢ (𝜑 → 𝑄 ∈ 𝐴) |
| Ref | Expression |
|---|---|
| lsmsatcv | ⊢ ((𝜑 ∧ 𝑇 ⊊ 𝑈 ∧ 𝑈 ⊆ (𝑇 ⊕ 𝑄)) → 𝑈 = (𝑇 ⊕ 𝑄)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lsmsatcv.w | . . . 4 ⊢ (𝜑 → 𝑊 ∈ LVec) | |
| 2 | lsmsatcv.x | . . . 4 ⊢ (𝜑 → 𝑄 ∈ 𝐴) | |
| 3 | eqid 2765 | . . . . 5 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
| 4 | eqid 2765 | . . . . 5 ⊢ (LSpan‘𝑊) = (LSpan‘𝑊) | |
| 5 | lsmsatcv.a | . . . . 5 ⊢ 𝐴 = (LSAtoms‘𝑊) | |
| 6 | 3, 4, 5 | islsati 39826 | . . . 4 ⊢ ((𝑊 ∈ LVec ∧ 𝑄 ∈ 𝐴) → ∃𝑣 ∈ (Base‘𝑊)𝑄 = ((LSpan‘𝑊)‘{𝑣})) |
| 7 | 1, 2, 6 | syl2anc 596 | . . 3 ⊢ (𝜑 → ∃𝑣 ∈ (Base‘𝑊)𝑄 = ((LSpan‘𝑊)‘{𝑣})) |
| 8 | lsmsatcv.s | . . . . . . . 8 ⊢ 𝑆 = (LSubSp‘𝑊) | |
| 9 | lsmsatcv.p | . . . . . . . 8 ⊢ ⊕ = (LSSum‘𝑊) | |
| 10 | 1 | adantr 486 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑣 ∈ (Base‘𝑊)) → 𝑊 ∈ LVec) |
| 11 | lsmsatcv.t | . . . . . . . . 9 ⊢ (𝜑 → 𝑇 ∈ 𝑆) | |
| 12 | 11 | adantr 486 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑣 ∈ (Base‘𝑊)) → 𝑇 ∈ 𝑆) |
| 13 | lsmsatcv.u | . . . . . . . . 9 ⊢ (𝜑 → 𝑈 ∈ 𝑆) | |
| 14 | 13 | adantr 486 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑣 ∈ (Base‘𝑊)) → 𝑈 ∈ 𝑆) |
| 15 | simpr 490 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑣 ∈ (Base‘𝑊)) → 𝑣 ∈ (Base‘𝑊)) | |
| 16 | 3, 8, 4, 9, 10, 12, 14, 15 | lsmcv 21315 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑣 ∈ (Base‘𝑊)) ∧ 𝑇 ⊊ 𝑈 ∧ 𝑈 ⊆ (𝑇 ⊕ ((LSpan‘𝑊)‘{𝑣}))) → 𝑈 = (𝑇 ⊕ ((LSpan‘𝑊)‘{𝑣}))) |
| 17 | 16 | 3expib 1140 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑣 ∈ (Base‘𝑊)) → ((𝑇 ⊊ 𝑈 ∧ 𝑈 ⊆ (𝑇 ⊕ ((LSpan‘𝑊)‘{𝑣}))) → 𝑈 = (𝑇 ⊕ ((LSpan‘𝑊)‘{𝑣})))) |
| 18 | 17 | 3adant3 1150 | . . . . 5 ⊢ ((𝜑 ∧ 𝑣 ∈ (Base‘𝑊) ∧ 𝑄 = ((LSpan‘𝑊)‘{𝑣})) → ((𝑇 ⊊ 𝑈 ∧ 𝑈 ⊆ (𝑇 ⊕ ((LSpan‘𝑊)‘{𝑣}))) → 𝑈 = (𝑇 ⊕ ((LSpan‘𝑊)‘{𝑣})))) |
| 19 | oveq2 7427 | . . . . . . . . 9 ⊢ (𝑄 = ((LSpan‘𝑊)‘{𝑣}) → (𝑇 ⊕ 𝑄) = (𝑇 ⊕ ((LSpan‘𝑊)‘{𝑣}))) | |
| 20 | 19 | sseq2d 3970 | . . . . . . . 8 ⊢ (𝑄 = ((LSpan‘𝑊)‘{𝑣}) → (𝑈 ⊆ (𝑇 ⊕ 𝑄) ↔ 𝑈 ⊆ (𝑇 ⊕ ((LSpan‘𝑊)‘{𝑣})))) |
| 21 | 20 | anbi2d 642 | . . . . . . 7 ⊢ (𝑄 = ((LSpan‘𝑊)‘{𝑣}) → ((𝑇 ⊊ 𝑈 ∧ 𝑈 ⊆ (𝑇 ⊕ 𝑄)) ↔ (𝑇 ⊊ 𝑈 ∧ 𝑈 ⊆ (𝑇 ⊕ ((LSpan‘𝑊)‘{𝑣}))))) |
| 22 | 19 | eqeq2d 2776 | . . . . . . 7 ⊢ (𝑄 = ((LSpan‘𝑊)‘{𝑣}) → (𝑈 = (𝑇 ⊕ 𝑄) ↔ 𝑈 = (𝑇 ⊕ ((LSpan‘𝑊)‘{𝑣})))) |
| 23 | 21, 22 | imbi12d 347 | . . . . . 6 ⊢ (𝑄 = ((LSpan‘𝑊)‘{𝑣}) → (((𝑇 ⊊ 𝑈 ∧ 𝑈 ⊆ (𝑇 ⊕ 𝑄)) → 𝑈 = (𝑇 ⊕ 𝑄)) ↔ ((𝑇 ⊊ 𝑈 ∧ 𝑈 ⊆ (𝑇 ⊕ ((LSpan‘𝑊)‘{𝑣}))) → 𝑈 = (𝑇 ⊕ ((LSpan‘𝑊)‘{𝑣}))))) |
| 24 | 23 | 3ad2ant3 1153 | . . . . 5 ⊢ ((𝜑 ∧ 𝑣 ∈ (Base‘𝑊) ∧ 𝑄 = ((LSpan‘𝑊)‘{𝑣})) → (((𝑇 ⊊ 𝑈 ∧ 𝑈 ⊆ (𝑇 ⊕ 𝑄)) → 𝑈 = (𝑇 ⊕ 𝑄)) ↔ ((𝑇 ⊊ 𝑈 ∧ 𝑈 ⊆ (𝑇 ⊕ ((LSpan‘𝑊)‘{𝑣}))) → 𝑈 = (𝑇 ⊕ ((LSpan‘𝑊)‘{𝑣}))))) |
| 25 | 18, 24 | mpbird 260 | . . . 4 ⊢ ((𝜑 ∧ 𝑣 ∈ (Base‘𝑊) ∧ 𝑄 = ((LSpan‘𝑊)‘{𝑣})) → ((𝑇 ⊊ 𝑈 ∧ 𝑈 ⊆ (𝑇 ⊕ 𝑄)) → 𝑈 = (𝑇 ⊕ 𝑄))) |
| 26 | 25 | rexlimdv3a 3172 | . . 3 ⊢ (𝜑 → (∃𝑣 ∈ (Base‘𝑊)𝑄 = ((LSpan‘𝑊)‘{𝑣}) → ((𝑇 ⊊ 𝑈 ∧ 𝑈 ⊆ (𝑇 ⊕ 𝑄)) → 𝑈 = (𝑇 ⊕ 𝑄)))) |
| 27 | 7, 26 | mpd 16 | . 2 ⊢ (𝜑 → ((𝑇 ⊊ 𝑈 ∧ 𝑈 ⊆ (𝑇 ⊕ 𝑄)) → 𝑈 = (𝑇 ⊕ 𝑄))) |
| 28 | 27 | 3impib 1134 | 1 ⊢ ((𝜑 ∧ 𝑇 ⊊ 𝑈 ∧ 𝑈 ⊆ (𝑇 ⊕ 𝑄)) → 𝑈 = (𝑇 ⊕ 𝑄)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ∃wrex 3091 ⊆ wss 3906 ⊊ wpss 3907 {csn 4591 ‘cfv 6540 (class class class)co 7419 Basecbs 17291 LSSumclsm 19748 LSubSpclss 21102 LSpanclspn 21142 LVecclvec 21273 LSAtomsclsa 39806 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11171 ax-resscn 11172 ax-1cn 11173 ax-icn 11174 ax-addcl 11175 ax-addrcl 11176 ax-mulcl 11177 ax-mulrcl 11178 ax-mulcom 11179 ax-addass 11180 ax-mulass 11181 ax-distr 11182 ax-i2m1 11183 ax-1ne0 11184 ax-1rid 11185 ax-rnegex 11186 ax-rrecex 11187 ax-cnre 11188 ax-pre-lttri 11189 ax-pre-lttrn 11190 ax-pre-ltadd 11191 ax-pre-mulgt0 11192 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-int 4915 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7869 df-1st 7992 df-2nd 7993 df-tpos 8228 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-er 8700 df-en 8950 df-dom 8951 df-sdom 8952 df-pnf 11260 df-mnf 11261 df-xr 11262 df-ltxr 11263 df-le 11264 df-sub 11458 df-neg 11459 df-nn 12249 df-2 12318 df-3 12319 df-sets 17246 df-slot 17264 df-ndx 17276 df-base 17292 df-ress 17313 df-plusg 17345 df-mulr 17346 df-0g 17516 df-mgm 18720 df-sgrp 18809 df-mnd 18825 df-submnd 18879 df-grp 19047 df-minusg 19048 df-sbg 19049 df-subg 19233 df-lsm 19750 df-cmn 19896 df-abl 19897 df-mgp 20261 df-rng 20275 df-ur 20308 df-ring 20361 df-oppr 20465 df-dvdsr 20485 df-unit 20486 df-invr 20516 df-drng 20879 df-lmod 21033 df-lss 21103 df-lsp 21143 df-lvec 21274 df-lsatoms 39808 |
| This theorem is used by: dochsat 42215 |
| Copyright terms: Public domain | W3C validator |