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

Theorem cbvalw 1701
Description: Change bound variable. Uses only Tarski's FOL axiom schemes. (Contributed by NM, 9-Apr-2017.)
Hypotheses
Ref Expression
cbvalw.1
cbvalw.2
cbvalw.3
cbvalw.4
cbvalw.5
Assertion
Ref Expression
cbvalw
Distinct variable group:   ,
Allowed substitution hints:   (,)   (,)

Proof of Theorem cbvalw
StepHypRef Expression
1 cbvalw.1 . . 3
2 cbvalw.2 . . 3
3 cbvalw.5 . . . 4
43biimpd 198 . . 3
51, 2, 4cbvaliw 1673 . 2
6 cbvalw.3 . . 3
7 cbvalw.4 . . 3
83biimprd 214 . . . 4
98equcoms 1681 . . 3
106, 7, 9cbvaliw 1673 . 2
115, 10impbii 180 1
Colors of variables: wff setvar class
Syntax hints:   wn 3   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:  hbn1fw  1705
  Copyright terms: Public domain W3C validator