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

Theorem cbv3 1968
Description: Rule used to change bound variables, using implicit substitution, that does not use ax-c9 2199. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 12-May-2018.)
Hypotheses
Ref Expression
cbv3.1  |-  F/ y
ph
cbv3.2  |-  F/ x ps
cbv3.3  |-  ( x  =  y  ->  ( ph  ->  ps ) )
Assertion
Ref Expression
cbv3  |-  ( A. x ph  ->  A. y ps )

Proof of Theorem cbv3
StepHypRef Expression
1 cbv3.1 . . 3  |-  F/ y
ph
21nfal 1882 . 2  |-  F/ y A. x ph
3 cbv3.2 . . 3  |-  F/ x ps
4 cbv3.3 . . 3  |-  ( x  =  y  ->  ( ph  ->  ps ) )
53, 4spim 1959 . 2  |-  ( A. x ph  ->  ps )
62, 5alrimi 1813 1  |-  ( A. x ph  ->  A. y ps )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4   A.wal 1368   F/wnf 1590
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1592  ax-4 1603  ax-5 1671  ax-6 1710  ax-7 1730  ax-10 1777  ax-11 1782  ax-12 1794  ax-13 1952
This theorem depends on definitions:  df-bi 185  df-an 371  df-ex 1588  df-nf 1591
This theorem is referenced by:  cbv3h  1969  cbv1  1970  cbval  1978  axc16i  2021  mo3OLD  2306  moOLD  2312  axc11next  29800
  Copyright terms: Public domain W3C validator