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

Theorem op1stbg 4539
Description: Extract the first member of an ordered pair. Theorem 73 of [Suppes] p. 42. (Contributed by Jim Kingdon, 17-Dec-2018.)
Assertion
Ref Expression
op1stbg  |-  ( ( A  e.  V  /\  B  e.  W )  ->  |^| |^| <. A ,  B >.  =  A )

Proof of Theorem op1stbg
StepHypRef Expression
1 dfopg 3826 . . . . 5  |-  ( ( A  e.  V  /\  B  e.  W )  -> 
<. A ,  B >.  =  { { A } ,  { A ,  B } } )
21inteqd 3899 . . . 4  |-  ( ( A  e.  V  /\  B  e.  W )  ->  |^| <. A ,  B >.  =  |^| { { A } ,  { A ,  B } } )
3 snexg 4239 . . . . . 6  |-  ( A  e.  V  ->  { A }  e.  _V )
4 prexg 4266 . . . . . 6  |-  ( ( A  e.  V  /\  B  e.  W )  ->  { A ,  B }  e.  _V )
5 intprg 3927 . . . . . 6  |-  ( ( { A }  e.  _V  /\  { A ,  B }  e.  _V )  ->  |^| { { A } ,  { A ,  B } }  =  ( { A }  i^i  { A ,  B }
) )
63, 4, 5syl2an2r 595 . . . . 5  |-  ( ( A  e.  V  /\  B  e.  W )  ->  |^| { { A } ,  { A ,  B } }  =  ( { A }  i^i  { A ,  B }
) )
7 snsspr1 3787 . . . . . 6  |-  { A }  C_  { A ,  B }
8 df-ss 3183 . . . . . 6  |-  ( { A }  C_  { A ,  B }  <->  ( { A }  i^i  { A ,  B } )  =  { A } )
97, 8mpbi 145 . . . . 5  |-  ( { A }  i^i  { A ,  B }
)  =  { A }
106, 9eqtrdi 2255 . . . 4  |-  ( ( A  e.  V  /\  B  e.  W )  ->  |^| { { A } ,  { A ,  B } }  =  { A } )
112, 10eqtrd 2239 . . 3  |-  ( ( A  e.  V  /\  B  e.  W )  ->  |^| <. A ,  B >.  =  { A }
)
1211inteqd 3899 . 2  |-  ( ( A  e.  V  /\  B  e.  W )  ->  |^| |^| <. A ,  B >.  =  |^| { A } )
13 intsng 3928 . . 3  |-  ( A  e.  V  ->  |^| { A }  =  A )
1413adantr 276 . 2  |-  ( ( A  e.  V  /\  B  e.  W )  ->  |^| { A }  =  A )
1512, 14eqtrd 2239 1  |-  ( ( A  e.  V  /\  B  e.  W )  ->  |^| |^| <. A ,  B >.  =  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1373    e. wcel 2177   _Vcvv 2773    i^i cin 3169    C_ wss 3170   {csn 3638   {cpr 3639   <.cop 3641   |^|cint 3894
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 2180  ax-ext 2188  ax-sep 4173  ax-pow 4229  ax-pr 4264
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ral 2490  df-v 2775  df-un 3174  df-in 3176  df-ss 3183  df-pw 3623  df-sn 3644  df-pr 3645  df-op 3647  df-int 3895
This theorem is referenced by:  elxp5  5185  fundmen  6917
  Copyright terms: Public domain W3C validator