| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lssincl | Structured version Visualization version GIF version | ||
| Description: The intersection of two subspaces is a subspace. (Contributed by NM, 7-Mar-2014.) (Revised by Mario Carneiro, 19-Jun-2014.) |
| Ref | Expression |
|---|---|
| lssintcl.s | ⊢ 𝑆 = (LSubSp‘𝑊) |
| Ref | Expression |
|---|---|
| lssincl | ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑇 ∩ 𝑈) ∈ 𝑆) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | intprg 4941 | . . 3 ⊢ ((𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → ∩ {𝑇, 𝑈} = (𝑇 ∩ 𝑈)) | |
| 2 | 1 | 3adant1 1148 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → ∩ {𝑇, 𝑈} = (𝑇 ∩ 𝑈)) |
| 3 | simp1 1154 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → 𝑊 ∈ LMod) | |
| 4 | prssi 4782 | . . . 4 ⊢ ((𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → {𝑇, 𝑈} ⊆ 𝑆) | |
| 5 | 4 | 3adant1 1148 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → {𝑇, 𝑈} ⊆ 𝑆) |
| 6 | prnzg 4739 | . . . 4 ⊢ (𝑇 ∈ 𝑆 → {𝑇, 𝑈} ≠ ∅) | |
| 7 | 6 | 3ad2ant2 1152 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → {𝑇, 𝑈} ≠ ∅) |
| 8 | lssintcl.s | . . . 4 ⊢ 𝑆 = (LSubSp‘𝑊) | |
| 9 | 8 | lssintcl 21239 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ {𝑇, 𝑈} ⊆ 𝑆 ∧ {𝑇, 𝑈} ≠ ∅) → ∩ {𝑇, 𝑈} ∈ 𝑆) |
| 10 | 3, 5, 7, 9 | syl3anc 1398 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → ∩ {𝑇, 𝑈} ∈ 𝑆) |
| 11 | 2, 10 | eqeltrrd 2862 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑇 ∩ 𝑈) ∈ 𝑆) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ≠ wne 2956 ∩ cin 3898 ⊆ wss 3899 ∅c0 4279 {cpr 4586 ∩ cint 4907 ‘cfv 6538 LModclmod 21135 LSubSpclss 21206 |
| 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-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 |
| 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-int 4908 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 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-er 8717 df-en 8974 df-dom 8975 df-sdom 8976 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-nn 12336 df-2 12405 df-sets 17342 df-slot 17360 df-ndx 17372 df-base 17388 df-plusg 17441 df-0g 17612 df-mgm 18816 df-sgrp 18908 df-mnd 18924 df-grp 19147 df-minusg 19148 df-sbg 19149 df-mgp 20361 df-ur 20408 df-ring 20461 df-lmod 21137 df-lss 21207 |
| This theorem is used by: ocvin 21980 lshpdisj 40044 lcvexchlem2 40092 lcvexchlem4 40094 lcvexchlem5 40095 lcvp 40097 lsatcvat3 40109 dihmeetlem13N 42376 dochnoncon 42448 dochexmidlem5 42521 lclkrlem2f 42569 lcfrlem25 42624 mapdincl 42718 mapdin 42719 lmhmlnmsplit 44088 |
| Copyright terms: Public domain | W3C validator |