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

Theorem ot1stg 6261
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 6261, ot2ndg 6262, ot3rdgg 6263.) (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 3653 . . . . 5  |-  <. A ,  B ,  C >.  = 
<. <. A ,  B >. ,  C >.
21fveq2i 5602 . . . 4  |-  ( 1st `  <. A ,  B ,  C >. )  =  ( 1st `  <. <. A ,  B >. ,  C >. )
3 opexg 4290 . . . . . 6  |-  ( ( A  e.  V  /\  B  e.  W )  -> 
<. A ,  B >.  e. 
_V )
4 op1stg 6259 . . . . . 6  |-  ( (
<. A ,  B >.  e. 
_V  /\  C  e.  X )  ->  ( 1st `  <. <. A ,  B >. ,  C >. )  =  <. A ,  B >. )
53, 4sylan 283 . . . . 5  |-  ( ( ( A  e.  V  /\  B  e.  W
)  /\  C  e.  X )  ->  ( 1st `  <. <. A ,  B >. ,  C >. )  =  <. A ,  B >. )
653impa 1197 . . . 4  |-  ( ( A  e.  V  /\  B  e.  W  /\  C  e.  X )  ->  ( 1st `  <. <. A ,  B >. ,  C >. )  =  <. A ,  B >. )
72, 6eqtrid 2252 . . 3  |-  ( ( A  e.  V  /\  B  e.  W  /\  C  e.  X )  ->  ( 1st `  <. A ,  B ,  C >. )  =  <. A ,  B >. )
87fveq2d 5603 . 2  |-  ( ( A  e.  V  /\  B  e.  W  /\  C  e.  X )  ->  ( 1st `  ( 1st `  <. A ,  B ,  C >. ) )  =  ( 1st `  <. A ,  B >. )
)
9 op1stg 6259 . . 3  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( 1st `  <. A ,  B >. )  =  A )
1093adant3 1020 . 2  |-  ( ( A  e.  V  /\  B  e.  W  /\  C  e.  X )  ->  ( 1st `  <. A ,  B >. )  =  A )
118, 10eqtrd 2240 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 104    /\ w3a 981    = wceq 1373    e. wcel 2178   _Vcvv 2776   <.cop 3646   <.cotp 3647   ` cfv 5290   1stc1st 6247
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-13 2180  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-un 4498
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-rex 2492  df-v 2778  df-sbc 3006  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-ot 3653  df-uni 3865  df-br 4060  df-opab 4122  df-mpt 4123  df-id 4358  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-iota 5251  df-fun 5292  df-fv 5298  df-1st 6249
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator