| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mosneq | Structured version Visualization version GIF version | ||
| Description: There exists at most one set whose singleton is equal to a given class. See also moeq 3665. (Contributed by BJ, 24-Sep-2022.) |
| Ref | Expression |
|---|---|
| mosneq | ⊢ ∃*𝑥{𝑥} = 𝐴 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqtr3 2758 | . . . 4 ⊢ (({𝑥} = 𝐴 ∧ {𝑦} = 𝐴) → {𝑥} = {𝑦}) | |
| 2 | vex 3444 | . . . . 5 ⊢ 𝑥 ∈ V | |
| 3 | 2 | sneqr 4796 | . . . 4 ⊢ ({𝑥} = {𝑦} → 𝑥 = 𝑦) |
| 4 | 1, 3 | syl 17 | . . 3 ⊢ (({𝑥} = 𝐴 ∧ {𝑦} = 𝐴) → 𝑥 = 𝑦) |
| 5 | 4 | gen2 1797 | . 2 ⊢ ∀𝑥∀𝑦(({𝑥} = 𝐴 ∧ {𝑦} = 𝐴) → 𝑥 = 𝑦) |
| 6 | sneq 4590 | . . . 4 ⊢ (𝑥 = 𝑦 → {𝑥} = {𝑦}) | |
| 7 | 6 | eqeq1d 2738 | . . 3 ⊢ (𝑥 = 𝑦 → ({𝑥} = 𝐴 ↔ {𝑦} = 𝐴)) |
| 8 | 7 | mo4 2566 | . 2 ⊢ (∃*𝑥{𝑥} = 𝐴 ↔ ∀𝑥∀𝑦(({𝑥} = 𝐴 ∧ {𝑦} = 𝐴) → 𝑥 = 𝑦)) |
| 9 | 5, 8 | mpbir 231 | 1 ⊢ ∃*𝑥{𝑥} = 𝐴 |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∀wal 1539 = wceq 1541 ∃*wmo 2537 {csn 4580 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1544 df-ex 1781 df-sb 2068 df-mo 2539 df-clab 2715 df-cleq 2728 df-clel 2811 df-v 3442 df-sn 4581 |
| This theorem is referenced by: pwfir 9219 euabsneu 47295 |
| Copyright terms: Public domain | W3C validator |