| 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 3559 | . . . 4 ⊢ (𝐴 ∈ 𝐵 → (𝜓 → ∃𝑥𝜑)) |
| 3 | 2 | imp 411 | . . 3 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝜓) → ∃𝑥𝜑) |
| 4 | 3 | 3adant3 1148 | . 2 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝜓 ∧ ∀𝑥(𝜑 → 𝑥 = 𝐴)) → ∃𝑥𝜑) |
| 5 | eqeq2 2777 | . . . . . . 7 ⊢ (𝑦 = 𝐴 → (𝑥 = 𝑦 ↔ 𝑥 = 𝐴)) | |
| 6 | 5 | imbi2d 343 | . . . . . 6 ⊢ (𝑦 = 𝐴 → ((𝜑 → 𝑥 = 𝑦) ↔ (𝜑 → 𝑥 = 𝐴))) |
| 7 | 6 | albidv 1943 | . . . . 5 ⊢ (𝑦 = 𝐴 → (∀𝑥(𝜑 → 𝑥 = 𝑦) ↔ ∀𝑥(𝜑 → 𝑥 = 𝐴))) |
| 8 | 7 | spcegv 3559 | . . . 4 ⊢ (𝐴 ∈ 𝐵 → (∀𝑥(𝜑 → 𝑥 = 𝐴) → ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦))) |
| 9 | 8 | imp 411 | . . 3 ⊢ ((𝐴 ∈ 𝐵 ∧ ∀𝑥(𝜑 → 𝑥 = 𝐴)) → ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦)) |
| 10 | 9 | 3adant2 1147 | . 2 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝜓 ∧ ∀𝑥(𝜑 → 𝑥 = 𝐴)) → ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦)) |
| 11 | eu3v 2600 | . 2 ⊢ (∃!𝑥𝜑 ↔ (∃𝑥𝜑 ∧ ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦))) | |
| 12 | 4, 10, 11 | sylanbrc 594 | 1 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝜓 ∧ ∀𝑥(𝜑 → 𝑥 = 𝐴)) → ∃!𝑥𝜑) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ w3a 1101 ∀wal 1561 = wceq 1563 ∃wex 1802 ∈ wcel 2145 ∃!weu 2598 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-ext 2737 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-3an 1103 df-tru 1566 df-ex 1803 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 |
| This theorem is referenced by: ringurd 20258 zrinitorngc 20718 zrtermorngc 20719 zrtermoringc 20751 neibastop3 36735 upixp 38240 |
| Copyright terms: Public domain | W3C validator |