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

Theorem cbviota 6446
Description: Change bound variables in a description binder. Usage of this theorem is discouraged because it depends on ax-13 2372. Use the weaker cbviotaw 6444 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 1915 . . . . . 6 𝑧(𝜑𝑥 = 𝑤)
2 nfs1v 2159 . . . . . . 7 𝑥[𝑧 / 𝑥]𝜑
3 nfv 1915 . . . . . . 7 𝑥 𝑧 = 𝑤
42, 3nfbi 1904 . . . . . 6 𝑥([𝑧 / 𝑥]𝜑𝑧 = 𝑤)
5 sbequ12 2254 . . . . . . 7 (𝑥 = 𝑧 → (𝜑 ↔ [𝑧 / 𝑥]𝜑))
6 equequ1 2026 . . . . . . 7 (𝑥 = 𝑧 → (𝑥 = 𝑤𝑧 = 𝑤))
75, 6bibi12d 345 . . . . . 6 (𝑥 = 𝑧 → ((𝜑𝑥 = 𝑤) ↔ ([𝑧 / 𝑥]𝜑𝑧 = 𝑤)))
81, 4, 7cbvalv1 2341 . . . . 5 (∀𝑥(𝜑𝑥 = 𝑤) ↔ ∀𝑧([𝑧 / 𝑥]𝜑𝑧 = 𝑤))
9 cbviota.2 . . . . . . . 8 𝑦𝜑
109nfsb 2523 . . . . . . 7 𝑦[𝑧 / 𝑥]𝜑
11 nfv 1915 . . . . . . 7 𝑦 𝑧 = 𝑤
1210, 11nfbi 1904 . . . . . 6 𝑦([𝑧 / 𝑥]𝜑𝑧 = 𝑤)
13 nfv 1915 . . . . . 6 𝑧(𝜓𝑦 = 𝑤)
14 sbequ 2086 . . . . . . . 8 (𝑧 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑))
15 cbviota.3 . . . . . . . . 9 𝑥𝜓
16 cbviota.1 . . . . . . . . 9 (𝑥 = 𝑦 → (𝜑𝜓))
1715, 16sbie 2502 . . . . . . . 8 ([𝑦 / 𝑥]𝜑𝜓)
1814, 17bitrdi 287 . . . . . . 7 (𝑧 = 𝑦 → ([𝑧 / 𝑥]𝜑𝜓))
19 equequ1 2026 . . . . . . 7 (𝑧 = 𝑦 → (𝑧 = 𝑤𝑦 = 𝑤))
2018, 19bibi12d 345 . . . . . 6 (𝑧 = 𝑦 → (([𝑧 / 𝑥]𝜑𝑧 = 𝑤) ↔ (𝜓𝑦 = 𝑤)))
2112, 13, 20cbvalv1 2341 . . . . 5 (∀𝑧([𝑧 / 𝑥]𝜑𝑧 = 𝑤) ↔ ∀𝑦(𝜓𝑦 = 𝑤))
228, 21bitri 275 . . . 4 (∀𝑥(𝜑𝑥 = 𝑤) ↔ ∀𝑦(𝜓𝑦 = 𝑤))
2322abbii 2798 . . 3 {𝑤 ∣ ∀𝑥(𝜑𝑥 = 𝑤)} = {𝑤 ∣ ∀𝑦(𝜓𝑦 = 𝑤)}
2423unieqi 4868 . 2 {𝑤 ∣ ∀𝑥(𝜑𝑥 = 𝑤)} = {𝑤 ∣ ∀𝑦(𝜓𝑦 = 𝑤)}
25 dfiota2 6438 . 2 (℩𝑥𝜑) = {𝑤 ∣ ∀𝑥(𝜑𝑥 = 𝑤)}
26 dfiota2 6438 . 2 (℩𝑦𝜓) = {𝑤 ∣ ∀𝑦(𝜓𝑦 = 𝑤)}
2724, 25, 263eqtr4i 2764 1 (℩𝑥𝜑) = (℩𝑦𝜓)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wal 1539   = wceq 1541  wnf 1784  [wsb 2067  {cab 2709   cuni 4856  cio 6435
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-13 2372  ax-ext 2703
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1544  df-ex 1781  df-nf 1785  df-sb 2068  df-clab 2710  df-cleq 2723  df-clel 2806  df-v 3438  df-ss 3914  df-sn 4574  df-uni 4857  df-iota 6437
This theorem is referenced by:  cbviotav  6447  cbvriota  7316
  Copyright terms: Public domain W3C validator