MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  isnmhm Structured version   Visualization version   GIF version

Theorem isnmhm 25120
Description: A normed module homomorphism is a left module homomorphism which is also a normed group homomorphism. (Contributed by Mario Carneiro, 18-Oct-2015.)
Assertion
Ref Expression
isnmhm (𝐹 ∈ (𝑆 NMHom 𝑇) ↔ ((𝑆 ∈ NrmMod ∧ 𝑇 ∈ NrmMod) ∧ (𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝐹 ∈ (𝑆 NGHom 𝑇))))

Proof of Theorem isnmhm
Dummy variables 𝑡 𝑠 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-nmhm 25084 . . 3 NMHom = (𝑠 ∈ NrmMod, 𝑡 ∈ NrmMod ↦ ((𝑠 LMHom 𝑡) ∩ (𝑠 NGHom 𝑡)))
21elmpocl 7694 . 2 (𝐹 ∈ (𝑆 NMHom 𝑇) → (𝑆 ∈ NrmMod ∧ 𝑇 ∈ NrmMod))
3 oveq12 7460 . . . . . 6 ((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) → (𝑠 LMHom 𝑡) = (𝑆 LMHom 𝑇))
4 oveq12 7460 . . . . . 6 ((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) → (𝑠 NGHom 𝑡) = (𝑆 NGHom 𝑇))
53, 4ineq12d 4121 . . . . 5 ((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) → ((𝑠 LMHom 𝑡) ∩ (𝑠 NGHom 𝑡)) = ((𝑆 LMHom 𝑇) ∩ (𝑆 NGHom 𝑇)))
6 ovex 7484 . . . . . 6 (𝑆 LMHom 𝑇) ∈ V
76inex1 5284 . . . . 5 ((𝑆 LMHom 𝑇) ∩ (𝑆 NGHom 𝑇)) ∈ V
85, 1, 7ovmpoa 7607 . . . 4 ((𝑆 ∈ NrmMod ∧ 𝑇 ∈ NrmMod) → (𝑆 NMHom 𝑇) = ((𝑆 LMHom 𝑇) ∩ (𝑆 NGHom 𝑇)))
98eleq2d 2850 . . 3 ((𝑆 ∈ NrmMod ∧ 𝑇 ∈ NrmMod) → (𝐹 ∈ (𝑆 NMHom 𝑇) ↔ 𝐹 ∈ ((𝑆 LMHom 𝑇) ∩ (𝑆 NGHom 𝑇))))
10 elin 4096 . . 3 (𝐹 ∈ ((𝑆 LMHom 𝑇) ∩ (𝑆 NGHom 𝑇)) ↔ (𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝐹 ∈ (𝑆 NGHom 𝑇)))
119, 10bitrdi 290 . 2 ((𝑆 ∈ NrmMod ∧ 𝑇 ∈ NrmMod) → (𝐹 ∈ (𝑆 NMHom 𝑇) ↔ (𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝐹 ∈ (𝑆 NGHom 𝑇))))
122, 11biadanii 834 1 (𝐹 ∈ (𝑆 NMHom 𝑇) ↔ ((𝑆 ∈ NrmMod ∧ 𝑇 ∈ NrmMod) ∧ (𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝐹 ∈ (𝑆 NGHom 𝑇))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ∩ cin 4092  (class class class)co 7451   LMHom clmhm 21345  NrmModcnlm 24954   NGHom cnghm 25080   NMHom cnmhm 25081
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 5255  ax-nul 5266  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-nmhm 25084
This theorem is used by:  nmhmrcl1  25121  nmhmrcl2  25122  nmhmlmhm  25123  nmhmnghm  25124  isnmhm2  25126  idnmhm  25128  0nmhm  25129  nmhmco  25130  nmhmplusg  25131  nmhmcn  25496
  Copyright terms: Public domain W3C validator