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

Theorem cbvraldva 3373
Description: Rule used to change the bound variable in a restricted universal quantifier with implicit substitution. Deduction form. (Contributed by David Moews, 1-May-2017.)
Hypothesis
Ref Expression
cbvraldva.1 ((𝜑𝑥 = 𝑦) → (𝜓𝜒))
Assertion
Ref Expression
cbvraldva (𝜑 → (∀𝑥𝐴 𝜓 ↔ ∀𝑦𝐴 𝜒))
Distinct variable groups:   𝜓,𝑦   𝜒,𝑥   𝑥,𝐴,𝑦   𝜑,𝑥,𝑦
Allowed substitution hints:   𝜓(𝑥)   𝜒(𝑦)

Proof of Theorem cbvraldva
StepHypRef Expression
1 cbvraldva.1 . 2 ((𝜑𝑥 = 𝑦) → (𝜓𝜒))
2 eqidd 2779 . 2 ((𝜑𝑥 = 𝑦) → 𝐴 = 𝐴)
31, 2cbvraldva2 3371 1 (𝜑 → (∀𝑥𝐴 𝜓 ↔ ∀𝑦𝐴 𝜒))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 198  wa 386  wral 3090
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1839  ax-4 1853  ax-5 1953  ax-6 2021  ax-7 2055  ax-9 2116  ax-11 2150  ax-12 2163  ax-13 2334  ax-ext 2754
This theorem depends on definitions:  df-bi 199  df-an 387  df-ex 1824  df-nf 1828  df-cleq 2770  df-clel 2774  df-ral 3095
This theorem is referenced by:  wrd2ind  13844  wrd2indOLD  13845  axtgcont  25820
  Copyright terms: Public domain W3C validator