NFE Home New Foundations Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  NFE Home  >  Th. List  >  cbvex4v Unicode version

Theorem cbvex4v 2012
Description: Rule used to change bound variables, using implicit substitution. (Contributed by NM, 26-Jul-1995.)
Hypotheses
Ref Expression
cbvex4v.1
cbvex4v.2
Assertion
Ref Expression
cbvex4v
Distinct variable groups:   ,,   ,,   ,,   ,,   ,   ,   ,,,,,
Allowed substitution hints:   (,,,,,)   (,,,)   (,,,,,)

Proof of Theorem cbvex4v
StepHypRef Expression
1 cbvex4v.1 . . . 4
212exbidv 1628 . . 3
32cbvex2v 2007 . 2
4 cbvex4v.2 . . . 4
54cbvex2v 2007 . . 3
652exbii 1583 . 2
73, 6bitri 240 1
Colors of variables: wff setvar class
Syntax hints:   wi 4   wb 176   wa 358  wex 1541
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925
This theorem depends on definitions:  df-bi 177  df-an 360  df-tru 1319  df-ex 1542  df-nf 1545
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator