ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  cbv3 Unicode version

Theorem cbv3 1677
Description: Rule used to change bound variables, using implicit substitution. (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 1513 . 2  |-  F/ y A. x ph
3 cbv3.2 . . 3  |-  F/ x ps
4 cbv3.3 . . 3  |-  ( x  =  y  ->  ( ph  ->  ps ) )
53, 4spim 1673 . 2  |-  ( A. x ph  ->  ps )
62, 5alrimi 1460 1  |-  ( A. x ph  ->  A. y ps )
Colors of variables: wff set class
Syntax hints:    -> wi 4   A.wal 1287   F/wnf 1394
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-4 1445  ax-i9 1468  ax-ial 1472
This theorem depends on definitions:  df-bi 115  df-nf 1395
This theorem is referenced by:  cbv3h  1678  cbv1  1679  mo2n  1976  mo23  1989  setindis  11519  bdsetindis  11521
  Copyright terms: Public domain W3C validator