Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > iunrab | Unicode version |
Description: The indexed union of a restricted class abstraction. (Contributed by NM, 3-Jan-2004.) (Proof shortened by Mario Carneiro, 14-Nov-2016.) |
Ref | Expression |
---|---|
iunrab |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iunab 3724 | . 2 | |
2 | df-rab 2357 | . . . 4 | |
3 | 2 | a1i 9 | . . 3 |
4 | 3 | iuneq2i 3696 | . 2 |
5 | df-rab 2357 | . . 3 | |
6 | r19.42v 2511 | . . . 4 | |
7 | 6 | abbii 2194 | . . 3 |
8 | 5, 7 | eqtr4i 2104 | . 2 |
9 | 1, 4, 8 | 3eqtr4i 2111 | 1 |
Colors of variables: wff set class |
Syntax hints: wa 102 wceq 1284 wcel 1433 cab 2067 wrex 2349 crab 2352 ciun 3678 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 |
This theorem depends on definitions: df-bi 115 df-tru 1287 df-nf 1390 df-sb 1686 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-ral 2353 df-rex 2354 df-rab 2357 df-v 2603 df-in 2979 df-ss 2986 df-iun 3680 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |