| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > dfrab3ss | Unicode version | ||
| Description: Restricted class abstraction with a common superset. (Contributed by Stefan O'Rear, 12-Sep-2015.) (Proof shortened by Mario Carneiro, 8-Nov-2015.) |
| Ref | Expression |
|---|---|
| dfrab3ss |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ss 3187 |
. . 3
| |
| 2 | ineq1 3375 |
. . . 4
| |
| 3 | 2 | eqcomd 2213 |
. . 3
|
| 4 | 1, 3 | sylbi 121 |
. 2
|
| 5 | dfrab3 3457 |
. 2
| |
| 6 | dfrab3 3457 |
. . . 4
| |
| 7 | 6 | ineq2i 3379 |
. . 3
|
| 8 | inass 3391 |
. . 3
| |
| 9 | 7, 8 | eqtr4i 2231 |
. 2
|
| 10 | 4, 5, 9 | 3eqtr4g 2265 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-ext 2189 |
| This theorem depends on definitions: df-bi 117 df-tru 1376 df-nf 1485 df-sb 1787 df-clab 2194 df-cleq 2200 df-clel 2203 df-nfc 2339 df-rab 2495 df-v 2778 df-in 3180 df-ss 3187 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |