| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > opex | Unicode version | ||
| Description: An ordered pair of sets is a set. (Contributed by Jim Kingdon, 24-Sep-2018.) (Revised by Mario Carneiro, 24-May-2019.) |
| Ref | Expression |
|---|---|
| opex.1 |
|
| opex.2 |
|
| Ref | Expression |
|---|---|
| opex |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opex.1 |
. 2
| |
| 2 | opex.2 |
. 2
| |
| 3 | opexg 4279 |
. 2
| |
| 4 | 1, 2, 3 | mp2an 426 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-14 2180 ax-ext 2188 ax-sep 4169 ax-pow 4225 ax-pr 4260 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-nf 1485 df-sb 1787 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-v 2775 df-un 3174 df-in 3176 df-ss 3183 df-pw 3622 df-sn 3643 df-pr 3644 df-op 3646 |
| This theorem is referenced by: otth2 4292 opabid 4309 elopab 4311 opabm 4334 elvvv 4745 relsnop 4788 xpiindim 4822 raliunxp 4826 rexiunxp 4827 intirr 5077 xpmlem 5111 dmsnm 5156 dmsnopg 5162 cnvcnvsn 5167 op2ndb 5174 cnviinm 5232 funopg 5313 fsn 5764 fvsn 5791 idref 5837 oprabid 5988 dfoprab2 6004 rnoprab 6040 fo1st 6255 fo2nd 6256 eloprabi 6294 xporderlem 6329 cnvoprab 6332 dmtpos 6354 rntpos 6355 tpostpos 6362 iinerm 6706 th3qlem2 6737 elixpsn 6834 ensn1 6900 mapsnen 6916 xpsnen 6930 xpcomco 6935 xpassen 6939 xpmapenlem 6960 phplem2 6964 ac6sfi 7009 djuss 7186 genipdm 7644 ioof 10108 wrdexb 11023 fsumcnv 11818 fprodcnv 12006 nninfct 12432 prdsex 13171 fnpsr 14499 txdis1cn 14820 dom1o 16063 |
| Copyright terms: Public domain | W3C validator |