| 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 21199 | . . . . 5 ⊢ (𝑊 ∈ LMod → 0 ∈ 𝑉) |
| 6 | 1, 5 | syl 18 | . . . 4 ⊢ (𝜑 → 0 ∈ 𝑉) |
| 7 | 6 | snssd 4747 | . . 3 ⊢ (𝜑 → { 0 } ⊆ 𝑉) |
| 8 | lspun0.n | . . . 4 ⊢ 𝑁 = (LSpan‘𝑊) | |
| 9 | 3, 8 | lspun 21295 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ⊆ 𝑉 ∧ { 0 } ⊆ 𝑉) → (𝑁‘(𝑋 ∪ { 0 })) = (𝑁‘((𝑁‘𝑋) ∪ (𝑁‘{ 0 })))) |
| 10 | 1, 2, 7, 9 | syl3anc 1399 | . 2 ⊢ (𝜑 → (𝑁‘(𝑋 ∪ { 0 })) = (𝑁‘((𝑁‘𝑋) ∪ (𝑁‘{ 0 })))) |
| 11 | 4, 8 | lspsn0 21316 | . . . . . . 7 ⊢ (𝑊 ∈ LMod → (𝑁‘{ 0 }) = { 0 }) |
| 12 | 1, 11 | syl 18 | . . . . . 6 ⊢ (𝜑 → (𝑁‘{ 0 }) = { 0 }) |
| 13 | 12 | uneq2d 4170 | . . . . 5 ⊢ (𝜑 → ((𝑁‘𝑋) ∪ (𝑁‘{ 0 })) = ((𝑁‘𝑋) ∪ { 0 })) |
| 14 | eqid 2763 | . . . . . . . . 9 ⊢ (LSubSp‘𝑊) = (LSubSp‘𝑊) | |
| 15 | 3, 14, 8 | lspcl 21284 | . . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ⊆ 𝑉) → (𝑁‘𝑋) ∈ (LSubSp‘𝑊)) |
| 16 | 1, 2, 15 | syl2anc 596 | . . . . . . 7 ⊢ (𝜑 → (𝑁‘𝑋) ∈ (LSubSp‘𝑊)) |
| 17 | 4, 14 | lss0ss 21257 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ (𝑁‘𝑋) ∈ (LSubSp‘𝑊)) → { 0 } ⊆ (𝑁‘𝑋)) |
| 18 | 1, 16, 17 | syl2anc 596 | . . . . . 6 ⊢ (𝜑 → { 0 } ⊆ (𝑁‘𝑋)) |
| 19 | ssequn2 4190 | . . . . . 6 ⊢ ({ 0 } ⊆ (𝑁‘𝑋) ↔ ((𝑁‘𝑋) ∪ { 0 }) = (𝑁‘𝑋)) | |
| 20 | 18, 19 | sylib 221 | . . . . 5 ⊢ (𝜑 → ((𝑁‘𝑋) ∪ { 0 }) = (𝑁‘𝑋)) |
| 21 | 13, 20 | eqtrd 2798 | . . . 4 ⊢ (𝜑 → ((𝑁‘𝑋) ∪ (𝑁‘{ 0 })) = (𝑁‘𝑋)) |
| 22 | 21 | fveq2d 6915 | . . 3 ⊢ (𝜑 → (𝑁‘((𝑁‘𝑋) ∪ (𝑁‘{ 0 }))) = (𝑁‘(𝑁‘𝑋))) |
| 23 | 3, 8 | lspidm 21294 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ⊆ 𝑉) → (𝑁‘(𝑁‘𝑋)) = (𝑁‘𝑋)) |
| 24 | 1, 2, 23 | syl2anc 596 | . . 3 ⊢ (𝜑 → (𝑁‘(𝑁‘𝑋)) = (𝑁‘𝑋)) |
| 25 | 22, 24 | eqtrd 2798 | . 2 ⊢ (𝜑 → (𝑁‘((𝑁‘𝑋) ∪ (𝑁‘{ 0 }))) = (𝑁‘𝑋)) |
| 26 | 10, 25 | eqtrd 2798 | 1 ⊢ (𝜑 → (𝑁‘(𝑋 ∪ { 0 })) = (𝑁‘𝑋)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 ⊆ wss 3900 ∪ cun 4152 {csn 4588 ‘cfv 6561 Basecbs 17419 0gc0g 17642 LModclmod 21168 LSubSpclss 21239 LSpanclspn 21279 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5236 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7778 ax-cnex 11286 ax-resscn 11287 ax-1cn 11288 ax-icn 11289 ax-addcl 11290 ax-addrcl 11291 ax-mulcl 11292 ax-mulrcl 11293 ax-mulcom 11294 ax-addass 11295 ax-mulass 11296 ax-distr 11297 ax-i2m1 11298 ax-1ne0 11299 ax-1rid 11300 ax-rnegex 11301 ax-rrecex 11302 ax-cnre 11303 ax-pre-lttri 11304 ax-pre-lttrn 11305 ax-pre-ltadd 11306 ax-pre-mulgt0 11307 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5551 df-eprel 5556 df-po 5564 df-so 5565 df-fr 5609 df-we 5611 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-pred 6325 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 df-iota 6515 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-riota 7403 df-ov 7449 df-oprab 7450 df-mpo 7451 df-om 7905 df-1st 8028 df-2nd 8029 df-frecs 8330 df-wrecs 8361 df-recs 8410 df-rdg 8449 df-er 8748 df-en 9005 df-dom 9006 df-sdom 9007 df-pnf 11375 df-mnf 11376 df-xr 11377 df-ltxr 11378 df-le 11379 df-sub 11573 df-neg 11574 df-nn 12366 df-2 12435 df-sets 17374 df-slot 17392 df-ndx 17404 df-base 17420 df-plusg 17473 df-0g 17644 df-mgm 18848 df-sgrp 18940 df-mnd 18956 df-grp 19179 df-minusg 19180 df-sbg 19181 df-cmn 20029 df-abl 20030 df-mgp 20394 df-rng 20408 df-ur 20441 df-ring 20494 df-lmod 21170 df-lss 21240 df-lsp 21280 |
| This theorem is used by: dvh4dimN 42707 |
| Copyright terms: Public domain | W3C validator |