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

Theorem cbvrexv2 3603
Description: Rule used to change the bound variable in a restricted existential quantifier with implicit substitution which also changes the quantifier domain. (Contributed by David Moews, 1-May-2017.)
Hypotheses
Ref Expression
cbvralv2.1 (𝑥 = 𝑦 → (𝜓𝜒))
cbvralv2.2 (𝑥 = 𝑦𝐴 = 𝐵)
Assertion
Ref Expression
cbvrexv2 (∃𝑥𝐴 𝜓 ↔ ∃𝑦𝐵 𝜒)
Distinct variable groups:   𝑦,𝐴   𝜓,𝑦   𝑥,𝐵   𝜒,𝑥
Allowed substitution hints:   𝜓(𝑥)   𝜒(𝑦)   𝐴(𝑥)   𝐵(𝑦)

Proof of Theorem cbvrexv2
StepHypRef Expression
1 nfcv 2793 . 2 𝑦𝐴
2 nfcv 2793 . 2 𝑥𝐵
3 nfv 1883 . 2 𝑦𝜓
4 nfv 1883 . 2 𝑥𝜒
5 cbvralv2.2 . 2 (𝑥 = 𝑦𝐴 = 𝐵)
6 cbvralv2.1 . 2 (𝑥 = 𝑦 → (𝜓𝜒))
71, 2, 3, 4, 5, 6cbvrexcsf 3599 1 (∃𝑥𝐴 𝜓 ↔ ∃𝑦𝐵 𝜒)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196   = wceq 1523  wrex 2942
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ral 2946  df-rex 2947  df-sbc 3469  df-csb 3567
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator