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 3983 | . 2 | |
4 | 1, 2, 3 | mp2an 416 | 1 |
Colors of variables: wff set class |
Syntax hints: wcel 1433 cvv 2601 cop 3401 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-14 1445 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 ax-sep 3896 ax-pow 3948 ax-pr 3964 |
This theorem depends on definitions: df-bi 115 df-3an 921 df-tru 1287 df-nf 1390 df-sb 1686 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-v 2603 df-un 2977 df-in 2979 df-ss 2986 df-pw 3384 df-sn 3404 df-pr 3405 df-op 3407 |
This theorem is referenced by: otth2 3996 opabid 4012 elopab 4013 opabm 4035 elvvv 4421 relsnop 4462 xpiindim 4491 raliunxp 4495 rexiunxp 4496 intirr 4731 xpmlem 4764 dmsnm 4806 dmsnopg 4812 cnvcnvsn 4817 op2ndb 4824 cnviinm 4879 funopg 4954 fsn 5356 fvsn 5379 idref 5417 oprabid 5557 dfoprab2 5572 rnoprab 5607 fo1st 5804 fo2nd 5805 eloprabi 5842 xporderlem 5872 cnvoprab 5875 dmtpos 5894 rntpos 5895 tpostpos 5902 iinerm 6201 th3qlem2 6232 ensn1 6299 xpsnen 6318 xpcomco 6323 xpassen 6327 phplem2 6339 ac6sfi 6379 genipdm 6706 ioof 8994 |
Copyright terms: Public domain | W3C validator |