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

Theorem clmsca 25379
Description: The ring of scalars 𝐹 of a subcomplex module is the restriction of the field of complex numbers to the base set of 𝐹. (Contributed by Mario Carneiro, 16-Oct-2015.)
Hypotheses
Ref Expression
isclm.f 𝐹 = (Scalar‘𝑊)
isclm.k 𝐾 = (Base‘𝐹)
Assertion
Ref Expression
clmsca (𝑊 ∈ ℂMod → 𝐹 = (ℂfld ↾s 𝐾))

Proof of Theorem clmsca
StepHypRef Expression
1 isclm.f . . 3 𝐹 = (Scalar‘𝑊)
2 isclm.k . . 3 𝐾 = (Base‘𝐹)
31, 2isclm 25378 . 2 (𝑊 ∈ ℂMod ↔ (𝑊 ∈ LMod ∧ 𝐹 = (ℂfld ↾s 𝐾) ∧ 𝐾 ∈ (SubRing‘ℂfld)))
43simp2bi 1164 1 (𝑊 ∈ ℂMod → 𝐹 = (ℂfld ↾s 𝐾))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  ‘cfv 6537  (class class class)co 7418  Basecbs 17380   ↾s cress 17401  Scalarcsca 17424  SubRingcsubrg 20814  LModclmod 21128  ℂfldccnfld 21671  ℂModcclm 25376
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-ext 2733  ax-nul 5260
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-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  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-iota 6493  df-fv 6545  df-ov 7421  df-clm 25377
This theorem is used by:  clm0  25386  clm1  25387  clmadd  25388  clmmul  25389  clmcj  25390  clmsub  25394  clmneg  25395  clmabs  25397  cvsdiv  25446  isncvsngp  25463
  Copyright terms: Public domain W3C validator