| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > lspun | 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 1021 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → 𝑊 ∈ LMod) | |
| 2 | simp2 1022 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → 𝑇 ⊆ 𝑉) | |
| 3 | simp3 1023 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → 𝑈 ⊆ 𝑉) | |
| 4 | 2, 3 | unssd 3381 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑇 ∪ 𝑈) ⊆ 𝑉) |
| 5 | ssun1 3368 | . . . . . . 7 ⊢ 𝑇 ⊆ (𝑇 ∪ 𝑈) | |
| 6 | 5 | a1i 9 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → 𝑇 ⊆ (𝑇 ∪ 𝑈)) |
| 7 | lspss.v | . . . . . . 7 ⊢ 𝑉 = (Base‘𝑊) | |
| 8 | lspss.n | . . . . . . 7 ⊢ 𝑁 = (LSpan‘𝑊) | |
| 9 | 7, 8 | lspss 14406 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ (𝑇 ∪ 𝑈) ⊆ 𝑉 ∧ 𝑇 ⊆ (𝑇 ∪ 𝑈)) → (𝑁‘𝑇) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 10 | 1, 4, 6, 9 | syl3anc 1271 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘𝑇) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 11 | ssun2 3369 | . . . . . . 7 ⊢ 𝑈 ⊆ (𝑇 ∪ 𝑈) | |
| 12 | 11 | a1i 9 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → 𝑈 ⊆ (𝑇 ∪ 𝑈)) |
| 13 | 7, 8 | lspss 14406 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ (𝑇 ∪ 𝑈) ⊆ 𝑉 ∧ 𝑈 ⊆ (𝑇 ∪ 𝑈)) → (𝑁‘𝑈) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 14 | 1, 4, 12, 13 | syl3anc 1271 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘𝑈) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 15 | 10, 14 | unssd 3381 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → ((𝑁‘𝑇) ∪ (𝑁‘𝑈)) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 16 | 7, 8 | lspssv 14405 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ (𝑇 ∪ 𝑈) ⊆ 𝑉) → (𝑁‘(𝑇 ∪ 𝑈)) ⊆ 𝑉) |
| 17 | 1, 4, 16 | syl2anc 411 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘(𝑇 ∪ 𝑈)) ⊆ 𝑉) |
| 18 | 15, 17 | sstrd 3235 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → ((𝑁‘𝑇) ∪ (𝑁‘𝑈)) ⊆ 𝑉) |
| 19 | 7, 8 | lspssid 14407 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉) → 𝑇 ⊆ (𝑁‘𝑇)) |
| 20 | 1, 2, 19 | syl2anc 411 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → 𝑇 ⊆ (𝑁‘𝑇)) |
| 21 | 7, 8 | lspssid 14407 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → 𝑈 ⊆ (𝑁‘𝑈)) |
| 22 | unss12 3377 | . . . 4 ⊢ ((𝑇 ⊆ (𝑁‘𝑇) ∧ 𝑈 ⊆ (𝑁‘𝑈)) → (𝑇 ∪ 𝑈) ⊆ ((𝑁‘𝑇) ∪ (𝑁‘𝑈))) | |
| 23 | 20, 21, 22 | 3imp3i2an 1207 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑇 ∪ 𝑈) ⊆ ((𝑁‘𝑇) ∪ (𝑁‘𝑈))) |
| 24 | 7, 8 | lspss 14406 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ ((𝑁‘𝑇) ∪ (𝑁‘𝑈)) ⊆ 𝑉 ∧ (𝑇 ∪ 𝑈) ⊆ ((𝑁‘𝑇) ∪ (𝑁‘𝑈))) → (𝑁‘(𝑇 ∪ 𝑈)) ⊆ (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈)))) |
| 25 | 1, 18, 23, 24 | syl3anc 1271 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘(𝑇 ∪ 𝑈)) ⊆ (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈)))) |
| 26 | 7, 8 | lspss 14406 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ (𝑁‘(𝑇 ∪ 𝑈)) ⊆ 𝑉 ∧ ((𝑁‘𝑇) ∪ (𝑁‘𝑈)) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) → (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈))) ⊆ (𝑁‘(𝑁‘(𝑇 ∪ 𝑈)))) |
| 27 | 1, 17, 15, 26 | syl3anc 1271 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈))) ⊆ (𝑁‘(𝑁‘(𝑇 ∪ 𝑈)))) |
| 28 | 7, 8 | lspidm 14408 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ (𝑇 ∪ 𝑈) ⊆ 𝑉) → (𝑁‘(𝑁‘(𝑇 ∪ 𝑈))) = (𝑁‘(𝑇 ∪ 𝑈))) |
| 29 | 1, 4, 28 | syl2anc 411 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘(𝑁‘(𝑇 ∪ 𝑈))) = (𝑁‘(𝑇 ∪ 𝑈))) |
| 30 | 27, 29 | sseqtrd 3263 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈))) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 31 | 25, 30 | eqssd 3242 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘(𝑇 ∪ 𝑈)) = (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈)))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ w3a 1002 = wceq 1395 ∈ wcel 2200 ∪ cun 3196 ⊆ wss 3198 ‘cfv 5324 Basecbs 13075 LModclmod 14294 LSpanclspn 14393 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4202 ax-sep 4205 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-cnex 8116 ax-resscn 8117 ax-1cn 8118 ax-1re 8119 ax-icn 8120 ax-addcl 8121 ax-addrcl 8122 ax-mulcl 8123 ax-addcom 8125 ax-addass 8127 ax-i2m1 8130 ax-0lt1 8131 ax-0id 8133 ax-rnegex 8134 ax-pre-ltirr 8137 ax-pre-ltadd 8141 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-nul 3493 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-id 4388 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-1st 6298 df-2nd 6299 df-pnf 8209 df-mnf 8210 df-ltxr 8212 df-inn 9137 df-2 9195 df-3 9196 df-4 9197 df-5 9198 df-6 9199 df-ndx 13078 df-slot 13079 df-base 13081 df-sets 13082 df-plusg 13166 df-mulr 13167 df-sca 13169 df-vsca 13170 df-0g 13334 df-mgm 13432 df-sgrp 13478 df-mnd 13493 df-grp 13579 df-minusg 13580 df-sbg 13581 df-mgp 13927 df-ur 13966 df-ring 14004 df-lmod 14296 df-lssm 14360 df-lsp 14394 |
| This theorem is referenced by: lspun0 14432 |
| Copyright terms: Public domain | W3C validator |