| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lspun | Structured version Visualization version GIF version | ||
| Description: The span of union is the span of the union of spans. (Contributed by NM, 22-Feb-2014.) (Revised by Mario Carneiro, 19-Jun-2014.) |
| Ref | Expression |
|---|---|
| lspss.v | ⊢ 𝑉 = (Base‘𝑊) |
| lspss.n | ⊢ 𝑁 = (LSpan‘𝑊) |
| Ref | Expression |
|---|---|
| lspun | ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘(𝑇 ∪ 𝑈)) = (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1136 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → 𝑊 ∈ LMod) | |
| 2 | simp2 1137 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → 𝑇 ⊆ 𝑉) | |
| 3 | simp3 1138 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → 𝑈 ⊆ 𝑉) | |
| 4 | 2, 3 | unssd 4172 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑇 ∪ 𝑈) ⊆ 𝑉) |
| 5 | ssun1 4158 | . . . . . . 7 ⊢ 𝑇 ⊆ (𝑇 ∪ 𝑈) | |
| 6 | 5 | a1i 11 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → 𝑇 ⊆ (𝑇 ∪ 𝑈)) |
| 7 | lspss.v | . . . . . . 7 ⊢ 𝑉 = (Base‘𝑊) | |
| 8 | lspss.n | . . . . . . 7 ⊢ 𝑁 = (LSpan‘𝑊) | |
| 9 | 7, 8 | lspss 20946 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ (𝑇 ∪ 𝑈) ⊆ 𝑉 ∧ 𝑇 ⊆ (𝑇 ∪ 𝑈)) → (𝑁‘𝑇) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 10 | 1, 4, 6, 9 | syl3anc 1373 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘𝑇) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 11 | ssun2 4159 | . . . . . . 7 ⊢ 𝑈 ⊆ (𝑇 ∪ 𝑈) | |
| 12 | 11 | a1i 11 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → 𝑈 ⊆ (𝑇 ∪ 𝑈)) |
| 13 | 7, 8 | lspss 20946 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ (𝑇 ∪ 𝑈) ⊆ 𝑉 ∧ 𝑈 ⊆ (𝑇 ∪ 𝑈)) → (𝑁‘𝑈) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 14 | 1, 4, 12, 13 | syl3anc 1373 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘𝑈) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 15 | 10, 14 | unssd 4172 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → ((𝑁‘𝑇) ∪ (𝑁‘𝑈)) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 16 | 7, 8 | lspssv 20945 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ (𝑇 ∪ 𝑈) ⊆ 𝑉) → (𝑁‘(𝑇 ∪ 𝑈)) ⊆ 𝑉) |
| 17 | 1, 4, 16 | syl2anc 584 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘(𝑇 ∪ 𝑈)) ⊆ 𝑉) |
| 18 | 15, 17 | sstrd 3974 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → ((𝑁‘𝑇) ∪ (𝑁‘𝑈)) ⊆ 𝑉) |
| 19 | 7, 8 | lspssid 20947 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉) → 𝑇 ⊆ (𝑁‘𝑇)) |
| 20 | 1, 2, 19 | syl2anc 584 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → 𝑇 ⊆ (𝑁‘𝑇)) |
| 21 | 7, 8 | lspssid 20947 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → 𝑈 ⊆ (𝑁‘𝑈)) |
| 22 | unss12 4168 | . . . 4 ⊢ ((𝑇 ⊆ (𝑁‘𝑇) ∧ 𝑈 ⊆ (𝑁‘𝑈)) → (𝑇 ∪ 𝑈) ⊆ ((𝑁‘𝑇) ∪ (𝑁‘𝑈))) | |
| 23 | 20, 21, 22 | 3imp3i2an 1346 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑇 ∪ 𝑈) ⊆ ((𝑁‘𝑇) ∪ (𝑁‘𝑈))) |
| 24 | 7, 8 | lspss 20946 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ ((𝑁‘𝑇) ∪ (𝑁‘𝑈)) ⊆ 𝑉 ∧ (𝑇 ∪ 𝑈) ⊆ ((𝑁‘𝑇) ∪ (𝑁‘𝑈))) → (𝑁‘(𝑇 ∪ 𝑈)) ⊆ (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈)))) |
| 25 | 1, 18, 23, 24 | syl3anc 1373 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘(𝑇 ∪ 𝑈)) ⊆ (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈)))) |
| 26 | 7, 8 | lspss 20946 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ (𝑁‘(𝑇 ∪ 𝑈)) ⊆ 𝑉 ∧ ((𝑁‘𝑇) ∪ (𝑁‘𝑈)) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) → (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈))) ⊆ (𝑁‘(𝑁‘(𝑇 ∪ 𝑈)))) |
| 27 | 1, 17, 15, 26 | syl3anc 1373 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈))) ⊆ (𝑁‘(𝑁‘(𝑇 ∪ 𝑈)))) |
| 28 | 7, 8 | lspidm 20948 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ (𝑇 ∪ 𝑈) ⊆ 𝑉) → (𝑁‘(𝑁‘(𝑇 ∪ 𝑈))) = (𝑁‘(𝑇 ∪ 𝑈))) |
| 29 | 1, 4, 28 | syl2anc 584 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘(𝑁‘(𝑇 ∪ 𝑈))) = (𝑁‘(𝑇 ∪ 𝑈))) |
| 30 | 27, 29 | sseqtrd 4000 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈))) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 31 | 25, 30 | eqssd 3981 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘(𝑇 ∪ 𝑈)) = (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ∪ cun 3929 ⊆ wss 3931 ‘cfv 6536 Basecbs 17233 LModclmod 20822 LSpanclspn 20933 |
| 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 2708 ax-rep 5254 ax-sep 5271 ax-nul 5281 ax-pow 5340 ax-pr 5407 ax-un 7734 ax-cnex 11190 ax-resscn 11191 ax-1cn 11192 ax-icn 11193 ax-addcl 11194 ax-addrcl 11195 ax-mulcl 11196 ax-mulrcl 11197 ax-mulcom 11198 ax-addass 11199 ax-mulass 11200 ax-distr 11201 ax-i2m1 11202 ax-1ne0 11203 ax-1rid 11204 ax-rnegex 11205 ax-rrecex 11206 ax-cnre 11207 ax-pre-lttri 11208 ax-pre-lttrn 11209 ax-pre-ltadd 11210 ax-pre-mulgt0 11211 |
| 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 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-rmo 3364 df-reu 3365 df-rab 3421 df-v 3466 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-pss 3951 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4889 df-int 4928 df-iun 4974 df-br 5125 df-opab 5187 df-mpt 5207 df-tr 5235 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6295 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7867 df-1st 7993 df-2nd 7994 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-er 8724 df-en 8965 df-dom 8966 df-sdom 8967 df-pnf 11276 df-mnf 11277 df-xr 11278 df-ltxr 11279 df-le 11280 df-sub 11473 df-neg 11474 df-nn 12246 df-2 12308 df-sets 17188 df-slot 17206 df-ndx 17218 df-base 17234 df-plusg 17289 df-0g 17460 df-mgm 18623 df-sgrp 18702 df-mnd 18718 df-grp 18924 df-minusg 18925 df-sbg 18926 df-mgp 20106 df-ur 20147 df-ring 20200 df-lmod 20824 df-lss 20894 df-lsp 20934 |
| This theorem is referenced by: lspun0 20973 lsmsp2 21050 lsmpr 21052 lsppr 21056 islshpsm 39003 lshpnel2N 39008 lkrlsp3 39127 dochsatshp 41475 |
| Copyright terms: Public domain | W3C validator |