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

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

Proof of Theorem isclmi
StepHypRef Expression
1 simp1 1154 . 2 ((𝑊 ∈ LMod ∧ 𝐹 = (ℂfld ↾s 𝐾) ∧ 𝐾 ∈ (SubRing‘ℂfld)) → 𝑊 ∈ LMod)
2 simp2 1155 . . 3 ((𝑊 ∈ LMod ∧ 𝐹 = (ℂfld ↾s 𝐾) ∧ 𝐾 ∈ (SubRing‘ℂfld)) → 𝐹 = (ℂfld ↾s 𝐾))
3 eqid 2761 . . . . . . 7 (ℂfld ↾s 𝐾) = (ℂfld ↾s 𝐾)
43subrgbas 20813 . . . . . 6 (𝐾 ∈ (SubRing‘ℂfld) → 𝐾 = (Base‘(ℂfld ↾s 𝐾)))
543ad2ant3 1153 . . . . 5 ((𝑊 ∈ LMod ∧ 𝐹 = (ℂfld ↾s 𝐾) ∧ 𝐾 ∈ (SubRing‘ℂfld)) → 𝐾 = (Base‘(ℂfld ↾s 𝐾)))
62fveq2d 6881 . . . . 5 ((𝑊 ∈ LMod ∧ 𝐹 = (ℂfld ↾s 𝐾) ∧ 𝐾 ∈ (SubRing‘ℂfld)) → (Base‘𝐹) = (Base‘(ℂfld ↾s 𝐾)))
75, 6eqtr4d 2799 . . . 4 ((𝑊 ∈ LMod ∧ 𝐹 = (ℂfld ↾s 𝐾) ∧ 𝐾 ∈ (SubRing‘ℂfld)) → 𝐾 = (Base‘𝐹))
87oveq2d 7428 . . 3 ((𝑊 ∈ LMod ∧ 𝐹 = (ℂfld ↾s 𝐾) ∧ 𝐾 ∈ (SubRing‘ℂfld)) → (ℂfld ↾s 𝐾) = (ℂfld ↾s (Base‘𝐹)))
92, 8eqtrd 2796 . 2 ((𝑊 ∈ LMod ∧ 𝐹 = (ℂfld ↾s 𝐾) ∧ 𝐾 ∈ (SubRing‘ℂfld)) → 𝐹 = (ℂfld ↾s (Base‘𝐹)))
10 simp3 1156 . . 3 ((𝑊 ∈ LMod ∧ 𝐹 = (ℂfld ↾s 𝐾) ∧ 𝐾 ∈ (SubRing‘ℂfld)) → 𝐾 ∈ (SubRing‘ℂfld))
117, 10eqeltrrd 2862 . 2 ((𝑊 ∈ LMod ∧ 𝐹 = (ℂfld ↾s 𝐾) ∧ 𝐾 ∈ (SubRing‘ℂfld)) → (Base‘𝐹) ∈ (SubRing‘ℂfld))
12 clm0.f . . 3 𝐹 = (Scalar‘𝑊)
13 eqid 2761 . . 3 (Base‘𝐹) = (Base‘𝐹)
1412, 13isclm 25365 . 2 (𝑊 ∈ ℂMod ↔ (𝑊 ∈ LMod ∧ 𝐹 = (ℂfld ↾s (Base‘𝐹)) ∧ (Base‘𝐹) ∈ (SubRing‘ℂfld)))
151, 9, 11, 14syl3anbrc 1362 1 ((𝑊 ∈ LMod ∧ 𝐹 = (ℂfld ↾s 𝐾) ∧ 𝐾 ∈ (SubRing‘ℂfld)) → 𝑊 ∈ ℂMod)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ‘cfv 6531  (class class class)co 7412  Basecbs 17367   ↾s cress 17388  Scalarcsca 17411  SubRingcsubrg 20801  LModclmod 21115  ℂfldccnfld 21658  ℂModcclm 25363
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 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740  ax-cnex 11237  ax-1cn 11239  ax-addcl 11241
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7867  df-2nd 7991  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-nn 12317  df-sets 17322  df-slot 17340  df-ndx 17352  df-base 17368  df-ress 17389  df-subg 19313  df-ring 20441  df-subrg 20802  df-clm 25364
This theorem is used by:  zlmclm  25413  cnstrcvs  25442  cncvs  25446  recvs  25447  qcvs  25448  zclmncvs  25449
  Copyright terms: Public domain W3C validator