| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > iunexg | Unicode version | ||
| Description: The existence of an
indexed union. |
| Ref | Expression |
|---|---|
| iunexg |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfiun2g 4044 |
. . 3
| |
| 2 | 1 | adantl 277 |
. 2
|
| 3 | abrexexg 6351 |
. . . 4
| |
| 4 | uniexg 4587 |
. . . 4
| |
| 5 | 3, 4 | syl 14 |
. . 3
|
| 6 | 5 | adantr 276 |
. 2
|
| 7 | 2, 6 | eqeltrd 2315 |
1
|
| Colors of variables: wff set class |
| This proof depends on syntax axioms:
|
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4248 ax-sep 4251 ax-pow 4313 ax-pr 4348 ax-un 4580 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-iun 4014 df-br 4132 df-opab 4194 df-mpt 4195 df-id 4440 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-f1 5385 df-fo 5386 df-f1o 5387 df-fv 5388 |
| This theorem is used by: abrexex2g 6353 opabex3d 6354 opabex3 6355 iunex 6356 xpexgALT 6370 mpoexxg 6450 rdgtfr 6649 rdgruledefgg 6650 rdgivallem 6656 ixpexgg 7008 ixpssmapg 7014 wrdexg 11337 ptex 13677 imasex 13685 imasival 13686 imasbas 13687 imasplusg 13688 imasmulr 13689 reldvg 15905 |
| Copyright terms: Public domain | W3C validator |