| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > reu6i | Structured version Visualization version GIF version | ||
| Description: A condition which implies existential uniqueness. (Contributed by Mario Carneiro, 2-Oct-2015.) |
| Ref | Expression |
|---|---|
| reu6i | ⊢ ((𝐵 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝜑 ↔ 𝑥 = 𝐵)) → ∃!𝑥 ∈ 𝐴 𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqeq2 2775 | . . . . 5 ⊢ (𝑦 = 𝐵 → (𝑥 = 𝑦 ↔ 𝑥 = 𝐵)) | |
| 2 | 1 | bibi2d 345 | . . . 4 ⊢ (𝑦 = 𝐵 → ((𝜑 ↔ 𝑥 = 𝑦) ↔ (𝜑 ↔ 𝑥 = 𝐵))) |
| 3 | 2 | ralbidv 3189 | . . 3 ⊢ (𝑦 = 𝐵 → (∀𝑥 ∈ 𝐴 (𝜑 ↔ 𝑥 = 𝑦) ↔ ∀𝑥 ∈ 𝐴 (𝜑 ↔ 𝑥 = 𝐵))) |
| 4 | 3 | rspcev 3580 | . 2 ⊢ ((𝐵 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝜑 ↔ 𝑥 = 𝐵)) → ∃𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (𝜑 ↔ 𝑥 = 𝑦)) |
| 5 | reu6 3687 | . 2 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (𝜑 ↔ 𝑥 = 𝑦)) | |
| 6 | 4, 5 | sylibr 237 | 1 ⊢ ((𝐵 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝜑 ↔ 𝑥 = 𝐵)) → ∃!𝑥 ∈ 𝐴 𝜑) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∀wral 3080 ∃wrex 3090 ∃!wreu 3367 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-12 2216 ax-ext 2735 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-ral 3081 df-rex 3091 df-reu 3370 |
| This theorem is used by: eqreu 3690 riota5f 7425 negeu 11571 creur 12338 creui 12339 reuccatpfxs1 14921 lublecl 18559 dfod2 19805 lmieu 29316 reu6dv 33138 esum2dlem 34791 fvineqsneu 38525 poimirlem16 38745 poimirlem17 38746 poimirlem19 38748 poimirlem20 38749 poimirlem22 38751 renegeulemv 43610 sn-subeu 43669 upeu2lem 50345 |
| Copyright terms: Public domain | W3C validator |