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

Theorem cbviotavw 6497
Description: Change bound variables in a description binder. Version of cbviotav 6499 with a disjoint variable condition, which requires fewer axioms . (Contributed by Andrew Salmon, 1-Aug-2011.) (Revised by GG, 30-Sep-2024.)
Hypothesis
Ref Expression
cbviotavw.1 (𝑥 = 𝑦 → (𝜑𝜓))
Assertion
Ref Expression
cbviotavw (℩𝑥𝜑) = (℩𝑦𝜓)
Distinct variable groups:   𝜑,𝑦   𝜓,𝑥   𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)

Proof of Theorem cbviotavw
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 cbviotavw.1 . . . . . 6 (𝑥 = 𝑦 → (𝜑𝜓))
21cbvabv 2830 . . . . 5 {𝑥𝜑} = {𝑦𝜓}
32eqeq1i 2765 . . . 4 ({𝑥𝜑} = {𝑧} ↔ {𝑦𝜓} = {𝑧})
43abbii 2827 . . 3 {𝑧 ∣ {𝑥𝜑} = {𝑧}} = {𝑧 ∣ {𝑦𝜓} = {𝑧}}
54unieqi 4879 . 2 {𝑧 ∣ {𝑥𝜑} = {𝑧}} = {𝑧 ∣ {𝑦𝜓} = {𝑧}}
6 df-iota 6489 . 2 (℩𝑥𝜑) = {𝑧 ∣ {𝑥𝜑} = {𝑧}}
7 df-iota 6489 . 2 (℩𝑦𝜓) = {𝑧 ∣ {𝑦𝜓} = {𝑧}}
85, 6, 73eqtr4i 2793 1 (℩𝑥𝜑) = (℩𝑦𝜓)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209   = wceq 1570  {cab 2738  {csn 4584   cuni 4867  cio 6487
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452  df-ss 3916  df-uni 4868  df-iota 6489
This theorem is used by:  cbvriotavw  7380  oeeui  8590  nosupcbv  27938  noinfcbv  27953  cbvriotavw2  36856  ellimciota  46444  fourierdlem96  47030  fourierdlem97  47031  fourierdlem98  47032  fourierdlem99  47033  fourierdlem105  47039  fourierdlem106  47040  fourierdlem108  47042  fourierdlem110  47044  fourierdlem112  47046  fourierdlem113  47047  fourierdlem115  47049  funressndmafv2rn  48111
  Copyright terms: Public domain W3C validator