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

Theorem mptpreima 5185
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 4115 . . . . . 6  |-  ( x  e.  A  |->  B )  =  { <. x ,  y >.  |  ( x  e.  A  /\  y  =  B ) }
31, 2eqtri 2227 . . . . 5  |-  F  =  { <. x ,  y
>.  |  ( x  e.  A  /\  y  =  B ) }
43cnveqi 4861 . . . 4  |-  `' F  =  `' { <. x ,  y
>.  |  ( x  e.  A  /\  y  =  B ) }
5 cnvopab 5093 . . . 4  |-  `' { <. x ,  y >.  |  ( x  e.  A  /\  y  =  B ) }  =  { <. y ,  x >.  |  ( x  e.  A  /\  y  =  B ) }
64, 5eqtri 2227 . . 3  |-  `' F  =  { <. y ,  x >.  |  ( x  e.  A  /\  y  =  B ) }
76imaeq1i 5028 . 2  |-  ( `' F " C )  =  ( { <. y ,  x >.  |  ( x  e.  A  /\  y  =  B ) } " C )
8 df-ima 4696 . . 3  |-  ( {
<. y ,  x >.  |  ( x  e.  A  /\  y  =  B
) } " C
)  =  ran  ( { <. y ,  x >.  |  ( x  e.  A  /\  y  =  B ) }  |`  C )
9 resopab 5012 . . . . 5  |-  ( {
<. y ,  x >.  |  ( x  e.  A  /\  y  =  B
) }  |`  C )  =  { <. y ,  x >.  |  (
y  e.  C  /\  ( x  e.  A  /\  y  =  B
) ) }
109rneqi 4915 . . . 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 1629 . . . . . . 7  |-  ( E. y ( y  e.  C  /\  ( x  e.  A  /\  y  =  B ) )  <->  E. y
( x  e.  A  /\  ( y  =  B  /\  y  e.  C
) ) )
15 19.42v 1931 . . . . . . . 8  |-  ( E. y ( x  e.  A  /\  ( y  =  B  /\  y  e.  C ) )  <->  ( x  e.  A  /\  E. y
( y  =  B  /\  y  e.  C
) ) )
16 df-clel 2202 . . . . . . . . . 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 2322 . . . . 5  |-  { x  |  E. y ( y  e.  C  /\  (
x  e.  A  /\  y  =  B )
) }  =  {
x  |  ( x  e.  A  /\  B  e.  C ) }
22 rnopab 4934 . . . . 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 2494 . . . . 5  |-  { x  e.  A  |  B  e.  C }  =  {
x  |  ( x  e.  A  /\  B  e.  C ) }
2421, 22, 233eqtr4i 2237 . . . 4  |-  ran  { <. y ,  x >.  |  ( y  e.  C  /\  ( x  e.  A  /\  y  =  B
) ) }  =  { x  e.  A  |  B  e.  C }
2510, 24eqtri 2227 . . 3  |-  ran  ( { <. y ,  x >.  |  ( x  e.  A  /\  y  =  B ) }  |`  C )  =  { x  e.  A  |  B  e.  C }
268, 25eqtri 2227 . 2  |-  ( {
<. y ,  x >.  |  ( x  e.  A  /\  y  =  B
) } " C
)  =  { x  e.  A  |  B  e.  C }
277, 26eqtri 2227 1  |-  ( `' F " C )  =  { x  e.  A  |  B  e.  C }
Colors of variables: wff set class
Syntax hints:    /\ wa 104    = wceq 1373   E.wex 1516    e. wcel 2177   {cab 2192   {crab 2489   {copab 4112    |-> cmpt 4113   `'ccnv 4682   ran crn 4684    |` cres 4685   "cima 4686
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2180  ax-ext 2188  ax-sep 4170  ax-pow 4226  ax-pr 4261
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ral 2490  df-rex 2491  df-rab 2494  df-v 2775  df-un 3174  df-in 3176  df-ss 3183  df-pw 3623  df-sn 3644  df-pr 3645  df-op 3647  df-br 4052  df-opab 4114  df-mpt 4115  df-xp 4689  df-rel 4690  df-cnv 4691  df-dm 4693  df-rn 4694  df-res 4695  df-ima 4696
This theorem is referenced by:  mptiniseg  5186  dmmpt  5187  fmpt  5743  f1oresrab  5758  suppssfv  6167  suppssov1  6168  infrenegsupex  9735  infxrnegsupex  11649  eqglact  13636  fczpsrbag  14508  txcnmpt  14820  txdis1cn  14825  imasnopn  14846
  Copyright terms: Public domain W3C validator