![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > df-rmo | Structured version Visualization version GIF version |
Description: Define restricted
"at most one". Note: This notation is most often used
to express that 𝜑 holds for at most one element of a
given class
𝐴. For this reading Ⅎ𝑥𝐴 is required, though, for example,
asserted when 𝑥 and 𝐴 are disjoint.
Should instead 𝐴 depend on 𝑥, you rather assert at most one 𝑥 fulfilling 𝜑 happens to be contained in the corresponding 𝐴(𝑥). This interpretation is rarely needed (see also df-ral 3064). (Contributed by NM, 16-Jun-2017.) |
Ref | Expression |
---|---|
df-rmo | ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | wph | . . 3 wff 𝜑 | |
2 | vx | . . 3 setvar 𝑥 | |
3 | cA | . . 3 class 𝐴 | |
4 | 1, 2, 3 | wrmo 3351 | . 2 wff ∃*𝑥 ∈ 𝐴 𝜑 |
5 | 2 | cv 1541 | . . . . 5 class 𝑥 |
6 | 5, 3 | wcel 2107 | . . . 4 wff 𝑥 ∈ 𝐴 |
7 | 6, 1 | wa 397 | . . 3 wff (𝑥 ∈ 𝐴 ∧ 𝜑) |
8 | 7, 2 | wmo 2538 | . 2 wff ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) |
9 | 4, 8 | wb 205 | 1 wff (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) |
Colors of variables: wff setvar class |
This definition is referenced by: reu5 3354 mormo 3357 rmobiia 3358 rmoanidOLD 3364 rmobidva 3367 rmo5 3372 cbvrmovw 3375 rmobida 3378 cbvrmow 3381 nfrmo1 3383 nfrmow 3385 rmoeq1 3390 rmoeq1f 3394 nfrmowOLD 3397 nfrmod 3402 nfrmo 3404 rmov 3471 rmo4 3687 rmo3f 3691 rmoeq 3695 rmoan 3696 rmoim 3697 rmoimi2 3700 2reuswap 3703 2reu5lem2 3713 2rmoswap 3718 rmo2 3842 rmo3 3844 rmob 3845 rmob2 3847 rmoanim 3849 ssrmof 4008 dfdisj2 5071 rmorabex 5416 dffun9 6526 fncnv 6570 iunmapdisj 9893 brdom4 10400 enqeq 10804 2ndcdisj 22735 2ndcdisj2 22736 pjhtheu 30141 pjpreeq 30145 cnlnadjeui 30824 reuxfrdf 31224 rmoxfrd 31226 rmoun 31227 rmounid 31228 cbvdisjf 31293 funcnvmpt 31387 nrmo 34813 alrmomorn 36750 alrmomodm 36751 dfeldisj4 37113 disjres 37137 cdleme0moN 38619 rmotru 46680 |
Copyright terms: Public domain | W3C validator |