| 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 4370 |
. 2
| |
| 4 | 1, 2, 3 | mp2an 430 |
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-sep 4251 ax-pow 4313 ax-pr 4348 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-v 2823 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 |
| This theorem is used by: otth2 4383 opabid 4400 elopab 4402 opabm 4425 elvvv 4840 relsnop 4883 xpiindim 4919 raliunxp 4923 rexiunxp 4924 intirr 5177 xpmlem 5211 dmsnm 5256 dmsnopg 5262 cnvcnvsn 5267 op2ndb 5274 cnviinm 5332 funopg 5414 fsn 5883 fvsn 5913 idref 5965 oprabid 6120 dfoprab2 6138 rnoprab 6174 fo1st 6395 fo2nd 6396 eloprabi 6436 xporderlem 6471 cnvoprab 6474 dmtpos 6532 rntpos 6533 tpostpos 6540 iinerm 6886 th3qlem2 6917 elixpsn 7023 ensn1 7089 mapsnen 7106 dom1o 7122 xpsnen 7125 xpcomco 7130 xpassen 7134 xpmapenlem 7155 phplem2 7160 ac6sfi 7208 djuss 7416 genipdm 7889 ioof 10389 hashf1lem1 11306 wrdexb 11337 fsumcnv 12228 fprodcnv 12416 nninfct 12842 prdsex 14278 fnpsr 15161 txdis1cn 15521 griedg0ssusgr 16714 |
| Copyright terms: Public domain | W3C validator |