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

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

Proof of Theorem cbv1h
StepHypRef Expression
1 cbv1h.1 . . . . 5
21sps 1754 . . . 4
32al2imi 1561 . . 3
4 ax-7 1734 . . 3
53, 4syl6 29 . 2
6 cbv1h.3 . . . . . . . 8
76com23 72 . . . . . . 7
8 cbv1h.2 . . . . . . 7
97, 8syl6d 64 . . . . . 6
109al2imi 1561 . . . . 5
11 ax9o 1950 . . . . 5
1210, 11syl6 29 . . . 4
1312al2imi 1561 . . 3
1413a7s 1735 . 2
155, 14syld 40 1
 Colors of variables: wff setvar class Syntax hints:   wi 4  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:  cbv1  1979  cbv2h  1980  cbv3h  1983
 Copyright terms: Public domain W3C validator