Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > reusn | Unicode version |
Description: A way to express restricted existential uniqueness of a wff: its restricted class abstraction is a singleton. (Contributed by NM, 30-May-2006.) (Proof shortened by Mario Carneiro, 14-Nov-2016.) |
Ref | Expression |
---|---|
reusn |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | euabsn2 3587 | . 2 | |
2 | df-reu 2421 | . 2 | |
3 | df-rab 2423 | . . . 4 | |
4 | 3 | eqeq1i 2145 | . . 3 |
5 | 4 | exbii 1584 | . 2 |
6 | 1, 2, 5 | 3bitr4i 211 | 1 |
Colors of variables: wff set class |
Syntax hints: wa 103 wb 104 wceq 1331 wex 1468 wcel 1480 weu 1997 cab 2123 wreu 2416 crab 2418 csn 3522 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 |
This theorem depends on definitions: df-bi 116 df-tru 1334 df-nf 1437 df-sb 1736 df-eu 2000 df-clab 2124 df-cleq 2130 df-clel 2133 df-nfc 2268 df-reu 2421 df-rab 2423 df-v 2683 df-sn 3528 |
This theorem is referenced by: reuen1 6688 |
Copyright terms: Public domain | W3C validator |