| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > lspun0 | 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 14637 | . . . . 5 ⊢ (𝑊 ∈ LMod → 0 ∈ 𝑉) |
| 6 | 1, 5 | syl 14 | . . . 4 ⊢ (𝜑 → 0 ∈ 𝑉) |
| 7 | 6 | snssd 3858 | . . 3 ⊢ (𝜑 → { 0 } ⊆ 𝑉) |
| 8 | lspun0.n | . . . 4 ⊢ 𝑁 = (LSpan‘𝑊) | |
| 9 | 3, 8 | lspun 14722 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ⊆ 𝑉 ∧ { 0 } ⊆ 𝑉) → (𝑁‘(𝑋 ∪ { 0 })) = (𝑁‘((𝑁‘𝑋) ∪ (𝑁‘{ 0 })))) |
| 10 | 1, 2, 7, 9 | syl3anc 1278 | . 2 ⊢ (𝜑 → (𝑁‘(𝑋 ∪ { 0 })) = (𝑁‘((𝑁‘𝑋) ∪ (𝑁‘{ 0 })))) |
| 11 | 4, 8 | lspsn0 14742 | . . . . . . 7 ⊢ (𝑊 ∈ LMod → (𝑁‘{ 0 }) = { 0 }) |
| 12 | 1, 11 | syl 14 | . . . . . 6 ⊢ (𝜑 → (𝑁‘{ 0 }) = { 0 }) |
| 13 | 12 | uneq2d 3383 | . . . . 5 ⊢ (𝜑 → ((𝑁‘𝑋) ∪ (𝑁‘{ 0 })) = ((𝑁‘𝑋) ∪ { 0 })) |
| 14 | eqid 2238 | . . . . . . . . 9 ⊢ (LSubSp‘𝑊) = (LSubSp‘𝑊) | |
| 15 | 3, 14, 8 | lspcl 14711 | . . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ⊆ 𝑉) → (𝑁‘𝑋) ∈ (LSubSp‘𝑊)) |
| 16 | 1, 2, 15 | syl2anc 415 | . . . . . . 7 ⊢ (𝜑 → (𝑁‘𝑋) ∈ (LSubSp‘𝑊)) |
| 17 | 4, 14 | lss0ss 14691 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ (𝑁‘𝑋) ∈ (LSubSp‘𝑊)) → { 0 } ⊆ (𝑁‘𝑋)) |
| 18 | 1, 16, 17 | syl2anc 415 | . . . . . 6 ⊢ (𝜑 → { 0 } ⊆ (𝑁‘𝑋)) |
| 19 | ssequn2 3402 | . . . . . 6 ⊢ ({ 0 } ⊆ (𝑁‘𝑋) ↔ ((𝑁‘𝑋) ∪ { 0 }) = (𝑁‘𝑋)) | |
| 20 | 18, 19 | sylib 122 | . . . . 5 ⊢ (𝜑 → ((𝑁‘𝑋) ∪ { 0 }) = (𝑁‘𝑋)) |
| 21 | 13, 20 | eqtrd 2271 | . . . 4 ⊢ (𝜑 → ((𝑁‘𝑋) ∪ (𝑁‘{ 0 })) = (𝑁‘𝑋)) |
| 22 | 21 | fveq2d 5697 | . . 3 ⊢ (𝜑 → (𝑁‘((𝑁‘𝑋) ∪ (𝑁‘{ 0 }))) = (𝑁‘(𝑁‘𝑋))) |
| 23 | 3, 8 | lspidm 14721 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ⊆ 𝑉) → (𝑁‘(𝑁‘𝑋)) = (𝑁‘𝑋)) |
| 24 | 1, 2, 23 | syl2anc 415 | . . 3 ⊢ (𝜑 → (𝑁‘(𝑁‘𝑋)) = (𝑁‘𝑋)) |
| 25 | 22, 24 | eqtrd 2271 | . 2 ⊢ (𝜑 → (𝑁‘((𝑁‘𝑋) ∪ (𝑁‘{ 0 }))) = (𝑁‘𝑋)) |
| 26 | 10, 25 | eqtrd 2271 | 1 ⊢ (𝜑 → (𝑁‘(𝑋 ∪ { 0 })) = (𝑁‘𝑋)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1402 ∈ wcel 2209 ∪ cun 3218 ⊆ wss 3220 {csn 3708 ‘cfv 5375 Basecbs 13335 0gc0g 13593 LModclmod 14606 LSubSpclss 14672 LSpanclspn 14706 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4244 ax-sep 4247 ax-pow 4309 ax-pr 4344 ax-un 4576 ax-setind 4682 ax-cnex 8264 ax-resscn 8265 ax-1cn 8266 ax-1re 8267 ax-icn 8268 ax-addcl 8269 ax-addrcl 8270 ax-mulcl 8271 ax-addcom 8273 ax-addass 8275 ax-i2m1 8278 ax-0lt1 8279 ax-0id 8281 ax-rnegex 8282 ax-pre-ltirr 8285 ax-pre-ltadd 8289 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-int 3969 df-iun 4012 df-br 4129 df-opab 4191 df-mpt 4192 df-id 4436 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-ima 4785 df-iota 5335 df-fun 5377 df-fn 5378 df-f 5379 df-f1 5380 df-fo 5381 df-f1o 5382 df-fv 5383 df-riota 6032 df-ov 6082 df-oprab 6083 df-mpo 6084 df-1st 6368 df-2nd 6369 df-pnf 8356 df-mnf 8357 df-ltxr 8359 df-inn 9288 df-2 9346 df-3 9347 df-4 9348 df-5 9349 df-6 9350 df-ndx 13338 df-slot 13339 df-base 13341 df-sets 13342 df-plusg 13427 df-mulr 13428 df-sca 13430 df-vsca 13431 df-0g 13595 df-mgm 13659 df-sgrp 13700 df-mnd 13713 df-grp 13791 df-minusg 13792 df-sbg 13793 df-mgp 14201 df-ur 14246 df-ring 14285 df-lmod 14608 df-lssm 14673 df-lsp 14707 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |