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

Theorem cbv1 1979
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
cbv1.1  F/
cbv1.2  F/
cbv1.3
Assertion
Ref Expression
cbv1

Proof of Theorem cbv1
StepHypRef Expression
1 cbv1.1 . . 3  F/
21nfrd 1763 . 2
3 cbv1.2 . . 3  F/
43nfrd 1763 . 2
5 cbv1.3 . 2
62, 4, 5cbv1h 1978 1
Colors of variables: wff setvar class
Syntax hints:   wi 4  wal 1540   F/wnf 1544
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:  cbv3  1982
  Copyright terms: Public domain W3C validator