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

Theorem fo2ndresm 6324
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 2294 . . 3  |-  ( u  =  x  ->  (
u  e.  A  <->  x  e.  A ) )
21cbvexv 1967 . 2  |-  ( E. u  u  e.  A  <->  E. x  x  e.  A
)
3 opelxp 4755 . . . . . . . . . 10  |-  ( <.
u ,  v >.  e.  ( A  X.  B
)  <->  ( u  e.  A  /\  v  e.  B ) )
4 fvres 5663 . . . . . . . . . . . 12  |-  ( <.
u ,  v >.  e.  ( A  X.  B
)  ->  ( ( 2nd  |`  ( A  X.  B ) ) `  <. u ,  v >.
)  =  ( 2nd `  <. u ,  v
>. ) )
5 vex 2805 . . . . . . . . . . . . 13  |-  u  e. 
_V
6 vex 2805 . . . . . . . . . . . . 13  |-  v  e. 
_V
75, 6op2nd 6309 . . . . . . . . . . . 12  |-  ( 2nd `  <. u ,  v
>. )  =  v
84, 7eqtr2di 2281 . . . . . . . . . . 11  |-  ( <.
u ,  v >.  e.  ( A  X.  B
)  ->  v  =  ( ( 2nd  |`  ( A  X.  B ) ) `
 <. u ,  v
>. ) )
9 f2ndres 6322 . . . . . . . . . . . . 13  |-  ( 2nd  |`  ( A  X.  B
) ) : ( A  X.  B ) --> B
10 ffn 5482 . . . . . . . . . . . . 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 5779 . . . . . . . . . . . 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 424 . . . . . . . . . . 11  |-  ( <.
u ,  v >.  e.  ( A  X.  B
)  ->  ( ( 2nd  |`  ( A  X.  B ) ) `  <. u ,  v >.
)  e.  ran  ( 2nd  |`  ( A  X.  B ) ) )
148, 13eqeltrd 2308 . . . . . . . . . 10  |-  ( <.
u ,  v >.  e.  ( A  X.  B
)  ->  v  e.  ran  ( 2nd  |`  ( A  X.  B ) ) )
153, 14sylbir 135 . . . . . . . . 9  |-  ( ( u  e.  A  /\  v  e.  B )  ->  v  e.  ran  ( 2nd  |`  ( A  X.  B ) ) )
1615ex 115 . . . . . . . 8  |-  ( u  e.  A  ->  (
v  e.  B  -> 
v  e.  ran  ( 2nd  |`  ( A  X.  B ) ) ) )
1716exlimiv 1646 . . . . . . 7  |-  ( E. u  u  e.  A  ->  ( v  e.  B  ->  v  e.  ran  ( 2nd  |`  ( A  X.  B ) ) ) )
1817ssrdv 3233 . . . . . 6  |-  ( E. u  u  e.  A  ->  B  C_  ran  ( 2nd  |`  ( A  X.  B
) ) )
19 frn 5491 . . . . . . 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 312 . . . . 5  |-  ( E. u  u  e.  A  ->  ( ran  ( 2nd  |`  ( A  X.  B
) )  C_  B  /\  B  C_  ran  ( 2nd  |`  ( A  X.  B ) ) ) )
22 eqss 3242 . . . . 5  |-  ( ran  ( 2nd  |`  ( A  X.  B ) )  =  B  <->  ( ran  ( 2nd  |`  ( A  X.  B ) )  C_  B  /\  B  C_  ran  ( 2nd  |`  ( A  X.  B ) ) ) )
2321, 22sylibr 134 . . . 4  |-  ( E. u  u  e.  A  ->  ran  ( 2nd  |`  ( A  X.  B ) )  =  B )
2423, 9jctil 312 . . 3  |-  ( E. u  u  e.  A  ->  ( ( 2nd  |`  ( A  X.  B ) ) : ( A  X.  B ) --> B  /\  ran  ( 2nd  |`  ( A  X.  B ) )  =  B ) )
25 dffo2 5563 . . 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 134 . 2  |-  ( E. u  u  e.  A  ->  ( 2nd  |`  ( A  X.  B ) ) : ( A  X.  B ) -onto-> B )
272, 26sylbir 135 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 104    = wceq 1397   E.wex 1540    e. wcel 2202    C_ wss 3200   <.cop 3672    X. cxp 4723   ran crn 4726    |` cres 4727    Fn wfn 5321   -->wf 5322   -onto->wfo 5324   ` cfv 5326   2ndc2nd 6301
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-fo 5332  df-fv 5334  df-2nd 6303
This theorem is referenced by:  2ndconst  6386
  Copyright terms: Public domain W3C validator