| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > moabex | Structured version Visualization version GIF version | ||
| Description: "At most one" existence implies a class abstraction exists. (Contributed by NM, 30-Dec-1996.) Avoid axioms. (Revised by SN, 2-Feb-2026.) |
| Ref | Expression |
|---|---|
| moabex | ⊢ (∃*𝑥𝜑 → {𝑥 ∣ 𝜑} ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfmo 2565 | . 2 ⊢ (∃*𝑥𝜑 ↔ ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦)) | |
| 2 | df-sn 4585 | . . . . . 6 ⊢ {𝑦} = {𝑥 ∣ 𝑥 = 𝑦} | |
| 3 | vsnex 5392 | . . . . . 6 ⊢ {𝑦} ∈ V | |
| 4 | 2, 3 | eqeltrri 2857 | . . . . 5 ⊢ {𝑥 ∣ 𝑥 = 𝑦} ∈ V |
| 5 | 4 | a1i 11 | . . . 4 ⊢ (∀𝑥(𝜑 → 𝑥 = 𝑦) → {𝑥 ∣ 𝑥 = 𝑦} ∈ V) |
| 6 | ss2abim 3985 | . . . 4 ⊢ (∀𝑥(𝜑 → 𝑥 = 𝑦) → {𝑥 ∣ 𝜑} ⊆ {𝑥 ∣ 𝑥 = 𝑦}) | |
| 7 | 5, 6 | ssexd 5285 | . . 3 ⊢ (∀𝑥(𝜑 → 𝑥 = 𝑦) → {𝑥 ∣ 𝜑} ∈ V) |
| 8 | 7 | exlimiv 1962 | . 2 ⊢ (∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦) → {𝑥 ∣ 𝜑} ∈ V) |
| 9 | 1, 8 | sylbi 220 | 1 ⊢ (∃*𝑥𝜑 → {𝑥 ∣ 𝜑} ∈ V) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∀wal 1567 ∃wex 1811 ∈ wcel 2144 ∃*wmo 2562 {cab 2738 Vcvv 3450 {csn 4584 |
| 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 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 ax-sep 5248 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-ex 1812 df-sb 2099 df-mo 2564 df-clab 2739 df-cleq 2752 df-clel 2835 df-rab 3413 df-v 3452 df-ss 3896 df-in 4091 df-un 4151 df-sn 4585 df-pr 4587 |
| This theorem is used by: rmorabex 5427 euabex 5428 satfv0 36210 |
| Copyright terms: Public domain | W3C validator |