| 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 25061 | . . . 4 ⊢ ((𝑆 ∈ NrmGrp ∧ {(0g‘𝑆)} ⊊ 𝑉) → ((𝑆 normOp 𝑆)‘( I ↾ 𝑉)) = 1) |
| 5 | 1re 11308 | . . . 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 6042 | . . . . . . 7 ⊢ ( I ↾ 𝑉) = (𝑥 ∈ 𝑉 ↦ 𝑥) | |
| 13 | fconstmpt 5712 | . . . . . . 7 ⊢ (𝑉 × {(0g‘𝑆)}) = (𝑥 ∈ 𝑉 ↦ (0g‘𝑆)) | |
| 14 | 11, 12, 13 | 3eqtr4g 2820 | . . . . . 6 ⊢ ({(0g‘𝑆)} = 𝑉 → ( I ↾ 𝑉) = (𝑉 × {(0g‘𝑆)})) |
| 15 | 14 | fveq2d 6889 | . . . . 5 ⊢ ({(0g‘𝑆)} = 𝑉 → ((𝑆 normOp 𝑆)‘( I ↾ 𝑉)) = ((𝑆 normOp 𝑆)‘(𝑉 × {(0g‘𝑆)}))) |
| 16 | 1, 2, 3 | nmo0 25054 | . . . . . 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 11310 | . . . 4 ⊢ 0 ∈ ℝ | |
| 20 | 18, 19 | eqeltrdi 2868 | . . 3 ⊢ ((𝑆 ∈ NrmGrp ∧ {(0g‘𝑆)} = 𝑉) → ((𝑆 normOp 𝑆)‘( I ↾ 𝑉)) ∈ ℝ) |
| 21 | ngpgrp 24918 | . . . . . 6 ⊢ (𝑆 ∈ NrmGrp → 𝑆 ∈ Grp) | |
| 22 | 2, 3 | grpidcl 19176 | . . . . . 6 ⊢ (𝑆 ∈ Grp → (0g‘𝑆) ∈ 𝑉) |
| 23 | 21, 22 | syl 18 | . . . . 5 ⊢ (𝑆 ∈ NrmGrp → (0g‘𝑆) ∈ 𝑉) |
| 24 | 23 | snssd 4746 | . . . 4 ⊢ (𝑆 ∈ NrmGrp → {(0g‘𝑆)} ⊆ 𝑉) |
| 25 | sspss 4029 | . . . 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 19445 | . . . 4 ⊢ (𝑆 ∈ Grp → ( I ↾ 𝑉) ∈ (𝑆 GrpHom 𝑆)) |
| 30 | 21, 29 | syl 18 | . . 3 ⊢ (𝑆 ∈ NrmGrp → ( I ↾ 𝑉) ∈ (𝑆 GrpHom 𝑆)) |
| 31 | 1 | isnghm2 25043 | . . 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 1569 ∈ wcel 2144 ⊆ wss 3895 ⊊ wpss 4013 {csn 4583 ↦ cmpt 5185 I cid 5544 × cxp 5648 ↾ cres 5652 ‘cfv 6538 (class class class)co 7420 ℝcr 11199 0cc0 11200 1c1 11201 Basecbs 17387 0gc0g 17610 Grpcgrp 19144 GrpHom cghm 19427 NrmGrpcngp 24896 normOp cnmo 25024 NGHom cnghm 25025 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 ax-pre-sup 11278 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 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 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-er 8717 df-map 8849 df-en 8974 df-dom 8975 df-sdom 8976 df-sup 9434 df-inf 9435 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-div 11974 df-nn 12336 df-2 12405 df-n0 12607 df-z 12694 df-uz 12966 df-q 13076 df-rp 13121 df-xneg 13241 df-xadd 13242 df-xmul 13243 df-ico 13482 df-0g 17612 df-topgen 17614 df-mgm 18816 df-sgrp 18908 df-mnd 18924 df-mhm 18978 df-grp 19147 df-ghm 19428 df-psmet 21670 df-xmet 21671 df-met 21672 df-bl 21673 df-mopn 21674 df-top 23212 df-topon 23229 df-topsp 23251 df-bases 23264 df-xms 24639 df-ms 24640 df-nm 24901 df-ngp 24902 df-nmo 25027 df-nghm 25028 |
| This theorem is used by: idnmhm 25073 |
| Copyright terms: Public domain | W3C validator |