| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: The intersection of a non-empty restricted class abstraction exists. |
| Ref | Expression |
|---|---|
| intexrab |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | intexab 2726 |
. 2
| |
| 2 | df-rex 1647 |
. 2
| |
| 3 | df-rab 1649 |
. . . 4
| |
| 4 | 3 | inteqi 2532 |
. . 3
|
| 5 | 4 | eleq1i 1534 |
. 2
|
| 6 | 1, 2, 5 | 3bitr4 183 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: onintrab2 3009 cardval 4806 alephsuc 4846 clsval 7627 spanvalt 9237 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 960 ax-gen 961 ax-8 962 ax-10 964 ax-12 966 ax-13 967 ax-14 968 ax-17 969 ax-4 971 ax-5o 973 ax-6o 976 ax-9o 1121 ax-10o 1138 ax-16 1208 ax-11o 1216 ax-ext 1457 ax-sep 2698 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 979 df-sb 1170 df-clab 1462 df-cleq 1467 df-clel 1470 df-ne 1584 df-ral 1646 df-rex 1647 df-rab 1649 df-v 1808 df-dif 2045 df-in 2047 df-ss 2049 df-nul 2277 df-int 2529 |