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

Theorem mptpreima 5159
Description: The preimage of a function in maps-to notation. (Contributed by Stefan O'Rear, 25-Jan-2015.)
Hypothesis
Ref Expression
dmmpo.1  |-  F  =  ( x  e.  A  |->  B )
Assertion
Ref Expression
mptpreima  |-  ( `' F " C )  =  { x  e.  A  |  B  e.  C }
Distinct variable group:    x, C
Allowed substitution hints:    A( x)    B( x)    F( x)

Proof of Theorem mptpreima
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 dmmpo.1 . . . . . 6  |-  F  =  ( x  e.  A  |->  B )
2 df-mpt 4092 . . . . . 6  |-  ( x  e.  A  |->  B )  =  { <. x ,  y >.  |  ( x  e.  A  /\  y  =  B ) }
31, 2eqtri 2214 . . . . 5  |-  F  =  { <. x ,  y
>.  |  ( x  e.  A  /\  y  =  B ) }
43cnveqi 4837 . . . 4  |-  `' F  =  `' { <. x ,  y
>.  |  ( x  e.  A  /\  y  =  B ) }
5 cnvopab 5067 . . . 4  |-  `' { <. x ,  y >.  |  ( x  e.  A  /\  y  =  B ) }  =  { <. y ,  x >.  |  ( x  e.  A  /\  y  =  B ) }
64, 5eqtri 2214 . . 3  |-  `' F  =  { <. y ,  x >.  |  ( x  e.  A  /\  y  =  B ) }
76imaeq1i 5002 . 2  |-  ( `' F " C )  =  ( { <. y ,  x >.  |  ( x  e.  A  /\  y  =  B ) } " C )
8 df-ima 4672 . . 3  |-  ( {
<. y ,  x >.  |  ( x  e.  A  /\  y  =  B
) } " C
)  =  ran  ( { <. y ,  x >.  |  ( x  e.  A  /\  y  =  B ) }  |`  C )
9 resopab 4986 . . . . 5  |-  ( {
<. y ,  x >.  |  ( x  e.  A  /\  y  =  B
) }  |`  C )  =  { <. y ,  x >.  |  (
y  e.  C  /\  ( x  e.  A  /\  y  =  B
) ) }
109rneqi 4890 . . . 4  |-  ran  ( { <. y ,  x >.  |  ( x  e.  A  /\  y  =  B ) }  |`  C )  =  ran  { <. y ,  x >.  |  ( y  e.  C  /\  ( x  e.  A  /\  y  =  B
) ) }
11 ancom 266 . . . . . . . . 9  |-  ( ( y  e.  C  /\  ( x  e.  A  /\  y  =  B
) )  <->  ( (
x  e.  A  /\  y  =  B )  /\  y  e.  C
) )
12 anass 401 . . . . . . . . 9  |-  ( ( ( x  e.  A  /\  y  =  B
)  /\  y  e.  C )  <->  ( x  e.  A  /\  (
y  =  B  /\  y  e.  C )
) )
1311, 12bitri 184 . . . . . . . 8  |-  ( ( y  e.  C  /\  ( x  e.  A  /\  y  =  B
) )  <->  ( x  e.  A  /\  (
y  =  B  /\  y  e.  C )
) )
1413exbii 1616 . . . . . . 7  |-  ( E. y ( y  e.  C  /\  ( x  e.  A  /\  y  =  B ) )  <->  E. y
( x  e.  A  /\  ( y  =  B  /\  y  e.  C
) ) )
15 19.42v 1918 . . . . . . . 8  |-  ( E. y ( x  e.  A  /\  ( y  =  B  /\  y  e.  C ) )  <->  ( x  e.  A  /\  E. y
( y  =  B  /\  y  e.  C
) ) )
16 df-clel 2189 . . . . . . . . . 10  |-  ( B  e.  C  <->  E. y
( y  =  B  /\  y  e.  C
) )
1716bicomi 132 . . . . . . . . 9  |-  ( E. y ( y  =  B  /\  y  e.  C )  <->  B  e.  C )
1817anbi2i 457 . . . . . . . 8  |-  ( ( x  e.  A  /\  E. y ( y  =  B  /\  y  e.  C ) )  <->  ( x  e.  A  /\  B  e.  C ) )
1915, 18bitri 184 . . . . . . 7  |-  ( E. y ( x  e.  A  /\  ( y  =  B  /\  y  e.  C ) )  <->  ( x  e.  A  /\  B  e.  C ) )
2014, 19bitri 184 . . . . . 6  |-  ( E. y ( y  e.  C  /\  ( x  e.  A  /\  y  =  B ) )  <->  ( x  e.  A  /\  B  e.  C ) )
2120abbii 2309 . . . . 5  |-  { x  |  E. y ( y  e.  C  /\  (
x  e.  A  /\  y  =  B )
) }  =  {
x  |  ( x  e.  A  /\  B  e.  C ) }
22 rnopab 4909 . . . . 5  |-  ran  { <. y ,  x >.  |  ( y  e.  C  /\  ( x  e.  A  /\  y  =  B
) ) }  =  { x  |  E. y ( y  e.  C  /\  ( x  e.  A  /\  y  =  B ) ) }
23 df-rab 2481 . . . . 5  |-  { x  e.  A  |  B  e.  C }  =  {
x  |  ( x  e.  A  /\  B  e.  C ) }
2421, 22, 233eqtr4i 2224 . . . 4  |-  ran  { <. y ,  x >.  |  ( y  e.  C  /\  ( x  e.  A  /\  y  =  B
) ) }  =  { x  e.  A  |  B  e.  C }
2510, 24eqtri 2214 . . 3  |-  ran  ( { <. y ,  x >.  |  ( x  e.  A  /\  y  =  B ) }  |`  C )  =  { x  e.  A  |  B  e.  C }
268, 25eqtri 2214 . 2  |-  ( {
<. y ,  x >.  |  ( x  e.  A  /\  y  =  B
) } " C
)  =  { x  e.  A  |  B  e.  C }
277, 26eqtri 2214 1  |-  ( `' F " C )  =  { x  e.  A  |  B  e.  C }
Colors of variables: wff set class
Syntax hints:    /\ wa 104    = wceq 1364   E.wex 1503    e. wcel 2164   {cab 2179   {crab 2476   {copab 4089    |-> cmpt 4090   `'ccnv 4658   ran crn 4660    |` cres 4661   "cima 4662
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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-rab 2481  df-v 2762  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-br 4030  df-opab 4091  df-mpt 4092  df-xp 4665  df-rel 4666  df-cnv 4667  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672
This theorem is referenced by:  mptiniseg  5160  dmmpt  5161  fmpt  5708  f1oresrab  5723  suppssfv  6126  suppssov1  6127  infrenegsupex  9659  infxrnegsupex  11406  eqglact  13295  fczpsrbag  14157  txcnmpt  14441  txdis1cn  14446  imasnopn  14467
  Copyright terms: Public domain W3C validator