![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > opex | GIF 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 | ⊢ 𝐴 ∈ V |
opex.2 | ⊢ 𝐵 ∈ V |
Ref | Expression |
---|---|
opex | ⊢ 〈𝐴, 𝐵〉 ∈ V |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | opex.1 | . 2 ⊢ 𝐴 ∈ V | |
2 | opex.2 | . 2 ⊢ 𝐵 ∈ V | |
3 | opexg 4158 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → 〈𝐴, 𝐵〉 ∈ V) | |
4 | 1, 2, 3 | mp2an 423 | 1 ⊢ 〈𝐴, 𝐵〉 ∈ V |
Colors of variables: wff set class |
Syntax hints: ∈ wcel 1481 Vcvv 2689 〈cop 3535 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-14 1493 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 ax-sep 4054 ax-pow 4106 ax-pr 4139 |
This theorem depends on definitions: df-bi 116 df-3an 965 df-tru 1335 df-nf 1438 df-sb 1737 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-v 2691 df-un 3080 df-in 3082 df-ss 3089 df-pw 3517 df-sn 3538 df-pr 3539 df-op 3541 |
This theorem is referenced by: otth2 4171 opabid 4187 elopab 4188 opabm 4210 elvvv 4610 relsnop 4653 xpiindim 4684 raliunxp 4688 rexiunxp 4689 intirr 4933 xpmlem 4967 dmsnm 5012 dmsnopg 5018 cnvcnvsn 5023 op2ndb 5030 cnviinm 5088 funopg 5165 fsn 5600 fvsn 5623 idref 5666 oprabid 5811 dfoprab2 5826 rnoprab 5862 fo1st 6063 fo2nd 6064 eloprabi 6102 xporderlem 6136 cnvoprab 6139 dmtpos 6161 rntpos 6162 tpostpos 6169 iinerm 6509 th3qlem2 6540 elixpsn 6637 ensn1 6698 mapsnen 6713 xpsnen 6723 xpcomco 6728 xpassen 6732 xpmapenlem 6751 phplem2 6755 ac6sfi 6800 djuss 6963 genipdm 7348 ioof 9784 fsumcnv 11238 txdis1cn 12486 |
Copyright terms: Public domain | W3C validator |