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

Theorem cbvald 2008
Description: Deduction used to change bound variables, using implicit substitution, particularly useful in conjunction with dvelim 2016. (Contributed by NM, 2-Jan-2002.) (Revised by Mario Carneiro, 6-Oct-2016.)
Hypotheses
Ref Expression
cbvald.1  F/
cbvald.2  F/
cbvald.3
Assertion
Ref Expression
cbvald
Distinct variable groups:   ,   ,
Allowed substitution hints:   ()   (,)   ()

Proof of Theorem cbvald
StepHypRef Expression
1 cbvald.1 . . . 4  F/
21nfri 1762 . . 3
32alrimiv 1631 . 2
4 cbvald.2 . . 3  F/
5 nfvd 1620 . . 3  F/
6 cbvald.3 . . 3
74, 5, 6cbv2 1981 . 2
83, 7syl 15 1
Colors of variables: wff setvar class
Syntax hints:   wi 4   wb 176  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:  cbvexd  2009  cbvaldva  2010
  Copyright terms: Public domain W3C validator