| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nghmplusg | Structured version Visualization version GIF version | ||
| Description: The sum of two bounded linear operators is bounded linear. (Contributed by Mario Carneiro, 20-Oct-2015.) |
| Ref | Expression |
|---|---|
| nghmplusg.p | ⊢ + = (+g‘𝑇) |
| Ref | Expression |
|---|---|
| nghmplusg | ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → (𝐹 ∘f + 𝐺) ∈ (𝑆 NGHom 𝑇)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nghmrcl1 24958 | . . 3 ⊢ (𝐹 ∈ (𝑆 NGHom 𝑇) → 𝑆 ∈ NrmGrp) | |
| 2 | 1 | 3ad2ant2 1152 | . 2 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → 𝑆 ∈ NrmGrp) |
| 3 | nghmrcl2 24959 | . . 3 ⊢ (𝐹 ∈ (𝑆 NGHom 𝑇) → 𝑇 ∈ NrmGrp) | |
| 4 | 3 | 3ad2ant2 1152 | . 2 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → 𝑇 ∈ NrmGrp) |
| 5 | id 23 | . . 3 ⊢ (𝑇 ∈ Abel → 𝑇 ∈ Abel) | |
| 6 | nghmghm 24960 | . . 3 ⊢ (𝐹 ∈ (𝑆 NGHom 𝑇) → 𝐹 ∈ (𝑆 GrpHom 𝑇)) | |
| 7 | nghmghm 24960 | . . 3 ⊢ (𝐺 ∈ (𝑆 NGHom 𝑇) → 𝐺 ∈ (𝑆 GrpHom 𝑇)) | |
| 8 | nghmplusg.p | . . . 4 ⊢ + = (+g‘𝑇) | |
| 9 | 8 | ghmplusg 19973 | . . 3 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐺 ∈ (𝑆 GrpHom 𝑇)) → (𝐹 ∘f + 𝐺) ∈ (𝑆 GrpHom 𝑇)) |
| 10 | 5, 6, 7, 9 | syl3an 1178 | . 2 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → (𝐹 ∘f + 𝐺) ∈ (𝑆 GrpHom 𝑇)) |
| 11 | eqid 2760 | . . . . 5 ⊢ (𝑆 normOp 𝑇) = (𝑆 normOp 𝑇) | |
| 12 | 11 | nghmcl 24953 | . . . 4 ⊢ (𝐹 ∈ (𝑆 NGHom 𝑇) → ((𝑆 normOp 𝑇)‘𝐹) ∈ ℝ) |
| 13 | 12 | 3ad2ant2 1152 | . . 3 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → ((𝑆 normOp 𝑇)‘𝐹) ∈ ℝ) |
| 14 | 11 | nghmcl 24953 | . . . 4 ⊢ (𝐺 ∈ (𝑆 NGHom 𝑇) → ((𝑆 normOp 𝑇)‘𝐺) ∈ ℝ) |
| 15 | 14 | 3ad2ant3 1153 | . . 3 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → ((𝑆 normOp 𝑇)‘𝐺) ∈ ℝ) |
| 16 | 13, 15 | readdcld 11262 | . 2 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → (((𝑆 normOp 𝑇)‘𝐹) + ((𝑆 normOp 𝑇)‘𝐺)) ∈ ℝ) |
| 17 | 11, 8 | nmotri 24965 | . 2 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → ((𝑆 normOp 𝑇)‘(𝐹 ∘f + 𝐺)) ≤ (((𝑆 normOp 𝑇)‘𝐹) + ((𝑆 normOp 𝑇)‘𝐺))) |
| 18 | 11 | bddnghm 24952 | . 2 ⊢ (((𝑆 ∈ NrmGrp ∧ 𝑇 ∈ NrmGrp ∧ (𝐹 ∘f + 𝐺) ∈ (𝑆 GrpHom 𝑇)) ∧ ((((𝑆 normOp 𝑇)‘𝐹) + ((𝑆 normOp 𝑇)‘𝐺)) ∈ ℝ ∧ ((𝑆 normOp 𝑇)‘(𝐹 ∘f + 𝐺)) ≤ (((𝑆 normOp 𝑇)‘𝐹) + ((𝑆 normOp 𝑇)‘𝐺)))) → (𝐹 ∘f + 𝐺) ∈ (𝑆 NGHom 𝑇)) |
| 19 | 2, 4, 10, 16, 17, 18 | syl32anc 1405 | 1 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → (𝐹 ∘f + 𝐺) ∈ (𝑆 NGHom 𝑇)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 class class class wbr 5103 ‘cfv 6533 (class class class)co 7413 ∘f cof 7676 ℝcr 11123 + caddc 11127 ≤ cle 11268 +gcplusg 17342 GrpHom cghm 19340 Abelcabl 19908 NrmGrpcngp 24803 normOp cnmo 24931 NGHom cnghm 24932 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 ax-pre-sup 11202 |
| 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 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-of 7678 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-er 8696 df-map 8828 df-en 8953 df-dom 8954 df-sdom 8955 df-sup 9412 df-inf 9413 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-div 11896 df-nn 12258 df-2 12327 df-n0 12529 df-z 12616 df-uz 12888 df-q 12998 df-rp 13043 df-xneg 13163 df-xadd 13164 df-xmul 13165 df-ico 13404 df-0g 17526 df-topgen 17528 df-mgm 18730 df-sgrp 18821 df-mnd 18837 df-grp 19060 df-minusg 19061 df-sbg 19062 df-ghm 19341 df-cmn 19909 df-abl 19910 df-psmet 21577 df-xmet 21578 df-met 21579 df-bl 21580 df-mopn 21581 df-top 23119 df-topon 23136 df-topsp 23158 df-bases 23171 df-xms 24546 df-ms 24547 df-nm 24808 df-ngp 24809 df-nmo 24934 df-nghm 24935 |
| This theorem is used by: nmhmplusg 24983 |
| Copyright terms: Public domain | W3C validator |