Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > dmopabss | Unicode version |
Description: Upper bound for the domain of a restricted class of ordered pairs. (Contributed by NM, 31-Jan-2004.) |
Ref | Expression |
---|---|
dmopabss |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dmopab 4815 | . 2 | |
2 | 19.42v 1894 | . . . 4 | |
3 | 2 | abbii 2282 | . . 3 |
4 | ssab2 3226 | . . 3 | |
5 | 3, 4 | eqsstri 3174 | . 2 |
6 | 1, 5 | eqsstri 3174 | 1 |
Colors of variables: wff set class |
Syntax hints: wa 103 wex 1480 wcel 2136 cab 2151 wss 3116 copab 4042 cdm 4604 |
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 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-14 2139 ax-ext 2147 ax-sep 4100 ax-pow 4153 ax-pr 4187 |
This theorem depends on definitions: df-bi 116 df-3an 970 df-tru 1346 df-nf 1449 df-sb 1751 df-eu 2017 df-mo 2018 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-v 2728 df-un 3120 df-in 3122 df-ss 3129 df-pw 3561 df-sn 3582 df-pr 3583 df-op 3585 df-br 3983 df-opab 4044 df-dm 4614 |
This theorem is referenced by: opabex 5709 |
Copyright terms: Public domain | W3C validator |