| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lspun0 | Structured version Visualization version GIF version | ||
| Description: The span of a union with the zero subspace. (Contributed by NM, 22-May-2015.) |
| Ref | Expression |
|---|---|
| lspun0.v | ⊢ 𝑉 = (Base‘𝑊) |
| lspun0.o | ⊢ 0 = (0g‘𝑊) |
| lspun0.n | ⊢ 𝑁 = (LSpan‘𝑊) |
| lspun0.w | ⊢ (𝜑 → 𝑊 ∈ LMod) |
| lspun0.x | ⊢ (𝜑 → 𝑋 ⊆ 𝑉) |
| Ref | Expression |
|---|---|
| lspun0 | ⊢ (𝜑 → (𝑁‘(𝑋 ∪ { 0 })) = (𝑁‘𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lspun0.w | . . 3 ⊢ (𝜑 → 𝑊 ∈ LMod) | |
| 2 | lspun0.x | . . 3 ⊢ (𝜑 → 𝑋 ⊆ 𝑉) | |
| 3 | lspun0.v | . . . . . 6 ⊢ 𝑉 = (Base‘𝑊) | |
| 4 | lspun0.o | . . . . . 6 ⊢ 0 = (0g‘𝑊) | |
| 5 | 3, 4 | lmod0vcl 20812 | . . . . 5 ⊢ (𝑊 ∈ LMod → 0 ∈ 𝑉) |
| 6 | 1, 5 | syl 17 | . . . 4 ⊢ (𝜑 → 0 ∈ 𝑉) |
| 7 | 6 | snssd 4763 | . . 3 ⊢ (𝜑 → { 0 } ⊆ 𝑉) |
| 8 | lspun0.n | . . . 4 ⊢ 𝑁 = (LSpan‘𝑊) | |
| 9 | 3, 8 | lspun 20908 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ⊆ 𝑉 ∧ { 0 } ⊆ 𝑉) → (𝑁‘(𝑋 ∪ { 0 })) = (𝑁‘((𝑁‘𝑋) ∪ (𝑁‘{ 0 })))) |
| 10 | 1, 2, 7, 9 | syl3anc 1373 | . 2 ⊢ (𝜑 → (𝑁‘(𝑋 ∪ { 0 })) = (𝑁‘((𝑁‘𝑋) ∪ (𝑁‘{ 0 })))) |
| 11 | 4, 8 | lspsn0 20929 | . . . . . . 7 ⊢ (𝑊 ∈ LMod → (𝑁‘{ 0 }) = { 0 }) |
| 12 | 1, 11 | syl 17 | . . . . . 6 ⊢ (𝜑 → (𝑁‘{ 0 }) = { 0 }) |
| 13 | 12 | uneq2d 4121 | . . . . 5 ⊢ (𝜑 → ((𝑁‘𝑋) ∪ (𝑁‘{ 0 })) = ((𝑁‘𝑋) ∪ { 0 })) |
| 14 | eqid 2729 | . . . . . . . . 9 ⊢ (LSubSp‘𝑊) = (LSubSp‘𝑊) | |
| 15 | 3, 14, 8 | lspcl 20897 | . . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ⊆ 𝑉) → (𝑁‘𝑋) ∈ (LSubSp‘𝑊)) |
| 16 | 1, 2, 15 | syl2anc 584 | . . . . . . 7 ⊢ (𝜑 → (𝑁‘𝑋) ∈ (LSubSp‘𝑊)) |
| 17 | 4, 14 | lss0ss 20870 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ (𝑁‘𝑋) ∈ (LSubSp‘𝑊)) → { 0 } ⊆ (𝑁‘𝑋)) |
| 18 | 1, 16, 17 | syl2anc 584 | . . . . . 6 ⊢ (𝜑 → { 0 } ⊆ (𝑁‘𝑋)) |
| 19 | ssequn2 4142 | . . . . . 6 ⊢ ({ 0 } ⊆ (𝑁‘𝑋) ↔ ((𝑁‘𝑋) ∪ { 0 }) = (𝑁‘𝑋)) | |
| 20 | 18, 19 | sylib 218 | . . . . 5 ⊢ (𝜑 → ((𝑁‘𝑋) ∪ { 0 }) = (𝑁‘𝑋)) |
| 21 | 13, 20 | eqtrd 2764 | . . . 4 ⊢ (𝜑 → ((𝑁‘𝑋) ∪ (𝑁‘{ 0 })) = (𝑁‘𝑋)) |
| 22 | 21 | fveq2d 6830 | . . 3 ⊢ (𝜑 → (𝑁‘((𝑁‘𝑋) ∪ (𝑁‘{ 0 }))) = (𝑁‘(𝑁‘𝑋))) |
| 23 | 3, 8 | lspidm 20907 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ⊆ 𝑉) → (𝑁‘(𝑁‘𝑋)) = (𝑁‘𝑋)) |
| 24 | 1, 2, 23 | syl2anc 584 | . . 3 ⊢ (𝜑 → (𝑁‘(𝑁‘𝑋)) = (𝑁‘𝑋)) |
| 25 | 22, 24 | eqtrd 2764 | . 2 ⊢ (𝜑 → (𝑁‘((𝑁‘𝑋) ∪ (𝑁‘{ 0 }))) = (𝑁‘𝑋)) |
| 26 | 10, 25 | eqtrd 2764 | 1 ⊢ (𝜑 → (𝑁‘(𝑋 ∪ { 0 })) = (𝑁‘𝑋)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2109 ∪ cun 3903 ⊆ wss 3905 {csn 4579 ‘cfv 6486 Basecbs 17138 0gc0g 17361 LModclmod 20781 LSubSpclss 20852 LSpanclspn 20892 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5221 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7675 ax-cnex 11084 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104 ax-pre-mulgt0 11105 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3345 df-reu 3346 df-rab 3397 df-v 3440 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4862 df-int 4900 df-iun 4946 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 df-id 5518 df-eprel 5523 df-po 5531 df-so 5532 df-fr 5576 df-we 5578 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-pred 6253 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-riota 7310 df-ov 7356 df-oprab 7357 df-mpo 7358 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-er 8632 df-en 8880 df-dom 8881 df-sdom 8882 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11367 df-neg 11368 df-nn 12147 df-2 12209 df-sets 17093 df-slot 17111 df-ndx 17123 df-base 17139 df-plusg 17192 df-0g 17363 df-mgm 18532 df-sgrp 18611 df-mnd 18627 df-grp 18833 df-minusg 18834 df-sbg 18835 df-cmn 19679 df-abl 19680 df-mgp 20044 df-rng 20056 df-ur 20085 df-ring 20138 df-lmod 20783 df-lss 20853 df-lsp 20893 |
| This theorem is referenced by: dvh4dimN 41426 |
| Copyright terms: Public domain | W3C validator |