Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > rmorabex | Structured version Visualization version GIF version |
Description: Restricted "at most one" existence implies a restricted class abstraction exists. (Contributed by NM, 17-Jun-2017.) |
Ref | Expression |
---|---|
rmorabex | ⊢ (∃*𝑥 ∈ 𝐴 𝜑 → {𝑥 ∈ 𝐴 ∣ 𝜑} ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | moabex 5351 | . 2 ⊢ (∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) → {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ∈ V) | |
2 | df-rmo 3146 | . 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
3 | df-rab 3147 | . . 3 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} | |
4 | 3 | eleq1i 2903 | . 2 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} ∈ V ↔ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ∈ V) |
5 | 1, 2, 4 | 3imtr4i 294 | 1 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 → {𝑥 ∈ 𝐴 ∣ 𝜑} ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∈ wcel 2114 ∃*wmo 2620 {cab 2799 ∃*wrmo 3141 {crab 3142 Vcvv 3494 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pr 5330 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-rmo 3146 df-rab 3147 df-v 3496 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-sn 4568 df-pr 4570 |
This theorem is referenced by: supexd 8917 |
Copyright terms: Public domain | W3C validator |