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

Theorem fo1stresm 6129
Description: Onto mapping of a restriction of the  1st (first member of an ordered pair) function. (Contributed by Jim Kingdon, 24-Jan-2019.)
Assertion
Ref Expression
fo1stresm  |-  ( E. y  y  e.  B  ->  ( 1st  |`  ( A  X.  B ) ) : ( A  X.  B ) -onto-> A )
Distinct variable group:    y, B
Allowed substitution hint:    A( y)

Proof of Theorem fo1stresm
Dummy variables  v  u are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eleq1 2229 . . 3  |-  ( v  =  y  ->  (
v  e.  B  <->  y  e.  B ) )
21cbvexv 1906 . 2  |-  ( E. v  v  e.  B  <->  E. y  y  e.  B
)
3 opelxp 4634 . . . . . . . . . 10  |-  ( <.
u ,  v >.  e.  ( A  X.  B
)  <->  ( u  e.  A  /\  v  e.  B ) )
4 fvres 5510 . . . . . . . . . . . 12  |-  ( <.
u ,  v >.  e.  ( A  X.  B
)  ->  ( ( 1st  |`  ( A  X.  B ) ) `  <. u ,  v >.
)  =  ( 1st `  <. u ,  v
>. ) )
5 vex 2729 . . . . . . . . . . . . 13  |-  u  e. 
_V
6 vex 2729 . . . . . . . . . . . . 13  |-  v  e. 
_V
75, 6op1st 6114 . . . . . . . . . . . 12  |-  ( 1st `  <. u ,  v
>. )  =  u
84, 7eqtr2di 2216 . . . . . . . . . . 11  |-  ( <.
u ,  v >.  e.  ( A  X.  B
)  ->  u  =  ( ( 1st  |`  ( A  X.  B ) ) `
 <. u ,  v
>. ) )
9 f1stres 6127 . . . . . . . . . . . . 13  |-  ( 1st  |`  ( A  X.  B
) ) : ( A  X.  B ) --> A
10 ffn 5337 . . . . . . . . . . . . 13  |-  ( ( 1st  |`  ( A  X.  B ) ) : ( A  X.  B
) --> A  ->  ( 1st  |`  ( A  X.  B ) )  Fn  ( A  X.  B
) )
119, 10ax-mp 5 . . . . . . . . . . . 12  |-  ( 1st  |`  ( A  X.  B
) )  Fn  ( A  X.  B )
12 fnfvelrn 5617 . . . . . . . . . . . 12  |-  ( ( ( 1st  |`  ( A  X.  B ) )  Fn  ( A  X.  B )  /\  <. u ,  v >.  e.  ( A  X.  B ) )  ->  ( ( 1st  |`  ( A  X.  B ) ) `  <. u ,  v >.
)  e.  ran  ( 1st  |`  ( A  X.  B ) ) )
1311, 12mpan 421 . . . . . . . . . . 11  |-  ( <.
u ,  v >.  e.  ( A  X.  B
)  ->  ( ( 1st  |`  ( A  X.  B ) ) `  <. u ,  v >.
)  e.  ran  ( 1st  |`  ( A  X.  B ) ) )
148, 13eqeltrd 2243 . . . . . . . . . 10  |-  ( <.
u ,  v >.  e.  ( A  X.  B
)  ->  u  e.  ran  ( 1st  |`  ( A  X.  B ) ) )
153, 14sylbir 134 . . . . . . . . 9  |-  ( ( u  e.  A  /\  v  e.  B )  ->  u  e.  ran  ( 1st  |`  ( A  X.  B ) ) )
1615expcom 115 . . . . . . . 8  |-  ( v  e.  B  ->  (
u  e.  A  ->  u  e.  ran  ( 1st  |`  ( A  X.  B
) ) ) )
1716exlimiv 1586 . . . . . . 7  |-  ( E. v  v  e.  B  ->  ( u  e.  A  ->  u  e.  ran  ( 1st  |`  ( A  X.  B ) ) ) )
1817ssrdv 3148 . . . . . 6  |-  ( E. v  v  e.  B  ->  A  C_  ran  ( 1st  |`  ( A  X.  B
) ) )
19 frn 5346 . . . . . . 7  |-  ( ( 1st  |`  ( A  X.  B ) ) : ( A  X.  B
) --> A  ->  ran  ( 1st  |`  ( A  X.  B ) )  C_  A )
209, 19ax-mp 5 . . . . . 6  |-  ran  ( 1st  |`  ( A  X.  B ) )  C_  A
2118, 20jctil 310 . . . . 5  |-  ( E. v  v  e.  B  ->  ( ran  ( 1st  |`  ( A  X.  B
) )  C_  A  /\  A  C_  ran  ( 1st  |`  ( A  X.  B ) ) ) )
22 eqss 3157 . . . . 5  |-  ( ran  ( 1st  |`  ( A  X.  B ) )  =  A  <->  ( ran  ( 1st  |`  ( A  X.  B ) )  C_  A  /\  A  C_  ran  ( 1st  |`  ( A  X.  B ) ) ) )
2321, 22sylibr 133 . . . 4  |-  ( E. v  v  e.  B  ->  ran  ( 1st  |`  ( A  X.  B ) )  =  A )
2423, 9jctil 310 . . 3  |-  ( E. v  v  e.  B  ->  ( ( 1st  |`  ( A  X.  B ) ) : ( A  X.  B ) --> A  /\  ran  ( 1st  |`  ( A  X.  B ) )  =  A ) )
25 dffo2 5414 . . 3  |-  ( ( 1st  |`  ( A  X.  B ) ) : ( A  X.  B
) -onto-> A  <->  ( ( 1st  |`  ( A  X.  B
) ) : ( A  X.  B ) --> A  /\  ran  ( 1st  |`  ( A  X.  B ) )  =  A ) )
2624, 25sylibr 133 . 2  |-  ( E. v  v  e.  B  ->  ( 1st  |`  ( A  X.  B ) ) : ( A  X.  B ) -onto-> A )
272, 26sylbir 134 1  |-  ( E. y  y  e.  B  ->  ( 1st  |`  ( A  X.  B ) ) : ( A  X.  B ) -onto-> A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1343   E.wex 1480    e. wcel 2136    C_ wss 3116   <.cop 3579    X. cxp 4602   ran crn 4605    |` cres 4606    Fn wfn 5183   -->wf 5184   -onto->wfo 5186   ` cfv 5188   1stc1st 6106
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187  ax-un 4411
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-rab 2453  df-v 2728  df-sbc 2952  df-csb 3046  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-iun 3868  df-br 3983  df-opab 4044  df-mpt 4045  df-id 4271  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-fo 5194  df-fv 5196  df-1st 6108
This theorem is referenced by:  1stconst  6189
  Copyright terms: Public domain W3C validator