| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eqeu | Structured version Visualization version GIF version | ||
| Description: A condition which implies existential uniqueness. (Contributed by Jeff Hankins, 8-Sep-2009.) |
| Ref | Expression |
|---|---|
| eqeu.1 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| eqeu | ⊢ ((𝐴 ∈ 𝐵 ∧ 𝜓 ∧ ∀𝑥(𝜑 → 𝑥 = 𝐴)) → ∃!𝑥𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqeu.1 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
| 2 | 1 | spcegv 3556 | . . . 4 ⊢ (𝐴 ∈ 𝐵 → (𝜓 → ∃𝑥𝜑)) |
| 3 | 2 | imp 410 | . . 3 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝜓) → ∃𝑥𝜑) |
| 4 | 3 | 3adant3 1144 | . 2 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝜓 ∧ ∀𝑥(𝜑 → 𝑥 = 𝐴)) → ∃𝑥𝜑) |
| 5 | eqeq2 2773 | . . . . . . 7 ⊢ (𝑦 = 𝐴 → (𝑥 = 𝑦 ↔ 𝑥 = 𝐴)) | |
| 6 | 5 | imbi2d 342 | . . . . . 6 ⊢ (𝑦 = 𝐴 → ((𝜑 → 𝑥 = 𝑦) ↔ (𝜑 → 𝑥 = 𝐴))) |
| 7 | 6 | albidv 1939 | . . . . 5 ⊢ (𝑦 = 𝐴 → (∀𝑥(𝜑 → 𝑥 = 𝑦) ↔ ∀𝑥(𝜑 → 𝑥 = 𝐴))) |
| 8 | 7 | spcegv 3556 | . . . 4 ⊢ (𝐴 ∈ 𝐵 → (∀𝑥(𝜑 → 𝑥 = 𝐴) → ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦))) |
| 9 | 8 | imp 410 | . . 3 ⊢ ((𝐴 ∈ 𝐵 ∧ ∀𝑥(𝜑 → 𝑥 = 𝐴)) → ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦)) |
| 10 | 9 | 3adant2 1143 | . 2 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝜓 ∧ ∀𝑥(𝜑 → 𝑥 = 𝐴)) → ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦)) |
| 11 | eu3v 2596 | . 2 ⊢ (∃!𝑥𝜑 ↔ (∃𝑥𝜑 ∧ ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦))) | |
| 12 | 4, 10, 11 | sylanbrc 592 | 1 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝜓 ∧ ∀𝑥(𝜑 → 𝑥 = 𝐴)) → ∃!𝑥𝜑) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ w3a 1097 ∀wal 1557 = wceq 1559 ∃wex 1798 ∈ wcel 2141 ∃!weu 2594 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-3an 1099 df-tru 1562 df-ex 1799 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 |
| This theorem is referenced by: ringurd 20214 zrinitorngc 20671 zrtermorngc 20672 zrtermoringc 20704 neibastop3 36686 upixp 38192 |
| Copyright terms: Public domain | W3C validator |