Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > iunun | 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 2587 | . . . 4 | |
2 | elun 3212 | . . . . 5 | |
3 | 2 | rexbii 2440 | . . . 4 |
4 | eliun 3812 | . . . . 5 | |
5 | eliun 3812 | . . . . 5 | |
6 | 4, 5 | orbi12i 753 | . . . 4 |
7 | 1, 3, 6 | 3bitr4i 211 | . . 3 |
8 | eliun 3812 | . . 3 | |
9 | elun 3212 | . . 3 | |
10 | 7, 8, 9 | 3bitr4i 211 | . 2 |
11 | 10 | eqriv 2134 | 1 |
Colors of variables: wff set class |
Syntax hints: wo 697 wceq 1331 wcel 1480 wrex 2415 cun 3064 ciun 3808 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 |
This theorem depends on definitions: df-bi 116 df-tru 1334 df-nf 1437 df-sb 1736 df-clab 2124 df-cleq 2130 df-clel 2133 df-nfc 2268 df-ral 2419 df-rex 2420 df-v 2683 df-un 3070 df-iun 3810 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |