| Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > Mathboxes > bj-uniex | Unicode version | ||
| Description: uniex 4583 from bounded separation. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.) |
| Ref | Expression |
|---|---|
| bj-uniex.1 |
|
| Ref | Expression |
|---|---|
| bj-uniex |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bj-uniex.1 |
. 2
| |
| 2 | unieq 3944 |
. . 3
| |
| 3 | 2 | eleq1d 2307 |
. 2
|
| 4 | bj-uniex2 16954 |
. . 3
| |
| 5 | 4 | issetri 2831 |
. 2
|
| 6 | 1, 3, 5 | vtocl 2877 |
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-un 4578 ax-bd0 16851 ax-bdex 16857 ax-bdel 16859 ax-bdsep 16922 |
| This proof depends on definitions: df-bi 117 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-rex 2534 df-v 2823 df-uni 3936 |
| This theorem is used by: bj-uniexg 16956 bj-unex 16957 |
| Copyright terms: Public domain | W3C validator |