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

Theorem op1stbg 4510
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 3802 . . . . 5  |-  ( ( A  e.  V  /\  B  e.  W )  -> 
<. A ,  B >.  =  { { A } ,  { A ,  B } } )
21inteqd 3875 . . . 4  |-  ( ( A  e.  V  /\  B  e.  W )  ->  |^| <. A ,  B >.  =  |^| { { A } ,  { A ,  B } } )
3 snexg 4213 . . . . . 6  |-  ( A  e.  V  ->  { A }  e.  _V )
4 prexg 4240 . . . . . 6  |-  ( ( A  e.  V  /\  B  e.  W )  ->  { A ,  B }  e.  _V )
5 intprg 3903 . . . . . 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 3766 . . . . . 6  |-  { A }  C_  { A ,  B }
8 df-ss 3166 . . . . . 6  |-  ( { A }  C_  { A ,  B }  <->  ( { A }  i^i  { A ,  B } )  =  { A } )
97, 8mpbi 145 . . . . 5  |-  ( { A }  i^i  { A ,  B }
)  =  { A }
106, 9eqtrdi 2242 . . . 4  |-  ( ( A  e.  V  /\  B  e.  W )  ->  |^| { { A } ,  { A ,  B } }  =  { A } )
112, 10eqtrd 2226 . . 3  |-  ( ( A  e.  V  /\  B  e.  W )  ->  |^| <. A ,  B >.  =  { A }
)
1211inteqd 3875 . 2  |-  ( ( A  e.  V  /\  B  e.  W )  ->  |^| |^| <. A ,  B >.  =  |^| { A } )
13 intsng 3904 . . 3  |-  ( A  e.  V  ->  |^| { A }  =  A )
1413adantr 276 . 2  |-  ( ( A  e.  V  /\  B  e.  W )  ->  |^| { A }  =  A )
1512, 14eqtrd 2226 1  |-  ( ( A  e.  V  /\  B  e.  W )  ->  |^| |^| <. A ,  B >.  =  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1364    e. wcel 2164   _Vcvv 2760    i^i cin 3152    C_ wss 3153   {csn 3618   {cpr 3619   <.cop 3621   |^|cint 3870
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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-v 2762  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-int 3871
This theorem is referenced by:  elxp5  5154  fundmen  6860
  Copyright terms: Public domain W3C validator