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

Theorem isnmhm 25071
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 25035 . . 3 NMHom = (𝑠 ∈ NrmMod, 𝑡 ∈ NrmMod ↦ ((𝑠 LMHom 𝑡) ∩ (𝑠 NGHom 𝑡)))
21elmpocl 7663 . 2 (𝐹 ∈ (𝑆 NMHom 𝑇) → (𝑆 ∈ NrmMod ∧ 𝑇 ∈ NrmMod))
3 oveq12 7430 . . . . . 6 ((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) → (𝑠 LMHom 𝑡) = (𝑆 LMHom 𝑇))
4 oveq12 7430 . . . . . 6 ((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) → (𝑠 NGHom 𝑡) = (𝑆 NGHom 𝑇))
53, 4ineq12d 4118 . . . . 5 ((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) → ((𝑠 LMHom 𝑡) ∩ (𝑠 NGHom 𝑡)) = ((𝑆 LMHom 𝑇) ∩ (𝑆 NGHom 𝑇)))
6 ovex 7454 . . . . . 6 (𝑆 LMHom 𝑇) ∈ V
76inex1 5276 . . . . 5 ((𝑆 LMHom 𝑇) ∩ (𝑆 NGHom 𝑇)) ∈ V
85, 1, 7ovmpoa 7576 . . . 4 ((𝑆 ∈ NrmMod ∧ 𝑇 ∈ NrmMod) → (𝑆 NMHom 𝑇) = ((𝑆 LMHom 𝑇) ∩ (𝑆 NGHom 𝑇)))
98eleq2d 2846 . . 3 ((𝑆 ∈ NrmMod ∧ 𝑇 ∈ NrmMod) → (𝐹 ∈ (𝑆 NMHom 𝑇) ↔ 𝐹 ∈ ((𝑆 LMHom 𝑇) ∩ (𝑆 NGHom 𝑇))))
10 elin 4093 . . 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 1569   ∈ wcel 2144   ∩ cin 4089  (class class class)co 7421   LMHom clmhm 21300  NrmModcnlm 24905   NGHom cnghm 25031   NMHom cnmhm 25032
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-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-iota 6494  df-fun 6541  df-fv 6547  df-ov 7424  df-oprab 7425  df-mpo 7426  df-nmhm 25035
This theorem is used by:  nmhmrcl1  25072  nmhmrcl2  25073  nmhmlmhm  25074  nmhmnghm  25075  isnmhm2  25077  idnmhm  25079  0nmhm  25080  nmhmco  25081  nmhmplusg  25082  nmhmcn  25447
  Copyright terms: Public domain W3C validator