| Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > HSE Home > Th. List > spanun | Structured version Visualization version GIF version | ||
| Description: The span of a union is the subspace sum of spans. (Contributed by NM, 9-Jun-2006.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| spanun | ⊢ ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → (span‘(𝐴 ∪ 𝐵)) = ((span‘𝐴) +ℋ (span‘𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | uneq1 4115 | . . . 4 ⊢ (𝐴 = if(𝐴 ⊆ ℋ, 𝐴, ℋ) → (𝐴 ∪ 𝐵) = (if(𝐴 ⊆ ℋ, 𝐴, ℋ) ∪ 𝐵)) | |
| 2 | 1 | fveq2d 6846 | . . 3 ⊢ (𝐴 = if(𝐴 ⊆ ℋ, 𝐴, ℋ) → (span‘(𝐴 ∪ 𝐵)) = (span‘(if(𝐴 ⊆ ℋ, 𝐴, ℋ) ∪ 𝐵))) |
| 3 | fveq2 6842 | . . . 4 ⊢ (𝐴 = if(𝐴 ⊆ ℋ, 𝐴, ℋ) → (span‘𝐴) = (span‘if(𝐴 ⊆ ℋ, 𝐴, ℋ))) | |
| 4 | 3 | oveq1d 7383 | . . 3 ⊢ (𝐴 = if(𝐴 ⊆ ℋ, 𝐴, ℋ) → ((span‘𝐴) +ℋ (span‘𝐵)) = ((span‘if(𝐴 ⊆ ℋ, 𝐴, ℋ)) +ℋ (span‘𝐵))) |
| 5 | 2, 4 | eqeq12d 2753 | . 2 ⊢ (𝐴 = if(𝐴 ⊆ ℋ, 𝐴, ℋ) → ((span‘(𝐴 ∪ 𝐵)) = ((span‘𝐴) +ℋ (span‘𝐵)) ↔ (span‘(if(𝐴 ⊆ ℋ, 𝐴, ℋ) ∪ 𝐵)) = ((span‘if(𝐴 ⊆ ℋ, 𝐴, ℋ)) +ℋ (span‘𝐵)))) |
| 6 | uneq2 4116 | . . . 4 ⊢ (𝐵 = if(𝐵 ⊆ ℋ, 𝐵, ℋ) → (if(𝐴 ⊆ ℋ, 𝐴, ℋ) ∪ 𝐵) = (if(𝐴 ⊆ ℋ, 𝐴, ℋ) ∪ if(𝐵 ⊆ ℋ, 𝐵, ℋ))) | |
| 7 | 6 | fveq2d 6846 | . . 3 ⊢ (𝐵 = if(𝐵 ⊆ ℋ, 𝐵, ℋ) → (span‘(if(𝐴 ⊆ ℋ, 𝐴, ℋ) ∪ 𝐵)) = (span‘(if(𝐴 ⊆ ℋ, 𝐴, ℋ) ∪ if(𝐵 ⊆ ℋ, 𝐵, ℋ)))) |
| 8 | fveq2 6842 | . . . 4 ⊢ (𝐵 = if(𝐵 ⊆ ℋ, 𝐵, ℋ) → (span‘𝐵) = (span‘if(𝐵 ⊆ ℋ, 𝐵, ℋ))) | |
| 9 | 8 | oveq2d 7384 | . . 3 ⊢ (𝐵 = if(𝐵 ⊆ ℋ, 𝐵, ℋ) → ((span‘if(𝐴 ⊆ ℋ, 𝐴, ℋ)) +ℋ (span‘𝐵)) = ((span‘if(𝐴 ⊆ ℋ, 𝐴, ℋ)) +ℋ (span‘if(𝐵 ⊆ ℋ, 𝐵, ℋ)))) |
| 10 | 7, 9 | eqeq12d 2753 | . 2 ⊢ (𝐵 = if(𝐵 ⊆ ℋ, 𝐵, ℋ) → ((span‘(if(𝐴 ⊆ ℋ, 𝐴, ℋ) ∪ 𝐵)) = ((span‘if(𝐴 ⊆ ℋ, 𝐴, ℋ)) +ℋ (span‘𝐵)) ↔ (span‘(if(𝐴 ⊆ ℋ, 𝐴, ℋ) ∪ if(𝐵 ⊆ ℋ, 𝐵, ℋ))) = ((span‘if(𝐴 ⊆ ℋ, 𝐴, ℋ)) +ℋ (span‘if(𝐵 ⊆ ℋ, 𝐵, ℋ))))) |
| 11 | sseq1 3961 | . . . 4 ⊢ (𝐴 = if(𝐴 ⊆ ℋ, 𝐴, ℋ) → (𝐴 ⊆ ℋ ↔ if(𝐴 ⊆ ℋ, 𝐴, ℋ) ⊆ ℋ)) | |
| 12 | sseq1 3961 | . . . 4 ⊢ ( ℋ = if(𝐴 ⊆ ℋ, 𝐴, ℋ) → ( ℋ ⊆ ℋ ↔ if(𝐴 ⊆ ℋ, 𝐴, ℋ) ⊆ ℋ)) | |
| 13 | ssid 3958 | . . . 4 ⊢ ℋ ⊆ ℋ | |
| 14 | 11, 12, 13 | elimhyp 4547 | . . 3 ⊢ if(𝐴 ⊆ ℋ, 𝐴, ℋ) ⊆ ℋ |
| 15 | sseq1 3961 | . . . 4 ⊢ (𝐵 = if(𝐵 ⊆ ℋ, 𝐵, ℋ) → (𝐵 ⊆ ℋ ↔ if(𝐵 ⊆ ℋ, 𝐵, ℋ) ⊆ ℋ)) | |
| 16 | sseq1 3961 | . . . 4 ⊢ ( ℋ = if(𝐵 ⊆ ℋ, 𝐵, ℋ) → ( ℋ ⊆ ℋ ↔ if(𝐵 ⊆ ℋ, 𝐵, ℋ) ⊆ ℋ)) | |
| 17 | 15, 16, 13 | elimhyp 4547 | . . 3 ⊢ if(𝐵 ⊆ ℋ, 𝐵, ℋ) ⊆ ℋ |
| 18 | 14, 17 | spanuni 31631 | . 2 ⊢ (span‘(if(𝐴 ⊆ ℋ, 𝐴, ℋ) ∪ if(𝐵 ⊆ ℋ, 𝐵, ℋ))) = ((span‘if(𝐴 ⊆ ℋ, 𝐴, ℋ)) +ℋ (span‘if(𝐵 ⊆ ℋ, 𝐵, ℋ))) |
| 19 | 5, 10, 18 | dedth2h 4541 | 1 ⊢ ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → (span‘(𝐴 ∪ 𝐵)) = ((span‘𝐴) +ℋ (span‘𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∪ cun 3901 ⊆ wss 3903 ifcif 4481 ‘cfv 6500 (class class class)co 7368 ℋchba 31006 +ℋ cph 31018 spancspn 31019 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116 ax-addf 11117 ax-mulf 11118 ax-hilex 31086 ax-hfvadd 31087 ax-hvcom 31088 ax-hvass 31089 ax-hv0cl 31090 ax-hvaddid 31091 ax-hfvmul 31092 ax-hvmulid 31093 ax-hvmulass 31094 ax-hvdistr1 31095 ax-hvdistr2 31096 ax-hvmul0 31097 ax-hfi 31166 ax-his1 31169 ax-his2 31170 ax-his3 31171 ax-his4 31172 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-1st 7943 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-er 8645 df-map 8777 df-pm 8778 df-en 8896 df-dom 8897 df-sdom 8898 df-sup 9357 df-inf 9358 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-div 11807 df-nn 12158 df-2 12220 df-3 12221 df-4 12222 df-n0 12414 df-z 12501 df-uz 12764 df-q 12874 df-rp 12918 df-xneg 13038 df-xadd 13039 df-xmul 13040 df-icc 13280 df-seq 13937 df-exp 13997 df-cj 15034 df-re 15035 df-im 15036 df-sqrt 15170 df-abs 15171 df-topgen 17375 df-psmet 21313 df-xmet 21314 df-met 21315 df-bl 21316 df-mopn 21317 df-top 22850 df-topon 22867 df-bases 22902 df-lm 23185 df-haus 23271 df-grpo 30580 df-gid 30581 df-ginv 30582 df-gdiv 30583 df-ablo 30632 df-vc 30646 df-nv 30679 df-va 30682 df-ba 30683 df-sm 30684 df-0v 30685 df-vs 30686 df-nmcv 30687 df-ims 30688 df-hnorm 31055 df-hvsub 31058 df-hlim 31059 df-sh 31294 df-ch 31308 df-ch0 31340 df-shs 31395 df-span 31396 |
| This theorem is referenced by: spanpr 31667 superpos 32441 |
| Copyright terms: Public domain | W3C validator |