| 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 2763 | . . . . 5 ⊢ (𝑆 normOp 𝑆) = (𝑆 normOp 𝑆) | |
| 2 | idnghm.2 | . . . . 5 ⊢ 𝑉 = (Base‘𝑆) | |
| 3 | eqid 2763 | . . . . 5 ⊢ (0g‘𝑆) = (0g‘𝑆) | |
| 4 | 1, 2, 3 | nmoid 25088 | . . . 4 ⊢ ((𝑆 ∈ NrmGrp ∧ {(0g‘𝑆)} ⊊ 𝑉) → ((𝑆 normOp 𝑆)‘( I ↾ 𝑉)) = 1) |
| 5 | 1re 11332 | . . . 4 ⊢ 1 ∈ ℝ | |
| 6 | 4, 5 | eqeltrdi 2872 | . . 3 ⊢ ((𝑆 ∈ NrmGrp ∧ {(0g‘𝑆)} ⊊ 𝑉) → ((𝑆 normOp 𝑆)‘( I ↾ 𝑉)) ∈ ℝ) |
| 7 | eleq2 2853 | . . . . . . . . . 10 ⊢ ({(0g‘𝑆)} = 𝑉 → (𝑥 ∈ {(0g‘𝑆)} ↔ 𝑥 ∈ 𝑉)) | |
| 8 | 7 | biimpar 483 | . . . . . . . . 9 ⊢ (({(0g‘𝑆)} = 𝑉 ∧ 𝑥 ∈ 𝑉) → 𝑥 ∈ {(0g‘𝑆)}) |
| 9 | elsni 4601 | . . . . . . . . 9 ⊢ (𝑥 ∈ {(0g‘𝑆)} → 𝑥 = (0g‘𝑆)) | |
| 10 | 8, 9 | syl 18 | . . . . . . . 8 ⊢ (({(0g‘𝑆)} = 𝑉 ∧ 𝑥 ∈ 𝑉) → 𝑥 = (0g‘𝑆)) |
| 11 | 10 | mpteq2dva 5201 | . . . . . . 7 ⊢ ({(0g‘𝑆)} = 𝑉 → (𝑥 ∈ 𝑉 ↦ 𝑥) = (𝑥 ∈ 𝑉 ↦ (0g‘𝑆))) |
| 12 | mptresid 6054 | . . . . . . 7 ⊢ ( I ↾ 𝑉) = (𝑥 ∈ 𝑉 ↦ 𝑥) | |
| 13 | fconstmpt 5717 | . . . . . . 7 ⊢ (𝑉 × {(0g‘𝑆)}) = (𝑥 ∈ 𝑉 ↦ (0g‘𝑆)) | |
| 14 | 11, 12, 13 | 3eqtr4g 2823 | . . . . . 6 ⊢ ({(0g‘𝑆)} = 𝑉 → ( I ↾ 𝑉) = (𝑉 × {(0g‘𝑆)})) |
| 15 | 14 | fveq2d 6909 | . . . . 5 ⊢ ({(0g‘𝑆)} = 𝑉 → ((𝑆 normOp 𝑆)‘( I ↾ 𝑉)) = ((𝑆 normOp 𝑆)‘(𝑉 × {(0g‘𝑆)}))) |
| 16 | 1, 2, 3 | nmo0 25081 | . . . . . 6 ⊢ ((𝑆 ∈ NrmGrp ∧ 𝑆 ∈ NrmGrp) → ((𝑆 normOp 𝑆)‘(𝑉 × {(0g‘𝑆)})) = 0) |
| 17 | 16 | anidms 577 | . . . . 5 ⊢ (𝑆 ∈ NrmGrp → ((𝑆 normOp 𝑆)‘(𝑉 × {(0g‘𝑆)})) = 0) |
| 18 | 15, 17 | sylan9eqr 2820 | . . . 4 ⊢ ((𝑆 ∈ NrmGrp ∧ {(0g‘𝑆)} = 𝑉) → ((𝑆 normOp 𝑆)‘( I ↾ 𝑉)) = 0) |
| 19 | 0re 11334 | . . . 4 ⊢ 0 ∈ ℝ | |
| 20 | 18, 19 | eqeltrdi 2872 | . . 3 ⊢ ((𝑆 ∈ NrmGrp ∧ {(0g‘𝑆)} = 𝑉) → ((𝑆 normOp 𝑆)‘( I ↾ 𝑉)) ∈ ℝ) |
| 21 | ngpgrp 24945 | . . . . . 6 ⊢ (𝑆 ∈ NrmGrp → 𝑆 ∈ Grp) | |
| 22 | 2, 3 | grpidcl 19202 | . . . . . 6 ⊢ (𝑆 ∈ Grp → (0g‘𝑆) ∈ 𝑉) |
| 23 | 21, 22 | syl 18 | . . . . 5 ⊢ (𝑆 ∈ NrmGrp → (0g‘𝑆) ∈ 𝑉) |
| 24 | 23 | snssd 4747 | . . . 4 ⊢ (𝑆 ∈ NrmGrp → {(0g‘𝑆)} ⊆ 𝑉) |
| 25 | sspss 4032 | . . . 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 19471 | . . . 4 ⊢ (𝑆 ∈ Grp → ( I ↾ 𝑉) ∈ (𝑆 GrpHom 𝑆)) |
| 30 | 21, 29 | syl 18 | . . 3 ⊢ (𝑆 ∈ NrmGrp → ( I ↾ 𝑉) ∈ (𝑆 GrpHom 𝑆)) |
| 31 | 1 | isnghm2 25070 | . . 3 ⊢ ((𝑆 ∈ NrmGrp ∧ 𝑆 ∈ NrmGrp ∧ ( I ↾ 𝑉) ∈ (𝑆 GrpHom 𝑆)) → (( I ↾ 𝑉) ∈ (𝑆 NGHom 𝑆) ↔ ((𝑆 normOp 𝑆)‘( I ↾ 𝑉)) ∈ ℝ)) |
| 32 | 28, 30, 31 | mpd3an23 1493 | . 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 2147 ⊆ wss 3900 ⊊ wpss 4016 {csn 4588 ↦ cmpt 5189 I cid 5549 × cxp 5653 ↾ cres 5657 ‘cfv 6555 (class class class)co 7440 ℝcr 11223 0cc0 11224 1c1 11225 Basecbs 17413 0gc0g 17636 Grpcgrp 19170 GrpHom cghm 19453 NrmGrpcngp 24923 normOp cnmo 25051 NGHom cnghm 25052 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7772 ax-cnex 11280 ax-resscn 11281 ax-1cn 11282 ax-icn 11283 ax-addcl 11284 ax-addrcl 11285 ax-mulcl 11286 ax-mulrcl 11287 ax-mulcom 11288 ax-addass 11289 ax-mulass 11290 ax-distr 11291 ax-i2m1 11292 ax-1ne0 11293 ax-1rid 11294 ax-rnegex 11295 ax-rrecex 11296 ax-cnre 11297 ax-pre-lttri 11298 ax-pre-lttrn 11299 ax-pre-ltadd 11300 ax-pre-mulgt0 11301 ax-pre-sup 11302 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6319 df-ord 6380 df-on 6381 df-lim 6382 df-suc 6383 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 df-fv 6563 df-riota 7397 df-ov 7443 df-oprab 7444 df-mpo 7445 df-om 7899 df-1st 8022 df-2nd 8023 df-frecs 8324 df-wrecs 8355 df-recs 8404 df-rdg 8443 df-er 8742 df-map 8874 df-en 8999 df-dom 9000 df-sdom 9001 df-sup 9458 df-inf 9459 df-pnf 11369 df-mnf 11370 df-xr 11371 df-ltxr 11372 df-le 11373 df-sub 11567 df-neg 11568 df-div 11998 df-nn 12360 df-2 12429 df-n0 12631 df-z 12718 df-uz 12990 df-q 13100 df-rp 13145 df-xneg 13265 df-xadd 13266 df-xmul 13267 df-ico 13506 df-0g 17638 df-topgen 17640 df-mgm 18842 df-sgrp 18934 df-mnd 18950 df-mhm 19004 df-grp 19173 df-ghm 19454 df-psmet 21697 df-xmet 21698 df-met 21699 df-bl 21700 df-mopn 21701 df-top 23239 df-topon 23256 df-topsp 23278 df-bases 23291 df-xms 24666 df-ms 24667 df-nm 24928 df-ngp 24929 df-nmo 25054 df-nghm 25055 |
| This theorem is used by: idnmhm 25100 |
| Copyright terms: Public domain | W3C validator |