| New Foundations Explorer | 
      
      
      < Previous  
      Next >
      
       Nearby theorems  | 
  ||
| Mirrors > Home > NFE 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 4013 | 
. 2
 | |
| 2 | df-rab 2624 | 
. . . 4
 | |
| 3 | 2 | a1i 10 | 
. . 3
 | 
| 4 | 3 | iuneq2i 3988 | 
. 2
 | 
| 5 | df-rab 2624 | 
. . 3
 | |
| 6 | r19.42v 2766 | 
. . . 4
 | |
| 7 | 6 | abbii 2466 | 
. . 3
 | 
| 8 | 5, 7 | eqtr4i 2376 | 
. 2
 | 
| 9 | 1, 4, 8 | 3eqtr4i 2383 | 
1
 | 
| Colors of variables: wff setvar class | 
| Syntax hints:     | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1546 ax-5 1557 ax-17 1616 ax-9 1654 ax-8 1675 ax-6 1729 ax-7 1734 ax-11 1746 ax-12 1925 ax-ext 2334 | 
| This theorem depends on definitions: df-bi 177 df-or 359 df-an 360 df-nan 1288 df-tru 1319 df-ex 1542 df-nf 1545 df-sb 1649 df-clab 2340 df-cleq 2346 df-clel 2349 df-nfc 2479 df-ral 2620 df-rex 2621 df-rab 2624 df-v 2862 df-nin 3212 df-compl 3213 df-in 3214 df-ss 3260 df-iun 3972 | 
| This theorem is referenced by: (None) | 
| Copyright terms: Public domain | W3C validator |