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

Theorem isclmi 25311
Description: Reverse direction of isclm 25298. (Contributed by Mario Carneiro, 30-Oct-2015.)
Hypothesis
Ref Expression
clm0.f 𝐹 = (Scalar‘𝑊)
Assertion
Ref Expression
isclmi ((𝑊 ∈ LMod ∧ 𝐹 = (ℂflds 𝐾) ∧ 𝐾 ∈ (SubRing‘ℂfld)) → 𝑊 ∈ ℂMod)

Proof of Theorem isclmi
StepHypRef Expression
1 simp1 1154 . 2 ((𝑊 ∈ LMod ∧ 𝐹 = (ℂflds 𝐾) ∧ 𝐾 ∈ (SubRing‘ℂfld)) → 𝑊 ∈ LMod)
2 simp2 1155 . . 3 ((𝑊 ∈ LMod ∧ 𝐹 = (ℂflds 𝐾) ∧ 𝐾 ∈ (SubRing‘ℂfld)) → 𝐹 = (ℂflds 𝐾))
3 eqid 2762 . . . . . . 7 (ℂflds 𝐾) = (ℂflds 𝐾)
43subrgbas 20749 . . . . . 6 (𝐾 ∈ (SubRing‘ℂfld) → 𝐾 = (Base‘(ℂflds 𝐾)))
543ad2ant3 1153 . . . . 5 ((𝑊 ∈ LMod ∧ 𝐹 = (ℂflds 𝐾) ∧ 𝐾 ∈ (SubRing‘ℂfld)) → 𝐾 = (Base‘(ℂflds 𝐾)))
62fveq2d 6886 . . . . 5 ((𝑊 ∈ LMod ∧ 𝐹 = (ℂflds 𝐾) ∧ 𝐾 ∈ (SubRing‘ℂfld)) → (Base‘𝐹) = (Base‘(ℂflds 𝐾)))
75, 6eqtr4d 2800 . . . 4 ((𝑊 ∈ LMod ∧ 𝐹 = (ℂflds 𝐾) ∧ 𝐾 ∈ (SubRing‘ℂfld)) → 𝐾 = (Base‘𝐹))
87oveq2d 7433 . . 3 ((𝑊 ∈ LMod ∧ 𝐹 = (ℂflds 𝐾) ∧ 𝐾 ∈ (SubRing‘ℂfld)) → (ℂflds 𝐾) = (ℂflds (Base‘𝐹)))
92, 8eqtrd 2797 . 2 ((𝑊 ∈ LMod ∧ 𝐹 = (ℂflds 𝐾) ∧ 𝐾 ∈ (SubRing‘ℂfld)) → 𝐹 = (ℂflds (Base‘𝐹)))
10 simp3 1156 . . 3 ((𝑊 ∈ LMod ∧ 𝐹 = (ℂflds 𝐾) ∧ 𝐾 ∈ (SubRing‘ℂfld)) → 𝐾 ∈ (SubRing‘ℂfld))
117, 10eqeltrrd 2863 . 2 ((𝑊 ∈ LMod ∧ 𝐹 = (ℂflds 𝐾) ∧ 𝐾 ∈ (SubRing‘ℂfld)) → (Base‘𝐹) ∈ (SubRing‘ℂfld))
12 clm0.f . . 3 𝐹 = (Scalar‘𝑊)
13 eqid 2762 . . 3 (Base‘𝐹) = (Base‘𝐹)
1412, 13isclm 25298 . 2 (𝑊 ∈ ℂMod ↔ (𝑊 ∈ LMod ∧ 𝐹 = (ℂflds (Base‘𝐹)) ∧ (Base‘𝐹) ∈ (SubRing‘ℂfld)))
151, 9, 11, 14syl3anbrc 1362 1 ((𝑊 ∈ LMod ∧ 𝐹 = (ℂflds 𝐾) ∧ 𝐾 ∈ (SubRing‘ℂfld)) → 𝑊 ∈ ℂMod)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  w3a 1103   = wceq 1570  wcel 2145  cfv 6537  (class class class)co 7417  Basecbs 17307  s cress 17328  Scalarcsca 17351  SubRingcsubrg 20737  LModclmod 21050  fldccnfld 21591  ℂModcclm 25296
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 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740  ax-cnex 11184  ax-1cn 11186  ax-addcl 11188
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7420  df-oprab 7421  df-mpo 7422  df-om 7867  df-2nd 7991  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-nn 12262  df-sets 17262  df-slot 17280  df-ndx 17292  df-base 17308  df-ress 17329  df-subg 19252  df-ring 20380  df-subrg 20738  df-clm 25297
This theorem is used by:  zlmclm  25346  cnstrcvs  25375  cncvs  25379  recvs  25380  qcvs  25381  zclmncvs  25382
  Copyright terms: Public domain W3C validator