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

Theorem cbvalvw 1702
Description: Change bound variable. Uses only Tarski's FOL axiom schemes. (Contributed by NM, 9-Apr-2017.)
Hypothesis
Ref Expression
cbvalvw.1
Assertion
Ref Expression
cbvalvw
Distinct variable groups:   ,   ,   ,
Allowed substitution hints:   ()   ()

Proof of Theorem cbvalvw
StepHypRef Expression
1 cbvalvw.1 . . . 4
21biimpd 198 . . 3
32cbvalivw 1674 . 2
41biimprd 214 . . . 4
54equcoms 1681 . . 3
65cbvalivw 1674 . 2
73, 6impbii 180 1
Colors of variables: wff setvar class
Syntax hints:   wi 4   wb 176  wal 1540
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675
This theorem depends on definitions:  df-bi 177  df-an 360  df-ex 1542
This theorem is referenced by:  cbvexvw  1703  hba1w  1707  ax11wdemo  1723
  Copyright terms: Public domain W3C validator