ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  cbvreu GIF version

Theorem cbvreu 2784
Description: Change the bound variable of a restricted unique existential quantifier using implicit substitution. (Contributed by Mario Carneiro, 15-Oct-2016.)
Hypotheses
Ref Expression
cbvral.1 Ⅎ𝑦𝜑
cbvral.2 Ⅎ𝑥𝜓
cbvral.3 (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
Assertion
Ref Expression
cbvreu (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑦 ∈ 𝐴 𝜓)
Distinct variable groups:   𝑥,𝐴   𝑦,𝐴
Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝜓(𝑥, 𝑦)

Proof of Theorem cbvreu
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 nfv 1581 . . . 4 Ⅎ𝑧(𝑥 ∈ 𝐴 ∧ 𝜑)
21sb8eu 2099 . . 3 (∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃!𝑧[𝑧 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑))
3 sban 2015 . . . 4 ([𝑧 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑))
43eubii 2095 . . 3 (∃!𝑧[𝑧 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃!𝑧([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑))
5 clelsb1 2343 . . . . . 6 ([𝑧 / 𝑥]𝑥 ∈ 𝐴 ↔ 𝑧 ∈ 𝐴)
65anbi1i 462 . . . . 5 (([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑) ↔ (𝑧 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑))
76eubii 2095 . . . 4 (∃!𝑧([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑) ↔ ∃!𝑧(𝑧 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑))
8 nfv 1581 . . . . . 6 Ⅎ𝑦 𝑧 ∈ 𝐴
9 cbvral.1 . . . . . . 7 Ⅎ𝑦𝜑
109nfsb 2006 . . . . . 6 Ⅎ𝑦[𝑧 / 𝑥]𝜑
118, 10nfan 1618 . . . . 5 Ⅎ𝑦(𝑧 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑)
12 nfv 1581 . . . . 5 Ⅎ𝑧(𝑦 ∈ 𝐴 ∧ 𝜓)
13 eleq1 2301 . . . . . 6 (𝑧 = 𝑦 → (𝑧 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
14 sbequ 1893 . . . . . . 7 (𝑧 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑))
15 cbvral.2 . . . . . . . 8 Ⅎ𝑥𝜓
16 cbvral.3 . . . . . . . 8 (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
1715, 16sbie 1844 . . . . . . 7 ([𝑦 / 𝑥]𝜑 ↔ 𝜓)
1814, 17bitrdi 196 . . . . . 6 (𝑧 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ 𝜓))
1913, 18anbi12d 477 . . . . 5 (𝑧 = 𝑦 → ((𝑧 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑) ↔ (𝑦 ∈ 𝐴 ∧ 𝜓)))
2011, 12, 19cbveu 2110 . . . 4 (∃!𝑧(𝑧 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑) ↔ ∃!𝑦(𝑦 ∈ 𝐴 ∧ 𝜓))
217, 20bitri 184 . . 3 (∃!𝑧([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑) ↔ ∃!𝑦(𝑦 ∈ 𝐴 ∧ 𝜓))
222, 4, 213bitri 206 . 2 (∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃!𝑦(𝑦 ∈ 𝐴 ∧ 𝜓))
23 df-reu 2535 . 2 (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
24 df-reu 2535 . 2 (∃!𝑦 ∈ 𝐴 𝜓 ↔ ∃!𝑦(𝑦 ∈ 𝐴 ∧ 𝜓))
2522, 23, 243bitr4i 212 1 (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑦 ∈ 𝐴 𝜓)
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105  Ⅎwnf 1513  [wsb 1815  ∃!weu 2086   ∈ wcel 2209  ∃!wreu 2530
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This proof depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-cleq 2231  df-clel 2234  df-reu 2535
This theorem is used by:  cbvrmo  2785  cbvreuv  2788
  Copyright terms: Public domain W3C validator