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

Theorem cbv3 1982
 Description: Rule used to change bound variables, using implicit substitution, that does not use ax-12o 2142. (Contributed by NM, 5-Aug-1993.)
Hypotheses
Ref Expression
cbv3.1
cbv3.2
cbv3.3
Assertion
Ref Expression
cbv3

Proof of Theorem cbv3
StepHypRef Expression
1 cbv3.1 . . . 4
21a1i 10 . . 3
3 cbv3.2 . . . 4
43a1i 10 . . 3
5 cbv3.3 . . . 4
65a1i 10 . . 3
72, 4, 6cbv1 1979 . 2
8 tru 1321 . . 3
98ax-gen 1546 . 2
107, 9mpg 1548 1
 Colors of variables: wff setvar class Syntax hints:   wi 4   wtru 1316  wal 1540  wnf 1544 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 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:  cbval  1984  ax16i  2046  ax16ALT2  2048  sb8  2092  mo  2226
 Copyright terms: Public domain W3C validator