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

Theorem op1steq 5949
Description: Two ways of expressing that an element is the first member of an ordered pair. (Contributed by NM, 22-Sep-2013.) (Revised by Mario Carneiro, 23-Feb-2014.)
Assertion
Ref Expression
op1steq  |-  ( A  e.  ( V  X.  W )  ->  (
( 1st `  A
)  =  B  <->  E. x  A  =  <. B ,  x >. ) )
Distinct variable groups:    x, A    x, B
Allowed substitution hints:    V( x)    W( x)

Proof of Theorem op1steq
StepHypRef Expression
1 xpss 4546 . . 3  |-  ( V  X.  W )  C_  ( _V  X.  _V )
21sseli 3021 . 2  |-  ( A  e.  ( V  X.  W )  ->  A  e.  ( _V  X.  _V ) )
3 eqid 2088 . . . . . 6  |-  ( 2nd `  A )  =  ( 2nd `  A )
4 eqopi 5942 . . . . . 6  |-  ( ( A  e.  ( _V 
X.  _V )  /\  (
( 1st `  A
)  =  B  /\  ( 2nd `  A )  =  ( 2nd `  A
) ) )  ->  A  =  <. B , 
( 2nd `  A
) >. )
53, 4mpanr2 429 . . . . 5  |-  ( ( A  e.  ( _V 
X.  _V )  /\  ( 1st `  A )  =  B )  ->  A  =  <. B ,  ( 2nd `  A )
>. )
6 2ndexg 5939 . . . . . . 7  |-  ( A  e.  ( _V  X.  _V )  ->  ( 2nd `  A )  e.  _V )
7 opeq2 3623 . . . . . . . . 9  |-  ( x  =  ( 2nd `  A
)  ->  <. B ,  x >.  =  <. B , 
( 2nd `  A
) >. )
87eqeq2d 2099 . . . . . . . 8  |-  ( x  =  ( 2nd `  A
)  ->  ( A  =  <. B ,  x >.  <-> 
A  =  <. B , 
( 2nd `  A
) >. ) )
98spcegv 2707 . . . . . . 7  |-  ( ( 2nd `  A )  e.  _V  ->  ( A  =  <. B , 
( 2nd `  A
) >.  ->  E. x  A  =  <. B ,  x >. ) )
106, 9syl 14 . . . . . 6  |-  ( A  e.  ( _V  X.  _V )  ->  ( A  =  <. B ,  ( 2nd `  A )
>.  ->  E. x  A  = 
<. B ,  x >. ) )
1110adantr 270 . . . . 5  |-  ( ( A  e.  ( _V 
X.  _V )  /\  ( 1st `  A )  =  B )  ->  ( A  =  <. B , 
( 2nd `  A
) >.  ->  E. x  A  =  <. B ,  x >. ) )
125, 11mpd 13 . . . 4  |-  ( ( A  e.  ( _V 
X.  _V )  /\  ( 1st `  A )  =  B )  ->  E. x  A  =  <. B ,  x >. )
1312ex 113 . . 3  |-  ( A  e.  ( _V  X.  _V )  ->  ( ( 1st `  A )  =  B  ->  E. x  A  =  <. B ,  x >. ) )
14 eqop 5947 . . . . 5  |-  ( A  e.  ( _V  X.  _V )  ->  ( A  =  <. B ,  x >.  <-> 
( ( 1st `  A
)  =  B  /\  ( 2nd `  A )  =  x ) ) )
15 simpl 107 . . . . 5  |-  ( ( ( 1st `  A
)  =  B  /\  ( 2nd `  A )  =  x )  -> 
( 1st `  A
)  =  B )
1614, 15syl6bi 161 . . . 4  |-  ( A  e.  ( _V  X.  _V )  ->  ( A  =  <. B ,  x >.  ->  ( 1st `  A
)  =  B ) )
1716exlimdv 1747 . . 3  |-  ( A  e.  ( _V  X.  _V )  ->  ( E. x  A  =  <. B ,  x >.  ->  ( 1st `  A )  =  B ) )
1813, 17impbid 127 . 2  |-  ( A  e.  ( _V  X.  _V )  ->  ( ( 1st `  A )  =  B  <->  E. x  A  =  <. B ,  x >. ) )
192, 18syl 14 1  |-  ( A  e.  ( V  X.  W )  ->  (
( 1st `  A
)  =  B  <->  E. x  A  =  <. B ,  x >. ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    <-> wb 103    = wceq 1289   E.wex 1426    e. wcel 1438   _Vcvv 2619   <.cop 3449    X. cxp 4436   ` cfv 5015   1stc1st 5909   2ndc2nd 5910
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-13 1449  ax-14 1450  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070  ax-sep 3957  ax-pow 4009  ax-pr 4036  ax-un 4260
This theorem depends on definitions:  df-bi 115  df-3an 926  df-tru 1292  df-nf 1395  df-sb 1693  df-eu 1951  df-mo 1952  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-ral 2364  df-rex 2365  df-v 2621  df-sbc 2841  df-un 3003  df-in 3005  df-ss 3012  df-pw 3431  df-sn 3452  df-pr 3453  df-op 3455  df-uni 3654  df-br 3846  df-opab 3900  df-mpt 3901  df-id 4120  df-xp 4444  df-rel 4445  df-cnv 4446  df-co 4447  df-dm 4448  df-rn 4449  df-iota 4980  df-fun 5017  df-fn 5018  df-f 5019  df-fo 5021  df-fv 5023  df-1st 5911  df-2nd 5912
This theorem is referenced by:  releldm2  5955
  Copyright terms: Public domain W3C validator