Mathbox for Norm Megill < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cbv3OLD7 Unicode version

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

Proof of Theorem cbv3OLD7
StepHypRef Expression
1 cbv3.1OLD7 . . . 4
21a1i 11 . . 3
3 cbv3.2OLD7 . . . 4
43a1i 11 . . 3
5 cbv3.3OLD7 . . . 4
65a1i 11 . . 3
72, 4, 6cbv1OLD7 30117 . 2
8 tru 1331 . . 3
98ax-gen 1556 . 2
107, 9mpg 1558 1
 Colors of variables: wff set class Syntax hints:  ->wi 4   wtru 1326  A.wal 1550  F/wnf 1554 This theorem is referenced by:  cbvalOLD7  30122  ax16ALT2OLD7  30140  sb8OLD7  30153 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1556  ax-5 1567  ax-17 1628  ax-9 1669  ax-8 1690  ax-6 1747  ax-11 1764  ax-12 1955  ax-7v 29839  ax-7OLD7 30075 This theorem depends on definitions:  df-bi 179  df-an 362  df-tru 1329  df-ex 1552  df-nf 1555
 Copyright terms: Public domain W3C validator