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

Theorem opi1 4294
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 4245 . . 3  |-  { A }  e.  _V
32prid1 3749 . 2  |-  { A }  e.  { { A } ,  { A ,  B } }
4 opi1.2 . . 3  |-  B  e. 
_V
51, 4dfop 3832 . 2  |-  <. A ,  B >.  =  { { A } ,  { A ,  B } }
63, 5eleqtrri 2283 1  |-  { A }  e.  <. A ,  B >.
Colors of variables: wff set class
Syntax hints:    e. wcel 2178   _Vcvv 2776   {csn 3643   {cpr 3644   <.cop 3646
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-v 2778  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652
This theorem is referenced by:  opth1  4298  opth  4299
  Copyright terms: Public domain W3C validator