| 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 2774 | . . . . 5 ⊢ (𝑦 = 𝐵 → (𝑥 = 𝑦 ↔ 𝑥 = 𝐵)) | |
| 2 | 1 | bibi2d 345 | . . . 4 ⊢ (𝑦 = 𝐵 → ((𝜑 ↔ 𝑥 = 𝑦) ↔ (𝜑 ↔ 𝑥 = 𝐵))) |
| 3 | 2 | ralbidv 3187 | . . 3 ⊢ (𝑦 = 𝐵 → (∀𝑥 ∈ 𝐴 (𝜑 ↔ 𝑥 = 𝑦) ↔ ∀𝑥 ∈ 𝐴 (𝜑 ↔ 𝑥 = 𝐵))) |
| 4 | 3 | rspcev 3580 | . 2 ⊢ ((𝐵 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝜑 ↔ 𝑥 = 𝐵)) → ∃𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (𝜑 ↔ 𝑥 = 𝑦)) |
| 5 | reu6 3688 | . 2 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (𝜑 ↔ 𝑥 = 𝑦)) | |
| 6 | 4, 5 | sylibr 237 | 1 ⊢ ((𝐵 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝜑 ↔ 𝑥 = 𝐵)) → ∃!𝑥 ∈ 𝐴 𝜑) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1569 ∈ wcel 2142 ∀wral 3078 ∃wrex 3088 ∃!wreu 3366 |
| 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-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-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-ral 3079 df-rex 3089 df-reu 3369 |
| This theorem is used by: eqreu 3691 riota5f 7397 negeu 11453 creur 12218 creui 12219 reuccatpfxs1 14791 lublecl 18421 dfod2 19640 lmieu 29104 reu6dv 32830 esum2dlem 34491 fvineqsneu 38085 poimirlem16 38315 poimirlem17 38316 poimirlem19 38318 poimirlem20 38319 poimirlem22 38321 renegeulemv 43157 sn-subeu 43216 upeu2lem 49834 |
| Copyright terms: Public domain | W3C validator |