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

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

Proof of Theorem cbvrexdva
StepHypRef Expression
1 cbvraldva.1 . 2 ((𝜑𝑥 = 𝑦) → (𝜓𝜒))
2 eqidd 2140 . 2 ((𝜑𝑥 = 𝑦) → 𝐴 = 𝐴)
31, 2cbvrexdva2 2662 1 (𝜑 → (∃𝑥𝐴 𝜓 ↔ ∃𝑦𝐴 𝜒))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104  wrex 2417
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  ax-ext 2121
This theorem depends on definitions:  df-bi 116  df-nf 1437  df-cleq 2132  df-clel 2135  df-rex 2422
This theorem is referenced by:  tfrlem3ag  6206  tfrlem3a  6207  tfrlemi1  6229  tfr1onlem3ag  6234
  Copyright terms: Public domain W3C validator