| 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 4368 |
. 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 4249 ax-pow 4311 ax-pr 4346 |
| 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 4381 opabid 4398 elopab 4400 opabm 4423 elvvv 4838 relsnop 4881 xpiindim 4917 raliunxp 4921 rexiunxp 4922 intirr 5174 xpmlem 5208 dmsnm 5253 dmsnopg 5259 cnvcnvsn 5264 op2ndb 5271 cnviinm 5329 funopg 5411 fsn 5880 fvsn 5910 idref 5962 oprabid 6117 dfoprab2 6135 rnoprab 6171 fo1st 6391 fo2nd 6392 eloprabi 6432 xporderlem 6467 cnvoprab 6470 dmtpos 6527 rntpos 6528 tpostpos 6535 iinerm 6881 th3qlem2 6912 elixpsn 7017 ensn1 7083 mapsnen 7100 dom1o 7116 xpsnen 7119 xpcomco 7124 xpassen 7128 xpmapenlem 7149 phplem2 7154 ac6sfi 7202 djuss 7410 genipdm 7883 ioof 10373 hashf1lem1 11285 wrdexb 11316 fsumcnv 12204 fprodcnv 12392 nninfct 12818 prdsex 14172 fnpsr 15051 txdis1cn 15379 griedg0ssusgr 16492 |
| Copyright terms: Public domain | W3C validator |