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

Theorem cbv2 1921
Description: Rule used to change bound variables, using implicit substitution. (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 3-Oct-2016.)
Hypotheses
Ref Expression
cbv2.1  |-  ( ph  ->  F/ y ps )
cbv2.2  |-  ( ph  ->  F/ x ch )
cbv2.3  |-  ( ph  ->  ( x  =  y  ->  ( ps  <->  ch )
) )
Assertion
Ref Expression
cbv2  |-  ( A. x A. y ph  ->  ( A. x ps  <->  A. y ch ) )

Proof of Theorem cbv2
StepHypRef Expression
1 cbv2.1 . . 3  |-  ( ph  ->  F/ y ps )
21nfrd 1743 . 2  |-  ( ph  ->  ( ps  ->  A. y ps ) )
3 cbv2.2 . . 3  |-  ( ph  ->  F/ x ch )
43nfrd 1743 . 2  |-  ( ph  ->  ( ch  ->  A. x ch ) )
5 cbv2.3 . 2  |-  ( ph  ->  ( x  =  y  ->  ( ps  <->  ch )
) )
62, 4, 5cbv2h 1920 1  |-  ( A. x A. y ph  ->  ( A. x ps  <->  A. y ch ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176   A.wal 1527   F/wnf 1531
This theorem is referenced by:  cbvald  1948
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
This theorem depends on definitions:  df-bi 177  df-an 360  df-ex 1529  df-nf 1532
  Copyright terms: Public domain W3C validator