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

Theorem spimv 1943
 Description: A version of spim 1928 with a distinct variable requirement instead of a bound variable hypothesis. (Contributed by NM, 5-Aug-1993.)
Hypothesis
Ref Expression
spimv.1
Assertion
Ref Expression
spimv
Distinct variable group:   ,
Allowed substitution hints:   (,)   ()

Proof of Theorem spimv
StepHypRef Expression
1 nfv 1609 . 2
2 spimv.1 . 2
31, 2spim 1928 1
 Colors of variables: wff set class Syntax hints:   wi 4  wal 1530 This theorem is referenced by:  aev  1944  spv  1951  ax16i  1999  aev-o  2134  reu6  2967  el  4208  ax10ext  27709 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878 This theorem depends on definitions:  df-bi 177  df-an 360  df-tru 1310  df-ex 1532  df-nf 1535
 Copyright terms: Public domain W3C validator