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

Theorem cbviota 6502
Description: Change bound variables in a description binder. Usage of this theorem is discouraged because it depends on ax-13 2410. Use the weaker cbviotaw 6500 when possible. (Contributed by Andrew Salmon, 1-Aug-2011.) (New usage is discouraged.)
Hypotheses
Ref Expression
cbviota.1 (𝑥 = 𝑦 → (𝜑𝜓))
cbviota.2 𝑦𝜑
cbviota.3 𝑥𝜓
Assertion
Ref Expression
cbviota (℩𝑥𝜑) = (℩𝑦𝜓)

Proof of Theorem cbviota
Dummy variables 𝑧 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 nfv 1941 . . . . . 6 𝑧(𝜑𝑥 = 𝑤)
2 nfs1v 2197 . . . . . . 7 𝑥[𝑧 / 𝑥]𝜑
3 nfv 1941 . . . . . . 7 𝑥 𝑧 = 𝑤
42, 3nfbi 1930 . . . . . 6 𝑥([𝑧 / 𝑥]𝜑𝑧 = 𝑤)
5 sbequ12 2293 . . . . . . 7 (𝑥 = 𝑧 → (𝜑 ↔ [𝑧 / 𝑥]𝜑))
6 equequ1 2052 . . . . . . 7 (𝑥 = 𝑧 → (𝑥 = 𝑤𝑧 = 𝑤))
75, 6bibi12d 348 . . . . . 6 (𝑥 = 𝑧 → ((𝜑𝑥 = 𝑤) ↔ ([𝑧 / 𝑥]𝜑𝑧 = 𝑤)))
81, 4, 7cbvalv1 2379 . . . . 5 (∀𝑥(𝜑𝑥 = 𝑤) ↔ ∀𝑧([𝑧 / 𝑥]𝜑𝑧 = 𝑤))
9 cbviota.2 . . . . . . . 8 𝑦𝜑
109nfsb 2561 . . . . . . 7 𝑦[𝑧 / 𝑥]𝜑
11 nfv 1941 . . . . . . 7 𝑦 𝑧 = 𝑤
1210, 11nfbi 1930 . . . . . 6 𝑦([𝑧 / 𝑥]𝜑𝑧 = 𝑤)
13 nfv 1941 . . . . . 6 𝑧(𝜓𝑦 = 𝑤)
14 sbequ 2123 . . . . . . . 8 (𝑧 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑))
15 cbviota.3 . . . . . . . . 9 𝑥𝜓
16 cbviota.1 . . . . . . . . 9 (𝑥 = 𝑦 → (𝜑𝜓))
1715, 16sbie 2540 . . . . . . . 8 ([𝑦 / 𝑥]𝜑𝜓)
1814, 17bitrdi 290 . . . . . . 7 (𝑧 = 𝑦 → ([𝑧 / 𝑥]𝜑𝜓))
19 equequ1 2052 . . . . . . 7 (𝑧 = 𝑦 → (𝑧 = 𝑤𝑦 = 𝑤))
2018, 19bibi12d 348 . . . . . 6 (𝑧 = 𝑦 → (([𝑧 / 𝑥]𝜑𝑧 = 𝑤) ↔ (𝜓𝑦 = 𝑤)))
2112, 13, 20cbvalv1 2379 . . . . 5 (∀𝑧([𝑧 / 𝑥]𝜑𝑧 = 𝑤) ↔ ∀𝑦(𝜓𝑦 = 𝑤))
228, 21bitri 278 . . . 4 (∀𝑥(𝜑𝑥 = 𝑤) ↔ ∀𝑦(𝜓𝑦 = 𝑤))
2322abbii 2836 . . 3 {𝑤 ∣ ∀𝑥(𝜑𝑥 = 𝑤)} = {𝑤 ∣ ∀𝑦(𝜓𝑦 = 𝑤)}
2423unieqi 4888 . 2 {𝑤 ∣ ∀𝑥(𝜑𝑥 = 𝑤)} = {𝑤 ∣ ∀𝑦(𝜓𝑦 = 𝑤)}
25 dfiota2 6494 . 2 (℩𝑥𝜑) = {𝑤 ∣ ∀𝑥(𝜑𝑥 = 𝑤)}
26 dfiota2 6494 . 2 (℩𝑦𝜓) = {𝑤 ∣ ∀𝑦(𝜓𝑦 = 𝑤)}
2724, 25, 263eqtr4i 2802 1 (℩𝑥𝜑) = (℩𝑦𝜓)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wal 1565   = wceq 1567  wnf 1810  [wsb 2097  {cab 2747   cuni 4876  cio 6491
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-13 2410  ax-ext 2741
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1570  df-ex 1807  df-nf 1811  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-v 3465  df-ss 3930  df-sn 4595  df-uni 4877  df-iota 6493
This theorem is referenced by:  cbviotav  6503  cbvriota  7381
  Copyright terms: Public domain W3C validator