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

Theorem isnmhm 24934
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 24898 . . 3 NMHom = (𝑠 ∈ NrmMod, 𝑡 ∈ NrmMod ↦ ((𝑠 LMHom 𝑡) ∩ (𝑠 NGHom 𝑡)))
21elmpocl 7657 . 2 (𝐹 ∈ (𝑆 NMHom 𝑇) → (𝑆 ∈ NrmMod ∧ 𝑇 ∈ NrmMod))
3 oveq12 7425 . . . . . 6 ((𝑠 = 𝑆𝑡 = 𝑇) → (𝑠 LMHom 𝑡) = (𝑆 LMHom 𝑇))
4 oveq12 7425 . . . . . 6 ((𝑠 = 𝑆𝑡 = 𝑇) → (𝑠 NGHom 𝑡) = (𝑆 NGHom 𝑇))
53, 4ineq12d 4174 . . . . 5 ((𝑠 = 𝑆𝑡 = 𝑇) → ((𝑠 LMHom 𝑡) ∩ (𝑠 NGHom 𝑡)) = ((𝑆 LMHom 𝑇) ∩ (𝑆 NGHom 𝑇)))
6 ovex 7449 . . . . . 6 (𝑆 LMHom 𝑇) ∈ V
76inex1 5288 . . . . 5 ((𝑆 LMHom 𝑇) ∩ (𝑆 NGHom 𝑇)) ∈ V
85, 1, 7ovmpoa 7571 . . . 4 ((𝑆 ∈ NrmMod ∧ 𝑇 ∈ NrmMod) → (𝑆 NMHom 𝑇) = ((𝑆 LMHom 𝑇) ∩ (𝑆 NGHom 𝑇)))
98eleq2d 2851 . . 3 ((𝑆 ∈ NrmMod ∧ 𝑇 ∈ NrmMod) → (𝐹 ∈ (𝑆 NMHom 𝑇) ↔ 𝐹 ∈ ((𝑆 LMHom 𝑇) ∩ (𝑆 NGHom 𝑇))))
10 elin 3922 . . 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 2146  cin 3905  (class class class)co 7416   LMHom clmhm 21170  NrmModcnlm 24768   NGHom cnghm 24894   NMHom cnmhm 24895
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406
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 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-iota 6496  df-fun 6542  df-fv 6548  df-ov 7419  df-oprab 7420  df-mpo 7421  df-nmhm 24898
This theorem is used by:  nmhmrcl1  24935  nmhmrcl2  24936  nmhmlmhm  24937  nmhmnghm  24938  isnmhm2  24940  idnmhm  24942  0nmhm  24943  nmhmco  24944  nmhmplusg  24945  nmhmcn  25310
  Copyright terms: Public domain W3C validator