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

Theorem cbvmo 2241
 Description: Rule used to change bound variables, using implicit substitution. (Contributed by NM, 9-Mar-1995.) (Revised by Andrew Salmon, 8-Jun-2011.)
Hypotheses
Ref Expression
cbvmo.1
cbvmo.2
cbvmo.3
Assertion
Ref Expression
cbvmo

Proof of Theorem cbvmo
StepHypRef Expression
1 cbvmo.1 . . . 4
2 cbvmo.2 . . . 4
3 cbvmo.3 . . . 4
41, 2, 3cbvex 1985 . . 3
51, 2, 3cbveu 2224 . . 3
64, 5imbi12i 316 . 2
7 df-mo 2209 . 2
8 df-mo 2209 . 2
96, 7, 83bitr4i 268 1
 Colors of variables: wff setvar class Syntax hints:   wi 4   wb 176  wex 1541  wnf 1544  weu 2204  wmo 2205 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-or 359  df-an 360  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-eu 2208  df-mo 2209 This theorem is referenced by:  dffun6f  5123
 Copyright terms: Public domain W3C validator