| 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 2778 | . . . . 5 ⊢ (𝑦 = 𝐵 → (𝑥 = 𝑦 ↔ 𝑥 = 𝐵)) | |
| 2 | 1 | bibi2d 345 | . . . 4 ⊢ (𝑦 = 𝐵 → ((𝜑 ↔ 𝑥 = 𝑦) ↔ (𝜑 ↔ 𝑥 = 𝐵))) |
| 3 | 2 | ralbidv 3192 | . . 3 ⊢ (𝑦 = 𝐵 → (∀𝑥 ∈ 𝐴 (𝜑 ↔ 𝑥 = 𝑦) ↔ ∀𝑥 ∈ 𝐴 (𝜑 ↔ 𝑥 = 𝐵))) |
| 4 | 3 | rspcev 3579 | . 2 ⊢ ((𝐵 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝜑 ↔ 𝑥 = 𝐵)) → ∃𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (𝜑 ↔ 𝑥 = 𝑦)) |
| 5 | reu6 3686 | . 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 1572 ∈ wcel 2150 ∀wral 3083 ∃wrex 3093 ∃!wreu 3366 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-12 2219 ax-ext 2738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1575 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-ral 3084 df-rex 3094 df-reu 3369 |
| This theorem is used by: eqreu 3689 riota5f 7435 negeu 11585 creur 12353 creui 12354 reuccatpfxs1 14937 lublecl 18585 dfod2 19831 lmieu 29348 reu6dv 33170 esum2dlem 34836 fvineqsneu 38604 poimirlem16 38824 poimirlem17 38825 poimirlem19 38827 poimirlem20 38828 poimirlem22 38830 renegeulemv 43684 sn-subeu 43743 upeu2lem 50563 |
| Copyright terms: Public domain | W3C validator |