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

Theorem cbviin 5041
Description: Change bound variables in an indexed intersection. (Contributed by Jeff Hankins, 26-Aug-2009.) (Revised by Mario Carneiro, 14-Oct-2016.) Add disjoint variable condition to avoid ax-13 2374. See cbviing 5043 for a less restrictive version requiring more axioms. (Revised by GG, 20-Jan-2024.)
Hypotheses
Ref Expression
cbviun.1 𝑦𝐵
cbviun.2 𝑥𝐶
cbviun.3 (𝑥 = 𝑦𝐵 = 𝐶)
Assertion
Ref Expression
cbviin 𝑥𝐴 𝐵 = 𝑦𝐴 𝐶
Distinct variable group:   𝑥,𝑦,𝐴
Allowed substitution hints:   𝐵(𝑥,𝑦)   𝐶(𝑥,𝑦)

Proof of Theorem cbviin
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 cbviun.1 . . . . 5 𝑦𝐵
21nfcri 2894 . . . 4 𝑦 𝑧𝐵
3 cbviun.2 . . . . 5 𝑥𝐶
43nfcri 2894 . . . 4 𝑥 𝑧𝐶
5 cbviun.3 . . . . 5 (𝑥 = 𝑦𝐵 = 𝐶)
65eleq2d 2824 . . . 4 (𝑥 = 𝑦 → (𝑧𝐵𝑧𝐶))
72, 4, 6cbvralw 3303 . . 3 (∀𝑥𝐴 𝑧𝐵 ↔ ∀𝑦𝐴 𝑧𝐶)
87abbii 2806 . 2 {𝑧 ∣ ∀𝑥𝐴 𝑧𝐵} = {𝑧 ∣ ∀𝑦𝐴 𝑧𝐶}
9 df-iin 4998 . 2 𝑥𝐴 𝐵 = {𝑧 ∣ ∀𝑥𝐴 𝑧𝐵}
10 df-iin 4998 . 2 𝑦𝐴 𝐶 = {𝑧 ∣ ∀𝑦𝐴 𝑧𝐶}
118, 9, 103eqtr4i 2772 1 𝑥𝐴 𝐵 = 𝑦𝐴 𝐶
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1536  wcel 2105  {cab 2711  wnfc 2887  wral 3058   ciin 4996
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1791  ax-4 1805  ax-5 1907  ax-6 1964  ax-7 2004  ax-8 2107  ax-9 2115  ax-11 2154  ax-12 2174  ax-ext 2705
This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1776  df-nf 1780  df-sb 2062  df-clab 2712  df-cleq 2726  df-clel 2813  df-nfc 2889  df-ral 3059  df-iin 4998
This theorem is referenced by:  elrfirn2  42683  fnlimfvre  45629  smflimlem6  46731  smflim  46732  smflim2  46761  smfsup  46769  smfinflem  46772  smfinf  46773  smflimsup  46783  smfliminf  46786
  Copyright terms: Public domain W3C validator