| 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 24926 | . . 3 ⊢ (𝐹 ∈ (𝑆 NGHom 𝑇) → 𝑆 ∈ NrmGrp) | |
| 2 | 1 | 3ad2ant2 1152 | . 2 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → 𝑆 ∈ NrmGrp) |
| 3 | nghmrcl2 24927 | . . 3 ⊢ (𝐹 ∈ (𝑆 NGHom 𝑇) → 𝑇 ∈ NrmGrp) | |
| 4 | 3 | 3ad2ant2 1152 | . 2 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → 𝑇 ∈ NrmGrp) |
| 5 | id 23 | . . 3 ⊢ (𝑇 ∈ Abel → 𝑇 ∈ Abel) | |
| 6 | nghmghm 24928 | . . 3 ⊢ (𝐹 ∈ (𝑆 NGHom 𝑇) → 𝐹 ∈ (𝑆 GrpHom 𝑇)) | |
| 7 | nghmghm 24928 | . . 3 ⊢ (𝐺 ∈ (𝑆 NGHom 𝑇) → 𝐺 ∈ (𝑆 GrpHom 𝑇)) | |
| 8 | nghmplusg.p | . . . 4 ⊢ + = (+g‘𝑇) | |
| 9 | 8 | ghmplusg 19947 | . . 3 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐺 ∈ (𝑆 GrpHom 𝑇)) → (𝐹 ∘f + 𝐺) ∈ (𝑆 GrpHom 𝑇)) |
| 10 | 5, 6, 7, 9 | syl3an 1178 | . 2 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → (𝐹 ∘f + 𝐺) ∈ (𝑆 GrpHom 𝑇)) |
| 11 | eqid 2766 | . . . . 5 ⊢ (𝑆 normOp 𝑇) = (𝑆 normOp 𝑇) | |
| 12 | 11 | nghmcl 24921 | . . . 4 ⊢ (𝐹 ∈ (𝑆 NGHom 𝑇) → ((𝑆 normOp 𝑇)‘𝐹) ∈ ℝ) |
| 13 | 12 | 3ad2ant2 1152 | . . 3 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → ((𝑆 normOp 𝑇)‘𝐹) ∈ ℝ) |
| 14 | 11 | nghmcl 24921 | . . . 4 ⊢ (𝐺 ∈ (𝑆 NGHom 𝑇) → ((𝑆 normOp 𝑇)‘𝐺) ∈ ℝ) |
| 15 | 14 | 3ad2ant3 1153 | . . 3 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → ((𝑆 normOp 𝑇)‘𝐺) ∈ ℝ) |
| 16 | 13, 15 | readdcld 11256 | . 2 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → (((𝑆 normOp 𝑇)‘𝐹) + ((𝑆 normOp 𝑇)‘𝐺)) ∈ ℝ) |
| 17 | 11, 8 | nmotri 24933 | . 2 ⊢ ((𝑇 ∈ Abel ∧ 𝐹 ∈ (𝑆 NGHom 𝑇) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → ((𝑆 normOp 𝑇)‘(𝐹 ∘f + 𝐺)) ≤ (((𝑆 normOp 𝑇)‘𝐹) + ((𝑆 normOp 𝑇)‘𝐺))) |
| 18 | 11 | bddnghm 24920 | . 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 2146 class class class wbr 5114 ‘cfv 6543 (class class class)co 7423 ∘f cof 7685 ℝcr 11117 + caddc 11121 ≤ cle 11262 +gcplusg 17335 GrpHom cghm 19314 Abelcabl 19882 NrmGrpcngp 24771 normOp cnmo 24899 NGHom cnghm 24900 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 ax-cnex 11174 ax-resscn 11175 ax-1cn 11176 ax-icn 11177 ax-addcl 11178 ax-addrcl 11179 ax-mulcl 11180 ax-mulrcl 11181 ax-mulcom 11182 ax-addass 11183 ax-mulass 11184 ax-distr 11185 ax-i2m1 11186 ax-1ne0 11187 ax-1rid 11188 ax-rnegex 11189 ax-rrecex 11190 ax-cnre 11191 ax-pre-lttri 11192 ax-pre-lttrn 11193 ax-pre-ltadd 11194 ax-pre-mulgt0 11195 ax-pre-sup 11196 |
| 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 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-nel 3068 df-ral 3083 df-rex 3093 df-rmo 3372 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5561 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-we 5621 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6309 df-ord 6370 df-on 6371 df-lim 6372 df-suc 6373 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7380 df-ov 7426 df-oprab 7427 df-mpo 7428 df-of 7687 df-om 7872 df-1st 7995 df-2nd 7996 df-frecs 8287 df-wrecs 8318 df-recs 8367 df-rdg 8406 df-er 8703 df-map 8835 df-en 8953 df-dom 8954 df-sdom 8955 df-sup 9412 df-inf 9413 df-pnf 11263 df-mnf 11264 df-xr 11265 df-ltxr 11266 df-le 11267 df-sub 11461 df-neg 11462 df-div 11890 df-nn 12252 df-2 12321 df-n0 12523 df-z 12610 df-uz 12881 df-q 12991 df-rp 13035 df-xneg 13155 df-xadd 13156 df-xmul 13157 df-ico 13396 df-0g 17519 df-topgen 17521 df-mgm 18723 df-sgrp 18806 df-mnd 18822 df-grp 19034 df-minusg 19035 df-sbg 19036 df-ghm 19315 df-cmn 19883 df-abl 19884 df-psmet 21551 df-xmet 21552 df-met 21553 df-bl 21554 df-mopn 21555 df-top 23088 df-topon 23105 df-topsp 23127 df-bases 23140 df-xms 24514 df-ms 24515 df-nm 24776 df-ngp 24777 df-nmo 24902 df-nghm 24903 |
| This theorem is used by: nmhmplusg 24951 |
| Copyright terms: Public domain | W3C validator |