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

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

Proof of Theorem cbvriota
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 eleq1w 2847 . . . . 5 (𝑥 = 𝑧 → (𝑥 ∈ 𝐴 ↔ 𝑧 ∈ 𝐴))
2 sbequ12 2289 . . . . 5 (𝑥 = 𝑧 → (𝜑 ↔ [𝑧 / 𝑥]𝜑))
31, 2anbi12d 644 . . . 4 (𝑥 = 𝑧 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑧 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑)))
4 nfv 1948 . . . 4 Ⅎ𝑧(𝑥 ∈ 𝐴 ∧ 𝜑)
5 nfv 1948 . . . . 5 Ⅎ𝑥 𝑧 ∈ 𝐴
6 nfs1v 2195 . . . . 5 Ⅎ𝑥[𝑧 / 𝑥]𝜑
75, 6nfan 1933 . . . 4 Ⅎ𝑥(𝑧 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑)
83, 4, 7cbviota 6510 . . 3 (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) = (℩𝑧(𝑧 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑))
9 eleq1w 2847 . . . . 5 (𝑧 = 𝑦 → (𝑧 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
10 sbequ 2121 . . . . . 6 (𝑧 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑))
11 cbvriota.2 . . . . . . 7 Ⅎ𝑥𝜓
12 cbvriota.3 . . . . . . 7 (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
1311, 12sbie 2534 . . . . . 6 ([𝑦 / 𝑥]𝜑 ↔ 𝜓)
1410, 13bitrdi 290 . . . . 5 (𝑧 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ 𝜓))
159, 14anbi12d 644 . . . 4 (𝑧 = 𝑦 → ((𝑧 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑) ↔ (𝑦 ∈ 𝐴 ∧ 𝜓)))
16 nfv 1948 . . . . 5 Ⅎ𝑦 𝑧 ∈ 𝐴
17 cbvriota.1 . . . . . 6 Ⅎ𝑦𝜑
1817nfsb 2555 . . . . 5 Ⅎ𝑦[𝑧 / 𝑥]𝜑
1916, 18nfan 1933 . . . 4 Ⅎ𝑦(𝑧 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑)
20 nfv 1948 . . . 4 Ⅎ𝑧(𝑦 ∈ 𝐴 ∧ 𝜓)
2115, 19, 20cbviota 6510 . . 3 (℩𝑧(𝑧 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑)) = (℩𝑦(𝑦 ∈ 𝐴 ∧ 𝜓))
228, 21eqtri 2786 . 2 (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) = (℩𝑦(𝑦 ∈ 𝐴 ∧ 𝜓))
23 df-riota 7387 . 2 (℩𝑥 ∈ 𝐴 𝜑) = (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
24 df-riota 7387 . 2 (℩𝑦 ∈ 𝐴 𝜓) = (℩𝑦(𝑦 ∈ 𝐴 ∧ 𝜓))
2522, 23, 243eqtr4i 2796 1 (℩𝑥 ∈ 𝐴 𝜑) = (℩𝑦 ∈ 𝐴 𝜓)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569  Ⅎwnf 1815  [wsb 2100   ∈ wcel 2146  ℩cio 6499  ℩crio 7386
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 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-13 2404  ax-ext 2735
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 2101  df-clab 2742  df-cleq 2755  df-clel 2839  df-v 3456  df-ss 3901  df-sn 4589  df-uni 4871  df-iota 6501  df-riota 7387
This theorem is used by:  cbvriotav  7401
  Copyright terms: Public domain W3C validator