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

Theorem cbvriotav 7392
Description: Change bound variable in a restricted description binder. Usage of this theorem is discouraged because it depends on ax-13 2401. Use the weaker cbvriotavw 7388 when possible. (Contributed by NM, 18-Mar-2013.) (Revised by Mario Carneiro, 15-Oct-2016.) (New usage is discouraged.)
Hypothesis
Ref Expression
cbvriotav.1 (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
Assertion
Ref Expression
cbvriotav (℩𝑥 ∈ 𝐴 𝜑) = (℩𝑦 ∈ 𝐴 𝜓)
Distinct variable groups:   𝑥,𝐴   𝑦,𝐴   𝜑,𝑦   𝜓,𝑥
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)

Proof of Theorem cbvriotav
StepHypRef Expression
1 nfv 1946 . 2 Ⅎ𝑦𝜑
2 nfv 1946 . 2 Ⅎ𝑥𝜓
3 cbvriotav.1 . 2 (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
41, 2, 3cbvriota 7391 1 (℩𝑥 ∈ 𝐴 𝜑) = (℩𝑦 ∈ 𝐴 𝜓)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1569  ℩crio 7377
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-13 2401  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452  df-ss 3896  df-sn 4585  df-uni 4867  df-iota 6494  df-riota 7378
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator