![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > nghmfval | Structured version Visualization version GIF version |
Description: A normed group homomorphism is a group homomorphism with bounded norm. (Contributed by Mario Carneiro, 18-Oct-2015.) |
Ref | Expression |
---|---|
nmofval.1 | ⊢ 𝑁 = (𝑆 normOp 𝑇) |
Ref | Expression |
---|---|
nghmfval | ⊢ (𝑆 NGHom 𝑇) = (◡𝑁 “ ℝ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | oveq12 7420 | . . . . . 6 ⊢ ((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) → (𝑠 normOp 𝑡) = (𝑆 normOp 𝑇)) | |
2 | nmofval.1 | . . . . . 6 ⊢ 𝑁 = (𝑆 normOp 𝑇) | |
3 | 1, 2 | eqtr4di 2788 | . . . . 5 ⊢ ((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) → (𝑠 normOp 𝑡) = 𝑁) |
4 | 3 | cnveqd 5874 | . . . 4 ⊢ ((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) → ◡(𝑠 normOp 𝑡) = ◡𝑁) |
5 | 4 | imaeq1d 6057 | . . 3 ⊢ ((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) → (◡(𝑠 normOp 𝑡) “ ℝ) = (◡𝑁 “ ℝ)) |
6 | df-nghm 24446 | . . 3 ⊢ NGHom = (𝑠 ∈ NrmGrp, 𝑡 ∈ NrmGrp ↦ (◡(𝑠 normOp 𝑡) “ ℝ)) | |
7 | 2 | ovexi 7445 | . . . . 5 ⊢ 𝑁 ∈ V |
8 | 7 | cnvex 7918 | . . . 4 ⊢ ◡𝑁 ∈ V |
9 | 8 | imaex 7909 | . . 3 ⊢ (◡𝑁 “ ℝ) ∈ V |
10 | 5, 6, 9 | ovmpoa 7565 | . 2 ⊢ ((𝑆 ∈ NrmGrp ∧ 𝑇 ∈ NrmGrp) → (𝑆 NGHom 𝑇) = (◡𝑁 “ ℝ)) |
11 | 6 | mpondm0 7649 | . . 3 ⊢ (¬ (𝑆 ∈ NrmGrp ∧ 𝑇 ∈ NrmGrp) → (𝑆 NGHom 𝑇) = ∅) |
12 | nmoffn 24448 | . . . . . . . . . 10 ⊢ normOp Fn (NrmGrp × NrmGrp) | |
13 | 12 | fndmi 6652 | . . . . . . . . 9 ⊢ dom normOp = (NrmGrp × NrmGrp) |
14 | 13 | ndmov 7593 | . . . . . . . 8 ⊢ (¬ (𝑆 ∈ NrmGrp ∧ 𝑇 ∈ NrmGrp) → (𝑆 normOp 𝑇) = ∅) |
15 | 2, 14 | eqtrid 2782 | . . . . . . 7 ⊢ (¬ (𝑆 ∈ NrmGrp ∧ 𝑇 ∈ NrmGrp) → 𝑁 = ∅) |
16 | 15 | cnveqd 5874 | . . . . . 6 ⊢ (¬ (𝑆 ∈ NrmGrp ∧ 𝑇 ∈ NrmGrp) → ◡𝑁 = ◡∅) |
17 | cnv0 6139 | . . . . . 6 ⊢ ◡∅ = ∅ | |
18 | 16, 17 | eqtrdi 2786 | . . . . 5 ⊢ (¬ (𝑆 ∈ NrmGrp ∧ 𝑇 ∈ NrmGrp) → ◡𝑁 = ∅) |
19 | 18 | imaeq1d 6057 | . . . 4 ⊢ (¬ (𝑆 ∈ NrmGrp ∧ 𝑇 ∈ NrmGrp) → (◡𝑁 “ ℝ) = (∅ “ ℝ)) |
20 | 0ima 6076 | . . . 4 ⊢ (∅ “ ℝ) = ∅ | |
21 | 19, 20 | eqtrdi 2786 | . . 3 ⊢ (¬ (𝑆 ∈ NrmGrp ∧ 𝑇 ∈ NrmGrp) → (◡𝑁 “ ℝ) = ∅) |
22 | 11, 21 | eqtr4d 2773 | . 2 ⊢ (¬ (𝑆 ∈ NrmGrp ∧ 𝑇 ∈ NrmGrp) → (𝑆 NGHom 𝑇) = (◡𝑁 “ ℝ)) |
23 | 10, 22 | pm2.61i 182 | 1 ⊢ (𝑆 NGHom 𝑇) = (◡𝑁 “ ℝ) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ∧ wa 394 = wceq 1539 ∈ wcel 2104 ∅c0 4321 × cxp 5673 ◡ccnv 5674 “ cima 5678 (class class class)co 7411 ℝcr 11111 NrmGrpcngp 24306 normOp cnmo 24442 NGHom cnghm 24443 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7727 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189 ax-pre-sup 11190 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-nfc 2883 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3474 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-id 5573 df-po 5587 df-so 5588 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-riota 7367 df-ov 7414 df-oprab 7415 df-mpo 7416 df-1st 7977 df-2nd 7978 df-er 8705 df-en 8942 df-dom 8943 df-sdom 8944 df-sup 9439 df-inf 9440 df-pnf 11254 df-mnf 11255 df-xr 11256 df-ltxr 11257 df-le 11258 df-sub 11450 df-neg 11451 df-ico 13334 df-nmo 24445 df-nghm 24446 |
This theorem is referenced by: isnghm 24460 |
Copyright terms: Public domain | W3C validator |