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

Theorem cbvriotaw 7380
Description: Change bound variable in a restricted description binder. Version of cbvriota 7384 with a disjoint variable condition, which does not require ax-13 2401. (Contributed by NM, 18-Mar-2013.) Avoid ax-13 2401. (Revised by GG, 26-Jan-2024.)
Hypotheses
Ref Expression
cbvriotaw.1 𝑦𝜑
cbvriotaw.2 𝑥𝜓
cbvriotaw.3 (𝑥 = 𝑦 → (𝜑𝜓))
Assertion
Ref Expression
cbvriotaw (𝑥𝐴 𝜑) = (𝑦𝐴 𝜓)
Distinct variable group:   𝑥,𝐴,𝑦
Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝜓(𝑥, 𝑦)

Proof of Theorem cbvriotaw
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 eleq1w 2843 . . . . 5 (𝑥 = 𝑧 → (𝑥𝐴𝑧𝐴))
2 sbequ12 2286 . . . . 5 (𝑥 = 𝑧 → (𝜑 ↔ [𝑧 / 𝑥]𝜑))
31, 2anbi12d 644 . . . 4 (𝑥 = 𝑧 → ((𝑥𝐴𝜑) ↔ (𝑧𝐴 ∧ [𝑧 / 𝑥]𝜑)))
4 nfv 1947 . . . 4 𝑧(𝑥𝐴𝜑)
5 nfv 1947 . . . . 5 𝑥 𝑧𝐴
6 nfs1v 2193 . . . . 5 𝑥[𝑧 / 𝑥]𝜑
75, 6nfan 1932 . . . 4 𝑥(𝑧𝐴 ∧ [𝑧 / 𝑥]𝜑)
83, 4, 7cbviotaw 6496 . . 3 (℩𝑥(𝑥𝐴𝜑)) = (℩𝑧(𝑧𝐴 ∧ [𝑧 / 𝑥]𝜑))
9 eleq1w 2843 . . . . 5 (𝑧 = 𝑦 → (𝑧𝐴𝑦𝐴))
10 cbvriotaw.2 . . . . . 6 𝑥𝜓
11 cbvriotaw.3 . . . . . 6 (𝑥 = 𝑦 → (𝜑𝜓))
1210, 11sbhypf 3509 . . . . 5 (𝑧 = 𝑦 → ([𝑧 / 𝑥]𝜑𝜓))
139, 12anbi12d 644 . . . 4 (𝑧 = 𝑦 → ((𝑧𝐴 ∧ [𝑧 / 𝑥]𝜑) ↔ (𝑦𝐴𝜓)))
14 nfv 1947 . . . . 5 𝑦 𝑧𝐴
15 cbvriotaw.1 . . . . . 6 𝑦𝜑
1615nfsbv 2360 . . . . 5 𝑦[𝑧 / 𝑥]𝜑
1714, 16nfan 1932 . . . 4 𝑦(𝑧𝐴 ∧ [𝑧 / 𝑥]𝜑)
18 nfv 1947 . . . 4 𝑧(𝑦𝐴𝜓)
1913, 17, 18cbviotaw 6496 . . 3 (℩𝑧(𝑧𝐴 ∧ [𝑧 / 𝑥]𝜑)) = (℩𝑦(𝑦𝐴𝜓))
208, 19eqtri 2783 . 2 (℩𝑥(𝑥𝐴𝜑)) = (℩𝑦(𝑦𝐴𝜓))
21 df-riota 7371 . 2 (𝑥𝐴 𝜑) = (℩𝑥(𝑥𝐴𝜑))
22 df-riota 7371 . 2 (𝑦𝐴 𝜓) = (℩𝑦(𝑦𝐴𝜓))
2320, 21, 223eqtr4i 2793 1 (𝑥𝐴 𝜑) = (𝑦𝐴 𝜓)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wnf 1816  [wsb 2099  wcel 2145  cio 6487  crio 7370
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-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452  df-ss 3916  df-sn 4585  df-uni 4868  df-iota 6489  df-riota 7371
This theorem is used by:  disjinfi  46025
  Copyright terms: Public domain W3C validator