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

Theorem fo2ndresm 6068
Description: Onto mapping of a restriction of the  2nd (second member of an ordered pair) function. (Contributed by Jim Kingdon, 24-Jan-2019.)
Assertion
Ref Expression
fo2ndresm  |-  ( E. x  x  e.  A  ->  ( 2nd  |`  ( A  X.  B ) ) : ( A  X.  B ) -onto-> B )
Distinct variable group:    x, A
Allowed substitution hint:    B( x)

Proof of Theorem fo2ndresm
Dummy variables  v  u are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eleq1 2203 . . 3  |-  ( u  =  x  ->  (
u  e.  A  <->  x  e.  A ) )
21cbvexv 1891 . 2  |-  ( E. u  u  e.  A  <->  E. x  x  e.  A
)
3 opelxp 4577 . . . . . . . . . 10  |-  ( <.
u ,  v >.  e.  ( A  X.  B
)  <->  ( u  e.  A  /\  v  e.  B ) )
4 fvres 5453 . . . . . . . . . . . 12  |-  ( <.
u ,  v >.  e.  ( A  X.  B
)  ->  ( ( 2nd  |`  ( A  X.  B ) ) `  <. u ,  v >.
)  =  ( 2nd `  <. u ,  v
>. ) )
5 vex 2692 . . . . . . . . . . . . 13  |-  u  e. 
_V
6 vex 2692 . . . . . . . . . . . . 13  |-  v  e. 
_V
75, 6op2nd 6053 . . . . . . . . . . . 12  |-  ( 2nd `  <. u ,  v
>. )  =  v
84, 7eqtr2di 2190 . . . . . . . . . . 11  |-  ( <.
u ,  v >.  e.  ( A  X.  B
)  ->  v  =  ( ( 2nd  |`  ( A  X.  B ) ) `
 <. u ,  v
>. ) )
9 f2ndres 6066 . . . . . . . . . . . . 13  |-  ( 2nd  |`  ( A  X.  B
) ) : ( A  X.  B ) --> B
10 ffn 5280 . . . . . . . . . . . . 13  |-  ( ( 2nd  |`  ( A  X.  B ) ) : ( A  X.  B
) --> B  ->  ( 2nd  |`  ( A  X.  B ) )  Fn  ( A  X.  B
) )
119, 10ax-mp 5 . . . . . . . . . . . 12  |-  ( 2nd  |`  ( A  X.  B
) )  Fn  ( A  X.  B )
12 fnfvelrn 5560 . . . . . . . . . . . 12  |-  ( ( ( 2nd  |`  ( A  X.  B ) )  Fn  ( A  X.  B )  /\  <. u ,  v >.  e.  ( A  X.  B ) )  ->  ( ( 2nd  |`  ( A  X.  B ) ) `  <. u ,  v >.
)  e.  ran  ( 2nd  |`  ( A  X.  B ) ) )
1311, 12mpan 421 . . . . . . . . . . 11  |-  ( <.
u ,  v >.  e.  ( A  X.  B
)  ->  ( ( 2nd  |`  ( A  X.  B ) ) `  <. u ,  v >.
)  e.  ran  ( 2nd  |`  ( A  X.  B ) ) )
148, 13eqeltrd 2217 . . . . . . . . . 10  |-  ( <.
u ,  v >.  e.  ( A  X.  B
)  ->  v  e.  ran  ( 2nd  |`  ( A  X.  B ) ) )
153, 14sylbir 134 . . . . . . . . 9  |-  ( ( u  e.  A  /\  v  e.  B )  ->  v  e.  ran  ( 2nd  |`  ( A  X.  B ) ) )
1615ex 114 . . . . . . . 8  |-  ( u  e.  A  ->  (
v  e.  B  -> 
v  e.  ran  ( 2nd  |`  ( A  X.  B ) ) ) )
1716exlimiv 1578 . . . . . . 7  |-  ( E. u  u  e.  A  ->  ( v  e.  B  ->  v  e.  ran  ( 2nd  |`  ( A  X.  B ) ) ) )
1817ssrdv 3108 . . . . . 6  |-  ( E. u  u  e.  A  ->  B  C_  ran  ( 2nd  |`  ( A  X.  B
) ) )
19 frn 5289 . . . . . . 7  |-  ( ( 2nd  |`  ( A  X.  B ) ) : ( A  X.  B
) --> B  ->  ran  ( 2nd  |`  ( A  X.  B ) )  C_  B )
209, 19ax-mp 5 . . . . . 6  |-  ran  ( 2nd  |`  ( A  X.  B ) )  C_  B
2118, 20jctil 310 . . . . 5  |-  ( E. u  u  e.  A  ->  ( ran  ( 2nd  |`  ( A  X.  B
) )  C_  B  /\  B  C_  ran  ( 2nd  |`  ( A  X.  B ) ) ) )
22 eqss 3117 . . . . 5  |-  ( ran  ( 2nd  |`  ( A  X.  B ) )  =  B  <->  ( ran  ( 2nd  |`  ( A  X.  B ) )  C_  B  /\  B  C_  ran  ( 2nd  |`  ( A  X.  B ) ) ) )
2321, 22sylibr 133 . . . 4  |-  ( E. u  u  e.  A  ->  ran  ( 2nd  |`  ( A  X.  B ) )  =  B )
2423, 9jctil 310 . . 3  |-  ( E. u  u  e.  A  ->  ( ( 2nd  |`  ( A  X.  B ) ) : ( A  X.  B ) --> B  /\  ran  ( 2nd  |`  ( A  X.  B ) )  =  B ) )
25 dffo2 5357 . . 3  |-  ( ( 2nd  |`  ( A  X.  B ) ) : ( A  X.  B
) -onto-> B  <->  ( ( 2nd  |`  ( A  X.  B
) ) : ( A  X.  B ) --> B  /\  ran  ( 2nd  |`  ( A  X.  B ) )  =  B ) )
2624, 25sylibr 133 . 2  |-  ( E. u  u  e.  A  ->  ( 2nd  |`  ( A  X.  B ) ) : ( A  X.  B ) -onto-> B )
272, 26sylbir 134 1  |-  ( E. x  x  e.  A  ->  ( 2nd  |`  ( A  X.  B ) ) : ( A  X.  B ) -onto-> B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1332   E.wex 1469    e. wcel 1481    C_ wss 3076   <.cop 3535    X. cxp 4545   ran crn 4548    |` cres 4549    Fn wfn 5126   -->wf 5127   -onto->wfo 5129   ` cfv 5131   2ndc2nd 6045
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 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-pow 4106  ax-pr 4139  ax-un 4363
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-rab 2426  df-v 2691  df-sbc 2914  df-csb 3008  df-un 3080  df-in 3082  df-ss 3089  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-iun 3823  df-br 3938  df-opab 3998  df-mpt 3999  df-id 4223  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-rn 4558  df-res 4559  df-ima 4560  df-iota 5096  df-fun 5133  df-fn 5134  df-f 5135  df-fo 5137  df-fv 5139  df-2nd 6047
This theorem is referenced by:  2ndconst  6127
  Copyright terms: Public domain W3C validator