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

Theorem resf1st 15310
Description: Value of the functor restriction operator on objects. (Contributed by Mario Carneiro, 6-Jan-2017.)
Hypotheses
Ref Expression
resf1st.f  |-  ( ph  ->  F  e.  V )
resf1st.h  |-  ( ph  ->  H  e.  W )
resf1st.s  |-  ( ph  ->  H  Fn  ( S  X.  S ) )
Assertion
Ref Expression
resf1st  |-  ( ph  ->  ( 1st `  ( F  |`f  H ) )  =  ( ( 1st `  F
)  |`  S ) )

Proof of Theorem resf1st
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 resf1st.f . . . 4  |-  ( ph  ->  F  e.  V )
2 resf1st.h . . . 4  |-  ( ph  ->  H  e.  W )
31, 2resfval 15308 . . 3  |-  ( ph  ->  ( F  |`f  H )  =  <. ( ( 1st `  F
)  |`  dom  dom  H
) ,  ( z  e.  dom  H  |->  ( ( ( 2nd `  F
) `  z )  |`  ( H `  z
) ) ) >.
)
43fveq2d 5876 . 2  |-  ( ph  ->  ( 1st `  ( F  |`f  H ) )  =  ( 1st `  <. ( ( 1st `  F
)  |`  dom  dom  H
) ,  ( z  e.  dom  H  |->  ( ( ( 2nd `  F
) `  z )  |`  ( H `  z
) ) ) >.
) )
5 fvex 5882 . . . 4  |-  ( 1st `  F )  e.  _V
65resex 5327 . . 3  |-  ( ( 1st `  F )  |`  dom  dom  H )  e.  _V
7 dmexg 6730 . . . 4  |-  ( H  e.  W  ->  dom  H  e.  _V )
8 mptexg 6143 . . . 4  |-  ( dom 
H  e.  _V  ->  ( z  e.  dom  H  |->  ( ( ( 2nd `  F ) `  z
)  |`  ( H `  z ) ) )  e.  _V )
92, 7, 83syl 20 . . 3  |-  ( ph  ->  ( z  e.  dom  H 
|->  ( ( ( 2nd `  F ) `  z
)  |`  ( H `  z ) ) )  e.  _V )
10 op1stg 6811 . . 3  |-  ( ( ( ( 1st `  F
)  |`  dom  dom  H
)  e.  _V  /\  ( z  e.  dom  H 
|->  ( ( ( 2nd `  F ) `  z
)  |`  ( H `  z ) ) )  e.  _V )  -> 
( 1st `  <. ( ( 1st `  F
)  |`  dom  dom  H
) ,  ( z  e.  dom  H  |->  ( ( ( 2nd `  F
) `  z )  |`  ( H `  z
) ) ) >.
)  =  ( ( 1st `  F )  |`  dom  dom  H )
)
116, 9, 10sylancr 663 . 2  |-  ( ph  ->  ( 1st `  <. ( ( 1st `  F
)  |`  dom  dom  H
) ,  ( z  e.  dom  H  |->  ( ( ( 2nd `  F
) `  z )  |`  ( H `  z
) ) ) >.
)  =  ( ( 1st `  F )  |`  dom  dom  H )
)
12 resf1st.s . . . . . 6  |-  ( ph  ->  H  Fn  ( S  X.  S ) )
13 fndm 5686 . . . . . 6  |-  ( H  Fn  ( S  X.  S )  ->  dom  H  =  ( S  X.  S ) )
1412, 13syl 16 . . . . 5  |-  ( ph  ->  dom  H  =  ( S  X.  S ) )
1514dmeqd 5215 . . . 4  |-  ( ph  ->  dom  dom  H  =  dom  ( S  X.  S
) )
16 dmxpid 5232 . . . 4  |-  dom  ( S  X.  S )  =  S
1715, 16syl6eq 2514 . . 3  |-  ( ph  ->  dom  dom  H  =  S )
1817reseq2d 5283 . 2  |-  ( ph  ->  ( ( 1st `  F
)  |`  dom  dom  H
)  =  ( ( 1st `  F )  |`  S ) )
194, 11, 183eqtrd 2502 1  |-  ( ph  ->  ( 1st `  ( F  |`f  H ) )  =  ( ( 1st `  F
)  |`  S ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    = wceq 1395    e. wcel 1819   _Vcvv 3109   <.cop 4038    |-> cmpt 4515    X. cxp 5006   dom cdm 5008    |` cres 5010    Fn wfn 5589   ` cfv 5594  (class class class)co 6296   1stc1st 6797   2ndc2nd 6798    |`f cresf 15273
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1619  ax-4 1632  ax-5 1705  ax-6 1748  ax-7 1791  ax-8 1821  ax-9 1823  ax-10 1838  ax-11 1843  ax-12 1855  ax-13 2000  ax-ext 2435  ax-rep 4568  ax-sep 4578  ax-nul 4586  ax-pow 4634  ax-pr 4695  ax-un 6591
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1398  df-ex 1614  df-nf 1618  df-sb 1741  df-eu 2287  df-mo 2288  df-clab 2443  df-cleq 2449  df-clel 2452  df-nfc 2607  df-ne 2654  df-ral 2812  df-rex 2813  df-reu 2814  df-rab 2816  df-v 3111  df-sbc 3328  df-csb 3431  df-dif 3474  df-un 3476  df-in 3478  df-ss 3485  df-nul 3794  df-if 3945  df-sn 4033  df-pr 4035  df-op 4039  df-uni 4252  df-iun 4334  df-br 4457  df-opab 4516  df-mpt 4517  df-id 4804  df-xp 5014  df-rel 5015  df-cnv 5016  df-co 5017  df-dm 5018  df-rn 5019  df-res 5020  df-ima 5021  df-iota 5557  df-fun 5596  df-fn 5597  df-f 5598  df-f1 5599  df-fo 5600  df-f1o 5601  df-fv 5602  df-ov 6299  df-oprab 6300  df-mpt2 6301  df-1st 6799  df-resf 15277
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator