ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  cbvalvw GIF version

Theorem cbvalvw 1891
Description: Change bound variable. See cbvalv 1889 for a version with fewer disjoint variable conditions. (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 . 2 (𝑥 = 𝑦 → (𝜑𝜓))
21cbvalv 1889 1 (∀𝑥𝜑 ↔ ∀𝑦𝜓)
Colors of variables: wff set class
Syntax hints:  wi 4  wb 104  wal 1329
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514
This theorem depends on definitions:  df-bi 116  df-nf 1437
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator