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

Theorem isnlm 23820
Description: A normed (left) module is a module which is also a normed group over a normed ring, such that the norm distributes over scalar multiplication. (Contributed by Mario Carneiro, 4-Oct-2015.)
Hypotheses
Ref Expression
isnlm.v 𝑉 = (Base‘𝑊)
isnlm.n 𝑁 = (norm‘𝑊)
isnlm.s · = ( ·𝑠𝑊)
isnlm.f 𝐹 = (Scalar‘𝑊)
isnlm.k 𝐾 = (Base‘𝐹)
isnlm.a 𝐴 = (norm‘𝐹)
Assertion
Ref Expression
isnlm (𝑊 ∈ NrmMod ↔ ((𝑊 ∈ NrmGrp ∧ 𝑊 ∈ LMod ∧ 𝐹 ∈ NrmRing) ∧ ∀𝑥𝐾𝑦𝑉 (𝑁‘(𝑥 · 𝑦)) = ((𝐴𝑥) · (𝑁𝑦))))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝑁,𝑦   𝑥,𝑉,𝑦   𝑥,𝐾   𝑥,𝑊,𝑦   𝑥, · ,𝑦
Allowed substitution hints:   𝐹(𝑥,𝑦)   𝐾(𝑦)

Proof of Theorem isnlm
Dummy variables 𝑤 𝑓 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 anass 468 . 2 (((𝑊 ∈ (NrmGrp ∩ LMod) ∧ 𝐹 ∈ NrmRing) ∧ ∀𝑥𝐾𝑦𝑉 (𝑁‘(𝑥 · 𝑦)) = ((𝐴𝑥) · (𝑁𝑦))) ↔ (𝑊 ∈ (NrmGrp ∩ LMod) ∧ (𝐹 ∈ NrmRing ∧ ∀𝑥𝐾𝑦𝑉 (𝑁‘(𝑥 · 𝑦)) = ((𝐴𝑥) · (𝑁𝑦)))))
2 df-3an 1087 . . . 4 ((𝑊 ∈ NrmGrp ∧ 𝑊 ∈ LMod ∧ 𝐹 ∈ NrmRing) ↔ ((𝑊 ∈ NrmGrp ∧ 𝑊 ∈ LMod) ∧ 𝐹 ∈ NrmRing))
3 elin 3907 . . . . 5 (𝑊 ∈ (NrmGrp ∩ LMod) ↔ (𝑊 ∈ NrmGrp ∧ 𝑊 ∈ LMod))
43anbi1i 623 . . . 4 ((𝑊 ∈ (NrmGrp ∩ LMod) ∧ 𝐹 ∈ NrmRing) ↔ ((𝑊 ∈ NrmGrp ∧ 𝑊 ∈ LMod) ∧ 𝐹 ∈ NrmRing))
52, 4bitr4i 277 . . 3 ((𝑊 ∈ NrmGrp ∧ 𝑊 ∈ LMod ∧ 𝐹 ∈ NrmRing) ↔ (𝑊 ∈ (NrmGrp ∩ LMod) ∧ 𝐹 ∈ NrmRing))
65anbi1i 623 . 2 (((𝑊 ∈ NrmGrp ∧ 𝑊 ∈ LMod ∧ 𝐹 ∈ NrmRing) ∧ ∀𝑥𝐾𝑦𝑉 (𝑁‘(𝑥 · 𝑦)) = ((𝐴𝑥) · (𝑁𝑦))) ↔ ((𝑊 ∈ (NrmGrp ∩ LMod) ∧ 𝐹 ∈ NrmRing) ∧ ∀𝑥𝐾𝑦𝑉 (𝑁‘(𝑥 · 𝑦)) = ((𝐴𝑥) · (𝑁𝑦))))
7 fvexd 6783 . . . 4 (𝑤 = 𝑊 → (Scalar‘𝑤) ∈ V)
8 id 22 . . . . . . 7 (𝑓 = (Scalar‘𝑤) → 𝑓 = (Scalar‘𝑤))
9 fveq2 6768 . . . . . . . 8 (𝑤 = 𝑊 → (Scalar‘𝑤) = (Scalar‘𝑊))
10 isnlm.f . . . . . . . 8 𝐹 = (Scalar‘𝑊)
119, 10eqtr4di 2797 . . . . . . 7 (𝑤 = 𝑊 → (Scalar‘𝑤) = 𝐹)
128, 11sylan9eqr 2801 . . . . . 6 ((𝑤 = 𝑊𝑓 = (Scalar‘𝑤)) → 𝑓 = 𝐹)
1312eleq1d 2824 . . . . 5 ((𝑤 = 𝑊𝑓 = (Scalar‘𝑤)) → (𝑓 ∈ NrmRing ↔ 𝐹 ∈ NrmRing))
1412fveq2d 6772 . . . . . . 7 ((𝑤 = 𝑊𝑓 = (Scalar‘𝑤)) → (Base‘𝑓) = (Base‘𝐹))
15 isnlm.k . . . . . . 7 𝐾 = (Base‘𝐹)
1614, 15eqtr4di 2797 . . . . . 6 ((𝑤 = 𝑊𝑓 = (Scalar‘𝑤)) → (Base‘𝑓) = 𝐾)
17 simpl 482 . . . . . . . . 9 ((𝑤 = 𝑊𝑓 = (Scalar‘𝑤)) → 𝑤 = 𝑊)
1817fveq2d 6772 . . . . . . . 8 ((𝑤 = 𝑊𝑓 = (Scalar‘𝑤)) → (Base‘𝑤) = (Base‘𝑊))
19 isnlm.v . . . . . . . 8 𝑉 = (Base‘𝑊)
2018, 19eqtr4di 2797 . . . . . . 7 ((𝑤 = 𝑊𝑓 = (Scalar‘𝑤)) → (Base‘𝑤) = 𝑉)
2117fveq2d 6772 . . . . . . . . . 10 ((𝑤 = 𝑊𝑓 = (Scalar‘𝑤)) → (norm‘𝑤) = (norm‘𝑊))
22 isnlm.n . . . . . . . . . 10 𝑁 = (norm‘𝑊)
2321, 22eqtr4di 2797 . . . . . . . . 9 ((𝑤 = 𝑊𝑓 = (Scalar‘𝑤)) → (norm‘𝑤) = 𝑁)
2417fveq2d 6772 . . . . . . . . . . 11 ((𝑤 = 𝑊𝑓 = (Scalar‘𝑤)) → ( ·𝑠𝑤) = ( ·𝑠𝑊))
25 isnlm.s . . . . . . . . . . 11 · = ( ·𝑠𝑊)
2624, 25eqtr4di 2797 . . . . . . . . . 10 ((𝑤 = 𝑊𝑓 = (Scalar‘𝑤)) → ( ·𝑠𝑤) = · )
2726oveqd 7285 . . . . . . . . 9 ((𝑤 = 𝑊𝑓 = (Scalar‘𝑤)) → (𝑥( ·𝑠𝑤)𝑦) = (𝑥 · 𝑦))
2823, 27fveq12d 6775 . . . . . . . 8 ((𝑤 = 𝑊𝑓 = (Scalar‘𝑤)) → ((norm‘𝑤)‘(𝑥( ·𝑠𝑤)𝑦)) = (𝑁‘(𝑥 · 𝑦)))
2912fveq2d 6772 . . . . . . . . . . 11 ((𝑤 = 𝑊𝑓 = (Scalar‘𝑤)) → (norm‘𝑓) = (norm‘𝐹))
30 isnlm.a . . . . . . . . . . 11 𝐴 = (norm‘𝐹)
3129, 30eqtr4di 2797 . . . . . . . . . 10 ((𝑤 = 𝑊𝑓 = (Scalar‘𝑤)) → (norm‘𝑓) = 𝐴)
3231fveq1d 6770 . . . . . . . . 9 ((𝑤 = 𝑊𝑓 = (Scalar‘𝑤)) → ((norm‘𝑓)‘𝑥) = (𝐴𝑥))
3323fveq1d 6770 . . . . . . . . 9 ((𝑤 = 𝑊𝑓 = (Scalar‘𝑤)) → ((norm‘𝑤)‘𝑦) = (𝑁𝑦))
3432, 33oveq12d 7286 . . . . . . . 8 ((𝑤 = 𝑊𝑓 = (Scalar‘𝑤)) → (((norm‘𝑓)‘𝑥) · ((norm‘𝑤)‘𝑦)) = ((𝐴𝑥) · (𝑁𝑦)))
3528, 34eqeq12d 2755 . . . . . . 7 ((𝑤 = 𝑊𝑓 = (Scalar‘𝑤)) → (((norm‘𝑤)‘(𝑥( ·𝑠𝑤)𝑦)) = (((norm‘𝑓)‘𝑥) · ((norm‘𝑤)‘𝑦)) ↔ (𝑁‘(𝑥 · 𝑦)) = ((𝐴𝑥) · (𝑁𝑦))))
3620, 35raleqbidv 3334 . . . . . 6 ((𝑤 = 𝑊𝑓 = (Scalar‘𝑤)) → (∀𝑦 ∈ (Base‘𝑤)((norm‘𝑤)‘(𝑥( ·𝑠𝑤)𝑦)) = (((norm‘𝑓)‘𝑥) · ((norm‘𝑤)‘𝑦)) ↔ ∀𝑦𝑉 (𝑁‘(𝑥 · 𝑦)) = ((𝐴𝑥) · (𝑁𝑦))))
3716, 36raleqbidv 3334 . . . . 5 ((𝑤 = 𝑊𝑓 = (Scalar‘𝑤)) → (∀𝑥 ∈ (Base‘𝑓)∀𝑦 ∈ (Base‘𝑤)((norm‘𝑤)‘(𝑥( ·𝑠𝑤)𝑦)) = (((norm‘𝑓)‘𝑥) · ((norm‘𝑤)‘𝑦)) ↔ ∀𝑥𝐾𝑦𝑉 (𝑁‘(𝑥 · 𝑦)) = ((𝐴𝑥) · (𝑁𝑦))))
3813, 37anbi12d 630 . . . 4 ((𝑤 = 𝑊𝑓 = (Scalar‘𝑤)) → ((𝑓 ∈ NrmRing ∧ ∀𝑥 ∈ (Base‘𝑓)∀𝑦 ∈ (Base‘𝑤)((norm‘𝑤)‘(𝑥( ·𝑠𝑤)𝑦)) = (((norm‘𝑓)‘𝑥) · ((norm‘𝑤)‘𝑦))) ↔ (𝐹 ∈ NrmRing ∧ ∀𝑥𝐾𝑦𝑉 (𝑁‘(𝑥 · 𝑦)) = ((𝐴𝑥) · (𝑁𝑦)))))
397, 38sbcied 3764 . . 3 (𝑤 = 𝑊 → ([(Scalar‘𝑤) / 𝑓](𝑓 ∈ NrmRing ∧ ∀𝑥 ∈ (Base‘𝑓)∀𝑦 ∈ (Base‘𝑤)((norm‘𝑤)‘(𝑥( ·𝑠𝑤)𝑦)) = (((norm‘𝑓)‘𝑥) · ((norm‘𝑤)‘𝑦))) ↔ (𝐹 ∈ NrmRing ∧ ∀𝑥𝐾𝑦𝑉 (𝑁‘(𝑥 · 𝑦)) = ((𝐴𝑥) · (𝑁𝑦)))))
40 df-nlm 23723 . . 3 NrmMod = {𝑤 ∈ (NrmGrp ∩ LMod) ∣ [(Scalar‘𝑤) / 𝑓](𝑓 ∈ NrmRing ∧ ∀𝑥 ∈ (Base‘𝑓)∀𝑦 ∈ (Base‘𝑤)((norm‘𝑤)‘(𝑥( ·𝑠𝑤)𝑦)) = (((norm‘𝑓)‘𝑥) · ((norm‘𝑤)‘𝑦)))}
4139, 40elrab2 3628 . 2 (𝑊 ∈ NrmMod ↔ (𝑊 ∈ (NrmGrp ∩ LMod) ∧ (𝐹 ∈ NrmRing ∧ ∀𝑥𝐾𝑦𝑉 (𝑁‘(𝑥 · 𝑦)) = ((𝐴𝑥) · (𝑁𝑦)))))
421, 6, 413bitr4ri 303 1 (𝑊 ∈ NrmMod ↔ ((𝑊 ∈ NrmGrp ∧ 𝑊 ∈ LMod ∧ 𝐹 ∈ NrmRing) ∧ ∀𝑥𝐾𝑦𝑉 (𝑁‘(𝑥 · 𝑦)) = ((𝐴𝑥) · (𝑁𝑦))))
Colors of variables: wff setvar class
Syntax hints:  wb 205  wa 395  w3a 1085   = wceq 1541  wcel 2109  wral 3065  Vcvv 3430  [wsbc 3719  cin 3890  cfv 6430  (class class class)co 7268   · cmul 10860  Basecbs 16893  Scalarcsca 16946   ·𝑠 cvsca 16947  LModclmod 20104  normcnm 23713  NrmGrpcngp 23714  NrmRingcnrg 23716  NrmModcnlm 23717
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1801  ax-4 1815  ax-5 1916  ax-6 1974  ax-7 2014  ax-8 2111  ax-9 2119  ax-10 2140  ax-11 2157  ax-12 2174  ax-ext 2710  ax-nul 5233
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1544  df-fal 1554  df-ex 1786  df-nf 1790  df-sb 2071  df-mo 2541  df-eu 2570  df-clab 2717  df-cleq 2731  df-clel 2817  df-ral 3070  df-rex 3071  df-rab 3074  df-v 3432  df-sbc 3720  df-dif 3894  df-un 3896  df-in 3898  df-ss 3908  df-nul 4262  df-if 4465  df-sn 4567  df-pr 4569  df-op 4573  df-uni 4845  df-br 5079  df-iota 6388  df-fv 6438  df-ov 7271  df-nlm 23723
This theorem is referenced by:  nmvs  23821  nlmngp  23822  nlmlmod  23823  nlmnrg  23824  sranlm  23829  lssnlm  23846  isncvsngp  24294  tcphcph  24382  cnzh  31899  rezh  31900
  Copyright terms: Public domain W3C validator