Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > iunun | Structured version Visualization version Unicode version |
Description: Separate a union in an indexed union. (Contributed by NM, 27-Dec-2004.) (Proof shortened by Mario Carneiro, 17-Nov-2016.) |
Ref | Expression |
---|---|
iunun |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | r19.43 3093 | . . . 4 | |
2 | elun 3753 | . . . . 5 | |
3 | 2 | rexbii 3041 | . . . 4 |
4 | eliun 4524 | . . . . 5 | |
5 | eliun 4524 | . . . . 5 | |
6 | 4, 5 | orbi12i 543 | . . . 4 |
7 | 1, 3, 6 | 3bitr4i 292 | . . 3 |
8 | eliun 4524 | . . 3 | |
9 | elun 3753 | . . 3 | |
10 | 7, 8, 9 | 3bitr4i 292 | . 2 |
11 | 10 | eqriv 2619 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wo 383 wceq 1483 wcel 1990 wrex 2913 cun 3572 ciun 4520 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rex 2918 df-v 3202 df-un 3579 df-iun 4522 |
This theorem is referenced by: iununi 4610 oarec 7642 comppfsc 21335 uniiccdif 23346 bnj1415 31106 dftrpred4g 31734 |
Copyright terms: Public domain | W3C validator |