ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  opi1 Unicode version

Theorem opi1 4367
Description: One of the two elements in an ordered pair. (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 26-Apr-2015.)
Hypotheses
Ref Expression
opi1.1  |-  A  e. 
_V
opi1.2  |-  B  e. 
_V
Assertion
Ref Expression
opi1  |-  { A }  e.  <. A ,  B >.

Proof of Theorem opi1
StepHypRef Expression
1 opi1.1 . . . 4  |-  A  e. 
_V
21snex 4317 . . 3  |-  { A }  e.  _V
32prid1 3813 . 2  |-  { A }  e.  { { A } ,  { A ,  B } }
4 opi1.2 . . 3  |-  B  e. 
_V
51, 4dfop 3898 . 2  |-  <. A ,  B >.  =  { { A } ,  { A ,  B } }
63, 5eleqtrri 2314 1  |-  { A }  e.  <. A ,  B >.
Colors of variables: wff set class
Syntax hints:    e. wcel 2209   _Vcvv 2821   {csn 3705   {cpr 3706   <.cop 3708
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 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 4244  ax-pow 4306
This theorem 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 3687  df-sn 3711  df-pr 3712  df-op 3714
This theorem is referenced by:  opth1  4371  opth  4372
  Copyright terms: Public domain W3C validator