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

Theorem cbv2h 1980
 Description: Rule used to change bound variables, using implicit substitution. (Contributed by NM, 5-Aug-1993.)
Hypotheses
Ref Expression
cbv2h.1
cbv2h.2
cbv2h.3
Assertion
Ref Expression
cbv2h

Proof of Theorem cbv2h
StepHypRef Expression
1 cbv2h.1 . . 3
2 cbv2h.2 . . 3
3 cbv2h.3 . . . 4
4 bi1 178 . . . 4
53, 4syl6 29 . . 3
61, 2, 5cbv1h 1978 . 2
7 equcomi 1679 . . . . 5
8 bi2 189 . . . . 5
97, 3, 8syl56 30 . . . 4
102, 1, 9cbv1h 1978 . . 3
1110a7s 1735 . 2
126, 11impbid 183 1
 Colors of variables: wff setvar class Syntax hints:   wi 4   wb 176  wal 1540 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:  cbv2  1981  eujustALT  2207
 Copyright terms: Public domain W3C validator