| 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 24657 | . . 3 ⊢ (𝐹 ∈ (𝑆 NGHom 𝑇) → 𝑆 ∈ NrmGrp) | |
| 2 | 1 | 3ad2ant2 1134 | . 2 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → 𝑆 ∈ NrmGrp) |
| 3 | nghmrcl2 24658 | . . 3 ⊢ (𝐹 ∈ (𝑆 NGHom 𝑇) → 𝑇 ∈ NrmGrp) | |
| 4 | 3 | 3ad2ant2 1134 | . 2 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → 𝑇 ∈ NrmGrp) |
| 5 | id 22 | . . 3 ⊢ (𝑇 ∈ Abel → 𝑇 ∈ Abel) | |
| 6 | nghmghm 24659 | . . 3 ⊢ (𝐹 ∈ (𝑆 NGHom 𝑇) → 𝐹 ∈ (𝑆 GrpHom 𝑇)) | |
| 7 | nghmghm 24659 | . . 3 ⊢ (𝐺 ∈ (𝑆 NGHom 𝑇) → 𝐺 ∈ (𝑆 GrpHom 𝑇)) | |
| 8 | nghmplusg.p | . . . 4 ⊢ + = (+g‘𝑇) | |
| 9 | 8 | ghmplusg 19768 | . . 3 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐺 ∈ (𝑆 GrpHom 𝑇)) → (𝐹 ∘f + 𝐺) ∈ (𝑆 GrpHom 𝑇)) |
| 10 | 5, 6, 7, 9 | syl3an 1160 | . 2 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → (𝐹 ∘f + 𝐺) ∈ (𝑆 GrpHom 𝑇)) |
| 11 | eqid 2733 | . . . . 5 ⊢ (𝑆 normOp 𝑇) = (𝑆 normOp 𝑇) | |
| 12 | 11 | nghmcl 24652 | . . . 4 ⊢ (𝐹 ∈ (𝑆 NGHom 𝑇) → ((𝑆 normOp 𝑇)‘𝐹) ∈ ℝ) |
| 13 | 12 | 3ad2ant2 1134 | . . 3 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → ((𝑆 normOp 𝑇)‘𝐹) ∈ ℝ) |
| 14 | 11 | nghmcl 24652 | . . . 4 ⊢ (𝐺 ∈ (𝑆 NGHom 𝑇) → ((𝑆 normOp 𝑇)‘𝐺) ∈ ℝ) |
| 15 | 14 | 3ad2ant3 1135 | . . 3 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → ((𝑆 normOp 𝑇)‘𝐺) ∈ ℝ) |
| 16 | 13, 15 | readdcld 11151 | . 2 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → (((𝑆 normOp 𝑇)‘𝐹) + ((𝑆 normOp 𝑇)‘𝐺)) ∈ ℝ) |
| 17 | 11, 8 | nmotri 24664 | . 2 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → ((𝑆 normOp 𝑇)‘(𝐹 ∘f + 𝐺)) ≤ (((𝑆 normOp 𝑇)‘𝐹) + ((𝑆 normOp 𝑇)‘𝐺))) |
| 18 | 11 | bddnghm 24651 | . 2 ⊢ (((𝑆 ∈ NrmGrp ∧ 𝑇 ∈ NrmGrp ∧ (𝐹 ∘f + 𝐺) ∈ (𝑆 GrpHom 𝑇)) ∧ ((((𝑆 normOp 𝑇)‘𝐹) + ((𝑆 normOp 𝑇)‘𝐺)) ∈ ℝ ∧ ((𝑆 normOp 𝑇)‘(𝐹 ∘f + 𝐺)) ≤ (((𝑆 normOp 𝑇)‘𝐹) + ((𝑆 normOp 𝑇)‘𝐺)))) → (𝐹 ∘f + 𝐺) ∈ (𝑆 NGHom 𝑇)) |
| 19 | 2, 4, 10, 16, 17, 18 | syl32anc 1380 | 1 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → (𝐹 ∘f + 𝐺) ∈ (𝑆 NGHom 𝑇)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 class class class wbr 5095 ‘cfv 6489 (class class class)co 7355 ∘f cof 7617 ℝcr 11015 + caddc 11019 ≤ cle 11157 +gcplusg 17171 GrpHom cghm 19134 Abelcabl 19703 NrmGrpcngp 24502 normOp cnmo 24630 NGHom cnghm 24631 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-rep 5221 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7677 ax-cnex 11072 ax-resscn 11073 ax-1cn 11074 ax-icn 11075 ax-addcl 11076 ax-addrcl 11077 ax-mulcl 11078 ax-mulrcl 11079 ax-mulcom 11080 ax-addass 11081 ax-mulass 11082 ax-distr 11083 ax-i2m1 11084 ax-1ne0 11085 ax-1rid 11086 ax-rnegex 11087 ax-rrecex 11088 ax-cnre 11089 ax-pre-lttri 11090 ax-pre-lttrn 11091 ax-pre-ltadd 11092 ax-pre-mulgt0 11093 ax-pre-sup 11094 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4861 df-iun 4945 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6256 df-ord 6317 df-on 6318 df-lim 6319 df-suc 6320 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-riota 7312 df-ov 7358 df-oprab 7359 df-mpo 7360 df-of 7619 df-om 7806 df-1st 7930 df-2nd 7931 df-frecs 8220 df-wrecs 8251 df-recs 8300 df-rdg 8338 df-er 8631 df-map 8761 df-en 8879 df-dom 8880 df-sdom 8881 df-sup 9336 df-inf 9337 df-pnf 11158 df-mnf 11159 df-xr 11160 df-ltxr 11161 df-le 11162 df-sub 11356 df-neg 11357 df-div 11785 df-nn 12136 df-2 12198 df-n0 12392 df-z 12479 df-uz 12743 df-q 12857 df-rp 12901 df-xneg 13021 df-xadd 13022 df-xmul 13023 df-ico 13261 df-0g 17355 df-topgen 17357 df-mgm 18558 df-sgrp 18637 df-mnd 18653 df-grp 18859 df-minusg 18860 df-sbg 18861 df-ghm 19135 df-cmn 19704 df-abl 19705 df-psmet 21293 df-xmet 21294 df-met 21295 df-bl 21296 df-mopn 21297 df-top 22819 df-topon 22836 df-topsp 22858 df-bases 22871 df-xms 24245 df-ms 24246 df-nm 24507 df-ngp 24508 df-nmo 24633 df-nghm 24634 |
| This theorem is referenced by: nmhmplusg 24682 |
| Copyright terms: Public domain | W3C validator |