| 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 2760 | . . . . 5 ⊢ (𝑆 normOp 𝑆) = (𝑆 normOp 𝑆) | |
| 2 | idnghm.2 | . . . . 5 ⊢ 𝑉 = (Base‘𝑆) | |
| 3 | eqid 2760 | . . . . 5 ⊢ (0g‘𝑆) = (0g‘𝑆) | |
| 4 | 1, 2, 3 | nmoid 25022 | . . . 4 ⊢ ((𝑆 ∈ NrmGrp ∧ {(0g‘𝑆)} ⊊ 𝑉) → ((𝑆 normOp 𝑆)‘( I ↾ 𝑉)) = 1) |
| 5 | 1re 11279 | . . . 4 ⊢ 1 ∈ ℝ | |
| 6 | 4, 5 | eqeltrdi 2868 | . . 3 ⊢ ((𝑆 ∈ NrmGrp ∧ {(0g‘𝑆)} ⊊ 𝑉) → ((𝑆 normOp 𝑆)‘( I ↾ 𝑉)) ∈ ℝ) |
| 7 | eleq2 2849 | . . . . . . . . . 10 ⊢ ({(0g‘𝑆)} = 𝑉 → (𝑥 ∈ {(0g‘𝑆)} ↔ 𝑥 ∈ 𝑉)) | |
| 8 | 7 | biimpar 483 | . . . . . . . . 9 ⊢ (({(0g‘𝑆)} = 𝑉 ∧ 𝑥 ∈ 𝑉) → 𝑥 ∈ {(0g‘𝑆)}) |
| 9 | elsni 4600 | . . . . . . . . 9 ⊢ (𝑥 ∈ {(0g‘𝑆)} → 𝑥 = (0g‘𝑆)) | |
| 10 | 8, 9 | syl 18 | . . . . . . . 8 ⊢ (({(0g‘𝑆)} = 𝑉 ∧ 𝑥 ∈ 𝑉) → 𝑥 = (0g‘𝑆)) |
| 11 | 10 | mpteq2dva 5197 | . . . . . . 7 ⊢ ({(0g‘𝑆)} = 𝑉 → (𝑥 ∈ 𝑉 ↦ 𝑥) = (𝑥 ∈ 𝑉 ↦ (0g‘𝑆))) |
| 12 | mptresid 6041 | . . . . . . 7 ⊢ ( I ↾ 𝑉) = (𝑥 ∈ 𝑉 ↦ 𝑥) | |
| 13 | fconstmpt 5709 | . . . . . . 7 ⊢ (𝑉 × {(0g‘𝑆)}) = (𝑥 ∈ 𝑉 ↦ (0g‘𝑆)) | |
| 14 | 11, 12, 13 | 3eqtr4g 2820 | . . . . . 6 ⊢ ({(0g‘𝑆)} = 𝑉 → ( I ↾ 𝑉) = (𝑉 × {(0g‘𝑆)})) |
| 15 | 14 | fveq2d 6877 | . . . . 5 ⊢ ({(0g‘𝑆)} = 𝑉 → ((𝑆 normOp 𝑆)‘( I ↾ 𝑉)) = ((𝑆 normOp 𝑆)‘(𝑉 × {(0g‘𝑆)}))) |
| 16 | 1, 2, 3 | nmo0 25015 | . . . . . 6 ⊢ ((𝑆 ∈ NrmGrp ∧ 𝑆 ∈ NrmGrp) → ((𝑆 normOp 𝑆)‘(𝑉 × {(0g‘𝑆)})) = 0) |
| 17 | 16 | anidms 577 | . . . . 5 ⊢ (𝑆 ∈ NrmGrp → ((𝑆 normOp 𝑆)‘(𝑉 × {(0g‘𝑆)})) = 0) |
| 18 | 15, 17 | sylan9eqr 2817 | . . . 4 ⊢ ((𝑆 ∈ NrmGrp ∧ {(0g‘𝑆)} = 𝑉) → ((𝑆 normOp 𝑆)‘( I ↾ 𝑉)) = 0) |
| 19 | 0re 11281 | . . . 4 ⊢ 0 ∈ ℝ | |
| 20 | 18, 19 | eqeltrdi 2868 | . . 3 ⊢ ((𝑆 ∈ NrmGrp ∧ {(0g‘𝑆)} = 𝑉) → ((𝑆 normOp 𝑆)‘( I ↾ 𝑉)) ∈ ℝ) |
| 21 | ngpgrp 24879 | . . . . . 6 ⊢ (𝑆 ∈ NrmGrp → 𝑆 ∈ Grp) | |
| 22 | 2, 3 | grpidcl 19137 | . . . . . 6 ⊢ (𝑆 ∈ Grp → (0g‘𝑆) ∈ 𝑉) |
| 23 | 21, 22 | syl 18 | . . . . 5 ⊢ (𝑆 ∈ NrmGrp → (0g‘𝑆) ∈ 𝑉) |
| 24 | 23 | snssd 4746 | . . . 4 ⊢ (𝑆 ∈ NrmGrp → {(0g‘𝑆)} ⊆ 𝑉) |
| 25 | sspss 4049 | . . . 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 19406 | . . . 4 ⊢ (𝑆 ∈ Grp → ( I ↾ 𝑉) ∈ (𝑆 GrpHom 𝑆)) |
| 30 | 21, 29 | syl 18 | . . 3 ⊢ (𝑆 ∈ NrmGrp → ( I ↾ 𝑉) ∈ (𝑆 GrpHom 𝑆)) |
| 31 | 1 | isnghm2 25004 | . . 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 3898 ⊊ wpss 3899 {csn 4583 ↦ cmpt 5185 I cid 5541 × cxp 5645 ↾ cres 5649 ‘cfv 6527 (class class class)co 7408 ℝcr 11170 0cc0 11171 1c1 11172 Basecbs 17348 0gc0g 17571 Grpcgrp 19105 GrpHom cghm 19388 NrmGrpcngp 24857 normOp cnmo 24985 NGHom cnghm 24986 |
| 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 2213 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7734 ax-cnex 11227 ax-resscn 11228 ax-1cn 11229 ax-icn 11230 ax-addcl 11231 ax-addrcl 11232 ax-mulcl 11233 ax-mulrcl 11234 ax-mulcom 11235 ax-addass 11236 ax-mulass 11237 ax-distr 11238 ax-i2m1 11239 ax-1ne0 11240 ax-1rid 11241 ax-rnegex 11242 ax-rrecex 11243 ax-cnre 11244 ax-pre-lttri 11245 ax-pre-lttrn 11246 ax-pre-ltadd 11247 ax-pre-mulgt0 11248 ax-pre-sup 11249 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6293 df-ord 6354 df-on 6355 df-lim 6356 df-suc 6357 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7861 df-1st 7984 df-2nd 7985 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-er 8695 df-map 8827 df-en 8952 df-dom 8953 df-sdom 8954 df-sup 9412 df-inf 9413 df-pnf 11316 df-mnf 11317 df-xr 11318 df-ltxr 11319 df-le 11320 df-sub 11514 df-neg 11515 df-div 11943 df-nn 12305 df-2 12374 df-n0 12576 df-z 12663 df-uz 12935 df-q 13045 df-rp 13090 df-xneg 13210 df-xadd 13211 df-xmul 13212 df-ico 13451 df-0g 17573 df-topgen 17575 df-mgm 18777 df-sgrp 18869 df-mnd 18885 df-mhm 18939 df-grp 19108 df-ghm 19389 df-psmet 21631 df-xmet 21632 df-met 21633 df-bl 21634 df-mopn 21635 df-top 23173 df-topon 23190 df-topsp 23212 df-bases 23225 df-xms 24600 df-ms 24601 df-nm 24862 df-ngp 24863 df-nmo 24988 df-nghm 24989 |
| This theorem is used by: idnmhm 25034 |
| Copyright terms: Public domain | W3C validator |