| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > idnghm | Structured version Visualization version GIF version | ||
| Description: The identity operator is a normed group homomorphism. (Contributed by Mario Carneiro, 18-Oct-2015.) |
| Ref | Expression |
|---|---|
| idnghm.2 | ⊢ 𝑉 = (Base‘𝑆) |
| Ref | Expression |
|---|---|
| idnghm | ⊢ (𝑆 ∈ NrmGrp → ( I ↾ 𝑉) ∈ (𝑆 NGHom 𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2762 | . . . . 5 ⊢ (𝑆 normOp 𝑆) = (𝑆 normOp 𝑆) | |
| 2 | idnghm.2 | . . . . 5 ⊢ 𝑉 = (Base‘𝑆) | |
| 3 | eqid 2762 | . . . . 5 ⊢ (0g‘𝑆) = (0g‘𝑆) | |
| 4 | 1, 2, 3 | nmoid 24969 | . . . 4 ⊢ ((𝑆 ∈ NrmGrp ∧ {(0g‘𝑆)} ⊊ 𝑉) → ((𝑆 normOp 𝑆)‘( I ↾ 𝑉)) = 1) |
| 5 | 1re 11235 | . . . 4 ⊢ 1 ∈ ℝ | |
| 6 | 4, 5 | eqeltrdi 2870 | . . 3 ⊢ ((𝑆 ∈ NrmGrp ∧ {(0g‘𝑆)} ⊊ 𝑉) → ((𝑆 normOp 𝑆)‘( I ↾ 𝑉)) ∈ ℝ) |
| 7 | eleq2 2851 | . . . . . . . . . 10 ⊢ ({(0g‘𝑆)} = 𝑉 → (𝑥 ∈ {(0g‘𝑆)} ↔ 𝑥 ∈ 𝑉)) | |
| 8 | 7 | biimpar 483 | . . . . . . . . 9 ⊢ (({(0g‘𝑆)} = 𝑉 ∧ 𝑥 ∈ 𝑉) → 𝑥 ∈ {(0g‘𝑆)}) |
| 9 | elsni 4604 | . . . . . . . . 9 ⊢ (𝑥 ∈ {(0g‘𝑆)} → 𝑥 = (0g‘𝑆)) | |
| 10 | 8, 9 | syl 18 | . . . . . . . 8 ⊢ (({(0g‘𝑆)} = 𝑉 ∧ 𝑥 ∈ 𝑉) → 𝑥 = (0g‘𝑆)) |
| 11 | 10 | mpteq2dva 5202 | . . . . . . 7 ⊢ ({(0g‘𝑆)} = 𝑉 → (𝑥 ∈ 𝑉 ↦ 𝑥) = (𝑥 ∈ 𝑉 ↦ (0g‘𝑆))) |
| 12 | mptresid 6051 | . . . . . . 7 ⊢ ( I ↾ 𝑉) = (𝑥 ∈ 𝑉 ↦ 𝑥) | |
| 13 | fconstmpt 5721 | . . . . . . 7 ⊢ (𝑉 × {(0g‘𝑆)}) = (𝑥 ∈ 𝑉 ↦ (0g‘𝑆)) | |
| 14 | 11, 12, 13 | 3eqtr4g 2822 | . . . . . 6 ⊢ ({(0g‘𝑆)} = 𝑉 → ( I ↾ 𝑉) = (𝑉 × {(0g‘𝑆)})) |
| 15 | 14 | fveq2d 6886 | . . . . 5 ⊢ ({(0g‘𝑆)} = 𝑉 → ((𝑆 normOp 𝑆)‘( I ↾ 𝑉)) = ((𝑆 normOp 𝑆)‘(𝑉 × {(0g‘𝑆)}))) |
| 16 | 1, 2, 3 | nmo0 24962 | . . . . . 6 ⊢ ((𝑆 ∈ NrmGrp ∧ 𝑆 ∈ NrmGrp) → ((𝑆 normOp 𝑆)‘(𝑉 × {(0g‘𝑆)})) = 0) |
| 17 | 16 | anidms 577 | . . . . 5 ⊢ (𝑆 ∈ NrmGrp → ((𝑆 normOp 𝑆)‘(𝑉 × {(0g‘𝑆)})) = 0) |
| 18 | 15, 17 | sylan9eqr 2819 | . . . 4 ⊢ ((𝑆 ∈ NrmGrp ∧ {(0g‘𝑆)} = 𝑉) → ((𝑆 normOp 𝑆)‘( I ↾ 𝑉)) = 0) |
| 19 | 0re 11237 | . . . 4 ⊢ 0 ∈ ℝ | |
| 20 | 18, 19 | eqeltrdi 2870 | . . 3 ⊢ ((𝑆 ∈ NrmGrp ∧ {(0g‘𝑆)} = 𝑉) → ((𝑆 normOp 𝑆)‘( I ↾ 𝑉)) ∈ ℝ) |
| 21 | ngpgrp 24826 | . . . . . 6 ⊢ (𝑆 ∈ NrmGrp → 𝑆 ∈ Grp) | |
| 22 | 2, 3 | grpidcl 19090 | . . . . . 6 ⊢ (𝑆 ∈ Grp → (0g‘𝑆) ∈ 𝑉) |
| 23 | 21, 22 | syl 18 | . . . . 5 ⊢ (𝑆 ∈ NrmGrp → (0g‘𝑆) ∈ 𝑉) |
| 24 | 23 | snssd 4750 | . . . 4 ⊢ (𝑆 ∈ NrmGrp → {(0g‘𝑆)} ⊆ 𝑉) |
| 25 | sspss 4053 | . . . 4 ⊢ ({(0g‘𝑆)} ⊆ 𝑉 ↔ ({(0g‘𝑆)} ⊊ 𝑉 ∨ {(0g‘𝑆)} = 𝑉)) | |
| 26 | 24, 25 | sylib 221 | . . 3 ⊢ (𝑆 ∈ NrmGrp → ({(0g‘𝑆)} ⊊ 𝑉 ∨ {(0g‘𝑆)} = 𝑉)) |
| 27 | 6, 20, 26 | mpjaodan 973 | . 2 ⊢ (𝑆 ∈ NrmGrp → ((𝑆 normOp 𝑆)‘( I ↾ 𝑉)) ∈ ℝ) |
| 28 | id 23 | . . 3 ⊢ (𝑆 ∈ NrmGrp → 𝑆 ∈ NrmGrp) | |
| 29 | 2 | idghm 19359 | . . . 4 ⊢ (𝑆 ∈ Grp → ( I ↾ 𝑉) ∈ (𝑆 GrpHom 𝑆)) |
| 30 | 21, 29 | syl 18 | . . 3 ⊢ (𝑆 ∈ NrmGrp → ( I ↾ 𝑉) ∈ (𝑆 GrpHom 𝑆)) |
| 31 | 1 | isnghm2 24951 | . . 3 ⊢ ((𝑆 ∈ NrmGrp ∧ 𝑆 ∈ NrmGrp ∧ ( I ↾ 𝑉) ∈ (𝑆 GrpHom 𝑆)) → (( I ↾ 𝑉) ∈ (𝑆 NGHom 𝑆) ↔ ((𝑆 normOp 𝑆)‘( I ↾ 𝑉)) ∈ ℝ)) |
| 32 | 28, 30, 31 | mpd3an23 1492 | . 2 ⊢ (𝑆 ∈ NrmGrp → (( I ↾ 𝑉) ∈ (𝑆 NGHom 𝑆) ↔ ((𝑆 normOp 𝑆)‘( I ↾ 𝑉)) ∈ ℝ)) |
| 33 | 27, 32 | mpbird 260 | 1 ⊢ (𝑆 ∈ NrmGrp → ( I ↾ 𝑉) ∈ (𝑆 NGHom 𝑆)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2145 ⊆ wss 3902 ⊊ wpss 3903 {csn 4587 ↦ cmpt 5190 I cid 5553 × cxp 5657 ↾ cres 5661 ‘cfv 6537 (class class class)co 7416 ℝcr 11126 0cc0 11127 1c1 11128 Basecbs 17305 0gc0g 17528 Grpcgrp 19058 GrpHom cghm 19341 NrmGrpcngp 24804 normOp cnmo 24932 NGHom cnghm 24933 |
| 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 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 ax-pre-sup 11205 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7866 df-1st 7989 df-2nd 7990 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-er 8699 df-map 8831 df-en 8956 df-dom 8957 df-sdom 8958 df-sup 9415 df-inf 9416 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-div 11899 df-nn 12261 df-2 12330 df-n0 12532 df-z 12619 df-uz 12891 df-q 13001 df-rp 13045 df-xneg 13165 df-xadd 13166 df-xmul 13167 df-ico 13406 df-0g 17530 df-topgen 17532 df-mgm 18734 df-sgrp 18823 df-mnd 18839 df-mhm 18892 df-grp 19061 df-ghm 19342 df-psmet 21578 df-xmet 21579 df-met 21580 df-bl 21581 df-mopn 21582 df-top 23120 df-topon 23137 df-topsp 23159 df-bases 23172 df-xms 24547 df-ms 24548 df-nm 24809 df-ngp 24810 df-nmo 24935 df-nghm 24936 |
| This theorem is used by: idnmhm 24981 |
| Copyright terms: Public domain | W3C validator |