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

Theorem cbvrexsv 2847
 Description: Change bound variable by using a substitution. (Contributed by NM, 2-Mar-2008.) (Revised by Andrew Salmon, 11-Jul-2011.)
Assertion
Ref Expression
cbvrexsv
Distinct variable groups:   ,   ,   ,
Allowed substitution hint:   ()

Proof of Theorem cbvrexsv
Dummy variable is distinct from all other variables.
StepHypRef Expression
1 nfv 1619 . . 3
2 nfs1v 2106 . . 3
3 sbequ12 1919 . . 3
41, 2, 3cbvrex 2832 . 2
5 nfv 1619 . . . 4
65nfsb 2109 . . 3
7 nfv 1619 . . 3
8 sbequ 2060 . . 3
96, 7, 8cbvrex 2832 . 2
104, 9bitri 240 1
 Colors of variables: wff setvar class Syntax hints:   wb 176  wsb 1648  wrex 2615 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  ax-ext 2334 This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-cleq 2346  df-clel 2349  df-nfc 2478  df-ral 2619  df-rex 2620 This theorem is referenced by:  rspesbca  3126
 Copyright terms: Public domain W3C validator