Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  lmodvsdi1OLD Unicode version

Theorem lmodvsdi1OLD 15651
 Description: Obsolete version of lmodvsdi 15650 as of 22-Sep-2015. (Contributed by NM, 10-Jan-2014.) (Revised by Mario Carneiro, 19-Jun-2014.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypotheses
Ref Expression
lmodvsdi.v
lmodvsdi.a
lmodvsdi.f Scalar
lmodvsdi.s
lmodvsdi.k
Assertion
Ref Expression
lmodvsdi1OLD

Proof of Theorem lmodvsdi1OLD
StepHypRef Expression
1 lmodvsdi.v . . . . 5
2 lmodvsdi.a . . . . 5
3 lmodvsdi.f . . . . 5 Scalar
4 lmodvsdi.s . . . . 5
5 lmodvsdi.k . . . . 5
61, 2, 3, 4, 5lmodvsdi 15650 . . . 4
763exp2 1169 . . 3
87imp4b 573 . 2
983impia 1148 1
 Colors of variables: wff set class Syntax hints:   wi 4   wa 358   w3a 934   wceq 1623   wcel 1684  cfv 5255  (class class class)co 5858  cbs 13148   cplusg 13208  Scalarcsca 13211  cvsca 13212  clmod 15627 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-nul 4149 This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-rab 2552  df-v 2790  df-sbc 2992  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-sn 3646  df-pr 3647  df-op 3649  df-uni 3828  df-br 4024  df-iota 5219  df-fv 5263  df-ov 5861  df-lmod 15629
 Copyright terms: Public domain W3C validator