![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
Mirrors > Home > MPE Home > Th. List > rmo5 | Unicode version |
Description: Restricted "at most one" in term of uniqueness. (Contributed by NM, 16-Jun-2017.) |
Ref | Expression |
---|---|
rmo5 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-mo 2287 | . 2 | |
2 | df-rmo 2815 | . 2 | |
3 | df-rex 2813 | . . 3 | |
4 | df-reu 2814 | . . 3 | |
5 | 3, 4 | imbi12i 326 | . 2 |
6 | 1, 2, 5 | 3bitr4i 277 | 1 |
Colors of variables: wff setvar class |
Syntax hints: -> wi 4 <-> wb 184
/\ wa 369 E. wex 1612 e. wcel 1818
E! weu 2282 E* wmo 2283 E. wrex 2808
E! wreu 2809 E* wrmo 2810 |
This theorem is referenced by: nrexrmo 3077 cbvrmo 3083 ddemeas 28208 2reurex 32186 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
This theorem depends on definitions: df-bi 185 df-mo 2287 df-rex 2813 df-reu 2814 df-rmo 2815 |
Copyright terms: Public domain | W3C validator |