Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  cbvralv Structured version   Visualization version   GIF version

Theorem cbvralv 3402
 Description: Change the bound variable of a restricted universal quantifier using implicit substitution. See cbvralvw 3399 based on fewer axioms , but extra disjoint variables. Usage of this theorem is discouraged because it depends on ax-13 2382. Use the weaker cbvralvw 3399 when possible. (Contributed by NM, 28-Jan-1997.) (New usage is discouraged.)
Hypothesis
Ref Expression
cbvralv.1 (𝑥 = 𝑦 → (𝜑𝜓))
Assertion
Ref Expression
cbvralv (∀𝑥𝐴 𝜑 ↔ ∀𝑦𝐴 𝜓)
Distinct variable groups:   𝑥,𝐴   𝑦,𝐴   𝜑,𝑦   𝜓,𝑥
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)

Proof of Theorem cbvralv
StepHypRef Expression
1 nfv 1915 . 2 𝑦𝜑
2 nfv 1915 . 2 𝑥𝜓
3 cbvralv.1 . 2 (𝑥 = 𝑦 → (𝜑𝜓))
41, 2, 3cbvral 3395 1 (∀𝑥𝐴 𝜑 ↔ ∀𝑦𝐴 𝜓)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209  ∀wral 3109 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2114  ax-10 2143  ax-11 2159  ax-12 2176  ax-13 2382 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-clel 2873  df-nfc 2941  df-ral 3114 This theorem is referenced by:  cbvral2v  3414  cbvral3v  3416
 Copyright terms: Public domain W3C validator