MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ot1stg Unicode version

Theorem ot1stg 6300
Description: Extract the first member of an ordered triple. (Due to infrequent usage, it isn't worthwhile at this point to define special extractors for triples, so we reuse the ordered pair extractors for ot1stg 6300, ot2ndg 6301, ot3rdg 6302.) (Contributed by NM, 3-Apr-2015.) (Revised by Mario Carneiro, 2-May-2015.)
Assertion
Ref Expression
ot1stg  |-  ( ( A  e.  V  /\  B  e.  W  /\  C  e.  X )  ->  ( 1st `  ( 1st `  <. A ,  B ,  C >. ) )  =  A )

Proof of Theorem ot1stg
StepHypRef Expression
1 df-ot 3767 . . . . . 6  |-  <. A ,  B ,  C >.  = 
<. <. A ,  B >. ,  C >.
21fveq2i 5671 . . . . 5  |-  ( 1st `  <. A ,  B ,  C >. )  =  ( 1st `  <. <. A ,  B >. ,  C >. )
3 opex 4368 . . . . . 6  |-  <. A ,  B >.  e.  _V
4 op1stg 6298 . . . . . 6  |-  ( (
<. A ,  B >.  e. 
_V  /\  C  e.  X )  ->  ( 1st `  <. <. A ,  B >. ,  C >. )  =  <. A ,  B >. )
53, 4mpan 652 . . . . 5  |-  ( C  e.  X  ->  ( 1st `  <. <. A ,  B >. ,  C >. )  =  <. A ,  B >. )
62, 5syl5eq 2431 . . . 4  |-  ( C  e.  X  ->  ( 1st `  <. A ,  B ,  C >. )  =  <. A ,  B >. )
76fveq2d 5672 . . 3  |-  ( C  e.  X  ->  ( 1st `  ( 1st `  <. A ,  B ,  C >. ) )  =  ( 1st `  <. A ,  B >. ) )
8 op1stg 6298 . . 3  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( 1st `  <. A ,  B >. )  =  A )
97, 8sylan9eqr 2441 . 2  |-  ( ( ( A  e.  V  /\  B  e.  W
)  /\  C  e.  X )  ->  ( 1st `  ( 1st `  <. A ,  B ,  C >. ) )  =  A )
1093impa 1148 1  |-  ( ( A  e.  V  /\  B  e.  W  /\  C  e.  X )  ->  ( 1st `  ( 1st `  <. A ,  B ,  C >. ) )  =  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 359    /\ w3a 936    = wceq 1649    e. wcel 1717   _Vcvv 2899   <.cop 3760   <.cotp 3761   ` cfv 5394   1stc1st 6286
This theorem is referenced by:  splval  11707  mamufval  27112  mapdhval  31839  hdmap1val  31914
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-13 1719  ax-14 1721  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2368  ax-sep 4271  ax-nul 4279  ax-pow 4318  ax-pr 4344  ax-un 4641
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2242  df-mo 2243  df-clab 2374  df-cleq 2380  df-clel 2383  df-nfc 2512  df-ne 2552  df-ral 2654  df-rex 2655  df-rab 2658  df-v 2901  df-sbc 3105  df-dif 3266  df-un 3268  df-in 3270  df-ss 3277  df-nul 3572  df-if 3683  df-sn 3763  df-pr 3764  df-op 3766  df-ot 3767  df-uni 3958  df-br 4154  df-opab 4208  df-mpt 4209  df-id 4439  df-xp 4824  df-rel 4825  df-cnv 4826  df-co 4827  df-dm 4828  df-rn 4829  df-iota 5358  df-fun 5396  df-fv 5402  df-1st 6288
  Copyright terms: Public domain W3C validator