| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > euxfrw | Structured version Visualization version GIF version | ||
| Description: Transfer existential uniqueness from a variable 𝑥 to another variable 𝑦 contained in expression 𝐴. Version of euxfr 3685 with a disjoint variable condition, which does not require ax-13 2403. (Contributed by NM, 14-Nov-2004.) Avoid ax-13 2403. (Revised by GG, 10-Jan-2024.) |
| Ref | Expression |
|---|---|
| euxfrw.1 | ⊢ 𝐴 ∈ V |
| euxfrw.2 | ⊢ ∃!𝑦 𝑥 = 𝐴 |
| euxfrw.3 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| euxfrw | ⊢ (∃!𝑥𝜑 ↔ ∃!𝑦𝜓) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | euxfrw.2 | . . . . . 6 ⊢ ∃!𝑦 𝑥 = 𝐴 | |
| 2 | euex 2604 | . . . . . 6 ⊢ (∃!𝑦 𝑥 = 𝐴 → ∃𝑦 𝑥 = 𝐴) | |
| 3 | 1, 2 | ax-mp 5 | . . . . 5 ⊢ ∃𝑦 𝑥 = 𝐴 |
| 4 | 3 | biantrur 539 | . . . 4 ⊢ (𝜑 ↔ (∃𝑦 𝑥 = 𝐴 ∧ 𝜑)) |
| 5 | 19.41v 1978 | . . . 4 ⊢ (∃𝑦(𝑥 = 𝐴 ∧ 𝜑) ↔ (∃𝑦 𝑥 = 𝐴 ∧ 𝜑)) | |
| 6 | euxfrw.3 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
| 7 | 6 | pm5.32i 584 | . . . . 5 ⊢ ((𝑥 = 𝐴 ∧ 𝜑) ↔ (𝑥 = 𝐴 ∧ 𝜓)) |
| 8 | 7 | exbii 1877 | . . . 4 ⊢ (∃𝑦(𝑥 = 𝐴 ∧ 𝜑) ↔ ∃𝑦(𝑥 = 𝐴 ∧ 𝜓)) |
| 9 | 4, 5, 8 | 3bitr2i 302 | . . 3 ⊢ (𝜑 ↔ ∃𝑦(𝑥 = 𝐴 ∧ 𝜓)) |
| 10 | 9 | eubii 2612 | . 2 ⊢ (∃!𝑥𝜑 ↔ ∃!𝑥∃𝑦(𝑥 = 𝐴 ∧ 𝜓)) |
| 11 | euxfrw.1 | . . 3 ⊢ 𝐴 ∈ V | |
| 12 | 1 | eumoi 2606 | . . 3 ⊢ ∃*𝑦 𝑥 = 𝐴 |
| 13 | 11, 12 | euxfr2w 3682 | . 2 ⊢ (∃!𝑥∃𝑦(𝑥 = 𝐴 ∧ 𝜓) ↔ ∃!𝑦𝜓) |
| 14 | 10, 13 | bitri 278 | 1 ⊢ (∃!𝑥𝜑 ↔ ∃!𝑦𝜓) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1569 ∃wex 1808 ∈ wcel 2142 ∃!weu 2595 Vcvv 3454 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1572 df-ex 1809 df-nf 1813 df-mo 2566 df-eu 2596 df-cleq 2754 df-clel 2837 |
| This theorem is used by: moxfr 43451 |
| Copyright terms: Public domain | W3C validator |