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

Theorem mptpreima 5097
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 4045 . . . . . 6  |-  ( x  e.  A  |->  B )  =  { <. x ,  y >.  |  ( x  e.  A  /\  y  =  B ) }
31, 2eqtri 2186 . . . . 5  |-  F  =  { <. x ,  y
>.  |  ( x  e.  A  /\  y  =  B ) }
43cnveqi 4779 . . . 4  |-  `' F  =  `' { <. x ,  y
>.  |  ( x  e.  A  /\  y  =  B ) }
5 cnvopab 5005 . . . 4  |-  `' { <. x ,  y >.  |  ( x  e.  A  /\  y  =  B ) }  =  { <. y ,  x >.  |  ( x  e.  A  /\  y  =  B ) }
64, 5eqtri 2186 . . 3  |-  `' F  =  { <. y ,  x >.  |  ( x  e.  A  /\  y  =  B ) }
76imaeq1i 4943 . 2  |-  ( `' F " C )  =  ( { <. y ,  x >.  |  ( x  e.  A  /\  y  =  B ) } " C )
8 df-ima 4617 . . 3  |-  ( {
<. y ,  x >.  |  ( x  e.  A  /\  y  =  B
) } " C
)  =  ran  ( { <. y ,  x >.  |  ( x  e.  A  /\  y  =  B ) }  |`  C )
9 resopab 4928 . . . . 5  |-  ( {
<. y ,  x >.  |  ( x  e.  A  /\  y  =  B
) }  |`  C )  =  { <. y ,  x >.  |  (
y  e.  C  /\  ( x  e.  A  /\  y  =  B
) ) }
109rneqi 4832 . . . 4  |-  ran  ( { <. y ,  x >.  |  ( x  e.  A  /\  y  =  B ) }  |`  C )  =  ran  { <. y ,  x >.  |  ( y  e.  C  /\  ( x  e.  A  /\  y  =  B
) ) }
11 ancom 264 . . . . . . . . 9  |-  ( ( y  e.  C  /\  ( x  e.  A  /\  y  =  B
) )  <->  ( (
x  e.  A  /\  y  =  B )  /\  y  e.  C
) )
12 anass 399 . . . . . . . . 9  |-  ( ( ( x  e.  A  /\  y  =  B
)  /\  y  e.  C )  <->  ( x  e.  A  /\  (
y  =  B  /\  y  e.  C )
) )
1311, 12bitri 183 . . . . . . . 8  |-  ( ( y  e.  C  /\  ( x  e.  A  /\  y  =  B
) )  <->  ( x  e.  A  /\  (
y  =  B  /\  y  e.  C )
) )
1413exbii 1593 . . . . . . 7  |-  ( E. y ( y  e.  C  /\  ( x  e.  A  /\  y  =  B ) )  <->  E. y
( x  e.  A  /\  ( y  =  B  /\  y  e.  C
) ) )
15 19.42v 1894 . . . . . . . 8  |-  ( E. y ( x  e.  A  /\  ( y  =  B  /\  y  e.  C ) )  <->  ( x  e.  A  /\  E. y
( y  =  B  /\  y  e.  C
) ) )
16 df-clel 2161 . . . . . . . . . 10  |-  ( B  e.  C  <->  E. y
( y  =  B  /\  y  e.  C
) )
1716bicomi 131 . . . . . . . . 9  |-  ( E. y ( y  =  B  /\  y  e.  C )  <->  B  e.  C )
1817anbi2i 453 . . . . . . . 8  |-  ( ( x  e.  A  /\  E. y ( y  =  B  /\  y  e.  C ) )  <->  ( x  e.  A  /\  B  e.  C ) )
1915, 18bitri 183 . . . . . . 7  |-  ( E. y ( x  e.  A  /\  ( y  =  B  /\  y  e.  C ) )  <->  ( x  e.  A  /\  B  e.  C ) )
2014, 19bitri 183 . . . . . 6  |-  ( E. y ( y  e.  C  /\  ( x  e.  A  /\  y  =  B ) )  <->  ( x  e.  A  /\  B  e.  C ) )
2120abbii 2282 . . . . 5  |-  { x  |  E. y ( y  e.  C  /\  (
x  e.  A  /\  y  =  B )
) }  =  {
x  |  ( x  e.  A  /\  B  e.  C ) }
22 rnopab 4851 . . . . 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 2453 . . . . 5  |-  { x  e.  A  |  B  e.  C }  =  {
x  |  ( x  e.  A  /\  B  e.  C ) }
2421, 22, 233eqtr4i 2196 . . . 4  |-  ran  { <. y ,  x >.  |  ( y  e.  C  /\  ( x  e.  A  /\  y  =  B
) ) }  =  { x  e.  A  |  B  e.  C }
2510, 24eqtri 2186 . . 3  |-  ran  ( { <. y ,  x >.  |  ( x  e.  A  /\  y  =  B ) }  |`  C )  =  { x  e.  A  |  B  e.  C }
268, 25eqtri 2186 . 2  |-  ( {
<. y ,  x >.  |  ( x  e.  A  /\  y  =  B
) } " C
)  =  { x  e.  A  |  B  e.  C }
277, 26eqtri 2186 1  |-  ( `' F " C )  =  { x  e.  A  |  B  e.  C }
Colors of variables: wff set class
Syntax hints:    /\ wa 103    = wceq 1343   E.wex 1480    e. wcel 2136   {cab 2151   {crab 2448   {copab 4042    |-> cmpt 4043   `'ccnv 4603   ran crn 4605    |` cres 4606   "cima 4607
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-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187
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-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-br 3983  df-opab 4044  df-mpt 4045  df-xp 4610  df-rel 4611  df-cnv 4612  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617
This theorem is referenced by:  mptiniseg  5098  dmmpt  5099  fmpt  5635  f1oresrab  5650  suppssfv  6046  suppssov1  6047  infrenegsupex  9532  infxrnegsupex  11204  txcnmpt  12913  txdis1cn  12918  imasnopn  12939
  Copyright terms: Public domain W3C validator