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

Theorem op1sta 5243
Description: Extract the first member of an ordered pair. (See op2nda 5246 to extract the second member and op1stb 4598 for an alternate version.) (Contributed by Raph Levien, 4-Dec-2003.)
Hypotheses
Ref Expression
cnvsn.1  |-  A  e. 
_V
cnvsn.2  |-  B  e. 
_V
Assertion
Ref Expression
op1sta  |-  U. dom  {
<. A ,  B >. }  =  A

Proof of Theorem op1sta
StepHypRef Expression
1 cnvsn.2 . . . 4  |-  B  e. 
_V
21dmsnop 5235 . . 3  |-  dom  { <. A ,  B >. }  =  { A }
32unieqi 3923 . 2  |-  U. dom  {
<. A ,  B >. }  =  U. { A }
4 cnvsn.1 . . 3  |-  A  e. 
_V
54unisn 3929 . 2  |-  U. { A }  =  A
63, 5eqtri 2253 1  |-  U. dom  {
<. A ,  B >. }  =  A
Colors of variables: wff set class
Syntax hints:    = wceq 1398    e. wcel 2203   _Vcvv 2812   {csn 3688   <.cop 3691   U.cuni 3913   dom cdm 4748
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2206  ax-ext 2214  ax-sep 4227  ax-pow 4286  ax-pr 4321
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-rex 2526  df-v 2814  df-un 3214  df-in 3216  df-ss 3223  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-br 4109  df-dm 4758
This theorem is referenced by:  op1st  6339  fo1st  6350  f1stres  6352  xpassen  7080  xpdom2  7081
  Copyright terms: Public domain W3C validator