Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  cbv3 Structured version   Unicode version

Theorem cbv3 2070
 Description: Rule used to change bound variables, using implicit substitution, that does not use ax-c9 32425. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 12-May-2018.)
Hypotheses
Ref Expression
cbv3.1
cbv3.2
cbv3.3
Assertion
Ref Expression
cbv3

Proof of Theorem cbv3
StepHypRef Expression
1 cbv3.1 . . 3
21nfal 2004 . 2
3 cbv3.2 . . 3
4 cbv3.3 . . 3
53, 4spim 2061 . 2
62, 5alrimi 1929 1
 Colors of variables: wff setvar class Syntax hints:   wi 4  wal 1436  wnf 1664 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1666  ax-4 1679  ax-5 1749  ax-6 1795  ax-7 1840  ax-10 1888  ax-11 1893  ax-12 1906  ax-13 2054 This theorem depends on definitions:  df-bi 189  df-an 373  df-ex 1661  df-nf 1665 This theorem is referenced by:  cbv3h  2071  cbv1  2072  cbval  2076  axc16i  2120  bj-mo3OLD  31411
 Copyright terms: Public domain W3C validator