| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rabss2 | Unicode version | ||
| Description: Subclass law for restricted abstraction. (Contributed by NM, 18-Dec-2004.) (Proof shortened by Andrew Salmon, 26-Jun-2011.) |
| Ref | Expression |
|---|---|
| rabss2 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pm3.45 601 |
. . . 4
| |
| 2 | 1 | alimi 1504 |
. . 3
|
| 3 | ssalel 3216 |
. . 3
| |
| 4 | ss2ab 3296 |
. . 3
| |
| 5 | 2, 3, 4 | 3imtr4i 201 |
. 2
|
| 6 | df-rab 2520 |
. 2
| |
| 7 | df-rab 2520 |
. 2
| |
| 8 | 5, 6, 7 | 3sstr4g 3271 |
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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-nf 1510 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-rab 2520 df-in 3207 df-ss 3214 |
| This theorem is referenced by: rabssrabd 3315 sess2 4441 zsupssdc 10542 dvfgg 15479 |
| Copyright terms: Public domain | W3C validator |