| 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 3668. (Contributed by BJ, 24-Sep-2022.) |
| Ref | Expression |
|---|---|
| mosneq | ⊢ ∃*𝑥{𝑥} = 𝐴 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqtr3 2785 | . . . 4 ⊢ (({𝑥} = 𝐴 ∧ {𝑦} = 𝐴) → {𝑥} = {𝑦}) | |
| 2 | vex 3458 | . . . . 5 ⊢ 𝑥 ∈ V | |
| 3 | 2 | sneqr 4798 | . . . 4 ⊢ ({𝑥} = {𝑦} → 𝑥 = 𝑦) |
| 4 | 1, 3 | syl 18 | . . 3 ⊢ (({𝑥} = 𝐴 ∧ {𝑦} = 𝐴) → 𝑥 = 𝑦) |
| 5 | 4 | gen2 1828 | . 2 ⊢ ∀𝑥∀𝑦(({𝑥} = 𝐴 ∧ {𝑦} = 𝐴) → 𝑥 = 𝑦) |
| 6 | sneq 4594 | . . . 4 ⊢ (𝑥 = 𝑦 → {𝑥} = {𝑦}) | |
| 7 | 6 | eqeq1d 2765 | . . 3 ⊢ (𝑥 = 𝑦 → ({𝑥} = 𝐴 ↔ {𝑦} = 𝐴)) |
| 8 | 7 | mo4 2594 | . 2 ⊢ (∃*𝑥{𝑥} = 𝐴 ↔ ∀𝑥∀𝑦(({𝑥} = 𝐴 ∧ {𝑦} = 𝐴) → 𝑥 = 𝑦)) |
| 9 | 5, 8 | mpbir 234 | 1 ⊢ ∃*𝑥{𝑥} = 𝐴 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∀wal 1567 = wceq 1569 ∃*wmo 2565 {csn 4588 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1572 df-ex 1812 df-sb 2101 df-mo 2567 df-clab 2742 df-cleq 2755 df-clel 2839 df-v 3456 df-sn 4589 |
| This theorem is used by: pwfir 9322 euabsneu 48240 |
| Copyright terms: Public domain | W3C validator |