| 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 24645 | . . 3 ⊢ (𝐹 ∈ (𝑆 NGHom 𝑇) → 𝑆 ∈ NrmGrp) | |
| 2 | 1 | 3ad2ant2 1134 | . 2 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → 𝑆 ∈ NrmGrp) |
| 3 | nghmrcl2 24646 | . . 3 ⊢ (𝐹 ∈ (𝑆 NGHom 𝑇) → 𝑇 ∈ NrmGrp) | |
| 4 | 3 | 3ad2ant2 1134 | . 2 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → 𝑇 ∈ NrmGrp) |
| 5 | id 22 | . . 3 ⊢ (𝑇 ∈ Abel → 𝑇 ∈ Abel) | |
| 6 | nghmghm 24647 | . . 3 ⊢ (𝐹 ∈ (𝑆 NGHom 𝑇) → 𝐹 ∈ (𝑆 GrpHom 𝑇)) | |
| 7 | nghmghm 24647 | . . 3 ⊢ (𝐺 ∈ (𝑆 NGHom 𝑇) → 𝐺 ∈ (𝑆 GrpHom 𝑇)) | |
| 8 | nghmplusg.p | . . . 4 ⊢ + = (+g‘𝑇) | |
| 9 | 8 | ghmplusg 19756 | . . 3 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐺 ∈ (𝑆 GrpHom 𝑇)) → (𝐹 ∘f + 𝐺) ∈ (𝑆 GrpHom 𝑇)) |
| 10 | 5, 6, 7, 9 | syl3an 1160 | . 2 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → (𝐹 ∘f + 𝐺) ∈ (𝑆 GrpHom 𝑇)) |
| 11 | eqid 2731 | . . . . 5 ⊢ (𝑆 normOp 𝑇) = (𝑆 normOp 𝑇) | |
| 12 | 11 | nghmcl 24640 | . . . 4 ⊢ (𝐹 ∈ (𝑆 NGHom 𝑇) → ((𝑆 normOp 𝑇)‘𝐹) ∈ ℝ) |
| 13 | 12 | 3ad2ant2 1134 | . . 3 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → ((𝑆 normOp 𝑇)‘𝐹) ∈ ℝ) |
| 14 | 11 | nghmcl 24640 | . . . 4 ⊢ (𝐺 ∈ (𝑆 NGHom 𝑇) → ((𝑆 normOp 𝑇)‘𝐺) ∈ ℝ) |
| 15 | 14 | 3ad2ant3 1135 | . . 3 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → ((𝑆 normOp 𝑇)‘𝐺) ∈ ℝ) |
| 16 | 13, 15 | readdcld 11138 | . 2 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → (((𝑆 normOp 𝑇)‘𝐹) + ((𝑆 normOp 𝑇)‘𝐺)) ∈ ℝ) |
| 17 | 11, 8 | nmotri 24652 | . 2 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → ((𝑆 normOp 𝑇)‘(𝐹 ∘f + 𝐺)) ≤ (((𝑆 normOp 𝑇)‘𝐹) + ((𝑆 normOp 𝑇)‘𝐺))) |
| 18 | 11 | bddnghm 24639 | . 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 2111 class class class wbr 5091 ‘cfv 6481 (class class class)co 7346 ∘f cof 7608 ℝcr 11002 + caddc 11006 ≤ cle 11144 +gcplusg 17158 GrpHom cghm 19122 Abelcabl 19691 NrmGrpcngp 24490 normOp cnmo 24618 NGHom cnghm 24619 |
| 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 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5217 ax-sep 5234 ax-nul 5244 ax-pow 5303 ax-pr 5370 ax-un 7668 ax-cnex 11059 ax-resscn 11060 ax-1cn 11061 ax-icn 11062 ax-addcl 11063 ax-addrcl 11064 ax-mulcl 11065 ax-mulrcl 11066 ax-mulcom 11067 ax-addass 11068 ax-mulass 11069 ax-distr 11070 ax-i2m1 11071 ax-1ne0 11072 ax-1rid 11073 ax-rnegex 11074 ax-rrecex 11075 ax-cnre 11076 ax-pre-lttri 11077 ax-pre-lttrn 11078 ax-pre-ltadd 11079 ax-pre-mulgt0 11080 ax-pre-sup 11081 |
| 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 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4476 df-pw 4552 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-iun 4943 df-br 5092 df-opab 5154 df-mpt 5173 df-tr 5199 df-id 5511 df-eprel 5516 df-po 5524 df-so 5525 df-fr 5569 df-we 5571 df-xp 5622 df-rel 5623 df-cnv 5624 df-co 5625 df-dm 5626 df-rn 5627 df-res 5628 df-ima 5629 df-pred 6248 df-ord 6309 df-on 6310 df-lim 6311 df-suc 6312 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-riota 7303 df-ov 7349 df-oprab 7350 df-mpo 7351 df-of 7610 df-om 7797 df-1st 7921 df-2nd 7922 df-frecs 8211 df-wrecs 8242 df-recs 8291 df-rdg 8329 df-er 8622 df-map 8752 df-en 8870 df-dom 8871 df-sdom 8872 df-sup 9326 df-inf 9327 df-pnf 11145 df-mnf 11146 df-xr 11147 df-ltxr 11148 df-le 11149 df-sub 11343 df-neg 11344 df-div 11772 df-nn 12123 df-2 12185 df-n0 12379 df-z 12466 df-uz 12730 df-q 12844 df-rp 12888 df-xneg 13008 df-xadd 13009 df-xmul 13010 df-ico 13248 df-0g 17342 df-topgen 17344 df-mgm 18545 df-sgrp 18624 df-mnd 18640 df-grp 18846 df-minusg 18847 df-sbg 18848 df-ghm 19123 df-cmn 19692 df-abl 19693 df-psmet 21281 df-xmet 21282 df-met 21283 df-bl 21284 df-mopn 21285 df-top 22807 df-topon 22824 df-topsp 22846 df-bases 22859 df-xms 24233 df-ms 24234 df-nm 24495 df-ngp 24496 df-nmo 24621 df-nghm 24622 |
| This theorem is referenced by: nmhmplusg 24670 |
| Copyright terms: Public domain | W3C validator |