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

Theorem isnmhm 24972
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 24936 . . 3 NMHom = (𝑠 ∈ NrmMod, 𝑡 ∈ NrmMod ↦ ((𝑠 LMHom 𝑡) ∩ (𝑠 NGHom 𝑡)))
21elmpocl 7655 . 2 (𝐹 ∈ (𝑆 NMHom 𝑇) → (𝑆 ∈ NrmMod ∧ 𝑇 ∈ NrmMod))
3 oveq12 7422 . . . . . 6 ((𝑠 = 𝑆𝑡 = 𝑇) → (𝑠 LMHom 𝑡) = (𝑆 LMHom 𝑇))
4 oveq12 7422 . . . . . 6 ((𝑠 = 𝑆𝑡 = 𝑇) → (𝑠 NGHom 𝑡) = (𝑆 NGHom 𝑇))
53, 4ineq12d 4167 . . . . 5 ((𝑠 = 𝑆𝑡 = 𝑇) → ((𝑠 LMHom 𝑡) ∩ (𝑠 NGHom 𝑡)) = ((𝑆 LMHom 𝑇) ∩ (𝑆 NGHom 𝑇)))
6 ovex 7446 . . . . . 6 (𝑆 LMHom 𝑇) ∈ V
76inex1 5280 . . . . 5 ((𝑆 LMHom 𝑇) ∩ (𝑆 NGHom 𝑇)) ∈ V
85, 1, 7ovmpoa 7568 . . . 4 ((𝑆 ∈ NrmMod ∧ 𝑇 ∈ NrmMod) → (𝑆 NMHom 𝑇) = ((𝑆 LMHom 𝑇) ∩ (𝑆 NGHom 𝑇)))
98eleq2d 2846 . . 3 ((𝑆 ∈ NrmMod ∧ 𝑇 ∈ NrmMod) → (𝐹 ∈ (𝑆 NMHom 𝑇) ↔ 𝐹 ∈ ((𝑆 LMHom 𝑇) ∩ (𝑆 NGHom 𝑇))))
10 elin 3915 . . 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 2145  cin 3898  (class class class)co 7413   LMHom clmhm 21203  NrmModcnlm 24806   NGHom cnghm 24932   NMHom cnmhm 24933
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  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 2100  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 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6489  df-fun 6535  df-fv 6541  df-ov 7416  df-oprab 7417  df-mpo 7418  df-nmhm 24936
This theorem is used by:  nmhmrcl1  24973  nmhmrcl2  24974  nmhmlmhm  24975  nmhmnghm  24976  isnmhm2  24978  idnmhm  24980  0nmhm  24981  nmhmco  24982  nmhmplusg  24983  nmhmcn  25348
  Copyright terms: Public domain W3C validator