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.) |
Ref | Expression |
---|---|
moabex | ⊢ (∃*𝑥𝜑 → {𝑥 ∣ 𝜑} ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-mo 2540 | . 2 ⊢ (∃*𝑥𝜑 ↔ ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦)) | |
2 | abss 3994 | . . . . 5 ⊢ ({𝑥 ∣ 𝜑} ⊆ {𝑦} ↔ ∀𝑥(𝜑 → 𝑥 ∈ {𝑦})) | |
3 | velsn 4577 | . . . . . . 7 ⊢ (𝑥 ∈ {𝑦} ↔ 𝑥 = 𝑦) | |
4 | 3 | imbi2i 336 | . . . . . 6 ⊢ ((𝜑 → 𝑥 ∈ {𝑦}) ↔ (𝜑 → 𝑥 = 𝑦)) |
5 | 4 | albii 1822 | . . . . 5 ⊢ (∀𝑥(𝜑 → 𝑥 ∈ {𝑦}) ↔ ∀𝑥(𝜑 → 𝑥 = 𝑦)) |
6 | 2, 5 | bitri 274 | . . . 4 ⊢ ({𝑥 ∣ 𝜑} ⊆ {𝑦} ↔ ∀𝑥(𝜑 → 𝑥 = 𝑦)) |
7 | snex 5354 | . . . . 5 ⊢ {𝑦} ∈ V | |
8 | 7 | ssex 5245 | . . . 4 ⊢ ({𝑥 ∣ 𝜑} ⊆ {𝑦} → {𝑥 ∣ 𝜑} ∈ V) |
9 | 6, 8 | sylbir 234 | . . 3 ⊢ (∀𝑥(𝜑 → 𝑥 = 𝑦) → {𝑥 ∣ 𝜑} ∈ V) |
10 | 9 | exlimiv 1933 | . 2 ⊢ (∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦) → {𝑥 ∣ 𝜑} ∈ V) |
11 | 1, 10 | sylbi 216 | 1 ⊢ (∃*𝑥𝜑 → {𝑥 ∣ 𝜑} ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∀wal 1537 ∃wex 1782 ∈ wcel 2106 ∃*wmo 2538 {cab 2715 Vcvv 3432 ⊆ wss 3887 {csn 4561 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-sn 4562 df-pr 4564 |
This theorem is referenced by: rmorabex 5375 euabex 5376 satfv0 33320 |
Copyright terms: Public domain | W3C validator |