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

Theorem fvmptssdm 5762
Description: If all the values of the mapping are subsets of a class  C, then so is any evaluation of the mapping at a value in the domain of the mapping. (Contributed by Jim Kingdon, 3-Jan-2018.)
Hypothesis
Ref Expression
fvmpt2.1  |-  F  =  ( x  e.  A  |->  B )
Assertion
Ref Expression
fvmptssdm  |-  ( ( D  e.  dom  F  /\  A. x  e.  A  B  C_  C )  -> 
( F `  D
)  C_  C )
Distinct variable groups:    x, A    x, C
Allowed substitution hints:    B( x)    D( x)    F( x)

Proof of Theorem fvmptssdm
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 fveq2 5670 . . . . . 6  |-  ( y  =  D  ->  ( F `  y )  =  ( F `  D ) )
21sseq1d 3267 . . . . 5  |-  ( y  =  D  ->  (
( F `  y
)  C_  C  <->  ( F `  D )  C_  C
) )
32imbi2d 230 . . . 4  |-  ( y  =  D  ->  (
( A. x  e.  A  B  C_  C  ->  ( F `  y
)  C_  C )  <->  ( A. x  e.  A  B  C_  C  ->  ( F `  D )  C_  C ) ) )
4 nfrab1 2724 . . . . . . 7  |-  F/_ x { x  e.  A  |  B  e.  _V }
54nfcri 2378 . . . . . 6  |-  F/ x  y  e.  { x  e.  A  |  B  e.  _V }
6 nfra1 2573 . . . . . . 7  |-  F/ x A. x  e.  A  B  C_  C
7 fvmpt2.1 . . . . . . . . . 10  |-  F  =  ( x  e.  A  |->  B )
8 nfmpt1 4203 . . . . . . . . . 10  |-  F/_ x
( x  e.  A  |->  B )
97, 8nfcxfr 2381 . . . . . . . . 9  |-  F/_ x F
10 nfcv 2384 . . . . . . . . 9  |-  F/_ x
y
119, 10nffv 5680 . . . . . . . 8  |-  F/_ x
( F `  y
)
12 nfcv 2384 . . . . . . . 8  |-  F/_ x C
1311, 12nfss 3231 . . . . . . 7  |-  F/ x
( F `  y
)  C_  C
146, 13nfim 1621 . . . . . 6  |-  F/ x
( A. x  e.  A  B  C_  C  ->  ( F `  y
)  C_  C )
155, 14nfim 1621 . . . . 5  |-  F/ x
( y  e.  {
x  e.  A  |  B  e.  _V }  ->  ( A. x  e.  A  B  C_  C  ->  ( F `  y )  C_  C ) )
16 eleq1 2295 . . . . . 6  |-  ( x  =  y  ->  (
x  e.  { x  e.  A  |  B  e.  _V }  <->  y  e.  { x  e.  A  |  B  e.  _V } ) )
17 fveq2 5670 . . . . . . . 8  |-  ( x  =  y  ->  ( F `  x )  =  ( F `  y ) )
1817sseq1d 3267 . . . . . . 7  |-  ( x  =  y  ->  (
( F `  x
)  C_  C  <->  ( F `  y )  C_  C
) )
1918imbi2d 230 . . . . . 6  |-  ( x  =  y  ->  (
( A. x  e.  A  B  C_  C  ->  ( F `  x
)  C_  C )  <->  ( A. x  e.  A  B  C_  C  ->  ( F `  y )  C_  C ) ) )
2016, 19imbi12d 234 . . . . 5  |-  ( x  =  y  ->  (
( x  e.  {
x  e.  A  |  B  e.  _V }  ->  ( A. x  e.  A  B  C_  C  ->  ( F `  x )  C_  C ) )  <->  ( y  e.  { x  e.  A  |  B  e.  _V }  ->  ( A. x  e.  A  B  C_  C  ->  ( F `  y
)  C_  C )
) ) )
217dmmpt 5258 . . . . . . 7  |-  dom  F  =  { x  e.  A  |  B  e.  _V }
2221eleq2i 2299 . . . . . 6  |-  ( x  e.  dom  F  <->  x  e.  { x  e.  A  |  B  e.  _V } )
2321rabeq2i 2810 . . . . . . . . . 10  |-  ( x  e.  dom  F  <->  ( x  e.  A  /\  B  e. 
_V ) )
247fvmpt2 5761 . . . . . . . . . . 11  |-  ( ( x  e.  A  /\  B  e.  _V )  ->  ( F `  x
)  =  B )
25 eqimss 3292 . . . . . . . . . . 11  |-  ( ( F `  x )  =  B  ->  ( F `  x )  C_  B )
2624, 25syl 14 . . . . . . . . . 10  |-  ( ( x  e.  A  /\  B  e.  _V )  ->  ( F `  x
)  C_  B )
2723, 26sylbi 121 . . . . . . . . 9  |-  ( x  e.  dom  F  -> 
( F `  x
)  C_  B )
2827adantr 276 . . . . . . . 8  |-  ( ( x  e.  dom  F  /\  A. x  e.  A  B  C_  C )  -> 
( F `  x
)  C_  B )
297dmmptss 5259 . . . . . . . . . 10  |-  dom  F  C_  A
3029sseli 3234 . . . . . . . . 9  |-  ( x  e.  dom  F  ->  x  e.  A )
31 rsp 2589 . . . . . . . . 9  |-  ( A. x  e.  A  B  C_  C  ->  ( x  e.  A  ->  B  C_  C ) )
3230, 31mpan9 281 . . . . . . . 8  |-  ( ( x  e.  dom  F  /\  A. x  e.  A  B  C_  C )  ->  B  C_  C )
3328, 32sstrd 3248 . . . . . . 7  |-  ( ( x  e.  dom  F  /\  A. x  e.  A  B  C_  C )  -> 
( F `  x
)  C_  C )
3433ex 115 . . . . . 6  |-  ( x  e.  dom  F  -> 
( A. x  e.  A  B  C_  C  ->  ( F `  x
)  C_  C )
)
3522, 34sylbir 135 . . . . 5  |-  ( x  e.  { x  e.  A  |  B  e. 
_V }  ->  ( A. x  e.  A  B  C_  C  ->  ( F `  x )  C_  C ) )
3615, 20, 35chvar 1806 . . . 4  |-  ( y  e.  { x  e.  A  |  B  e. 
_V }  ->  ( A. x  e.  A  B  C_  C  ->  ( F `  y )  C_  C ) )
373, 36vtoclga 2881 . . 3  |-  ( D  e.  { x  e.  A  |  B  e. 
_V }  ->  ( A. x  e.  A  B  C_  C  ->  ( F `  D )  C_  C ) )
3837, 21eleq2s 2327 . 2  |-  ( D  e.  dom  F  -> 
( A. x  e.  A  B  C_  C  ->  ( F `  D
)  C_  C )
)
3938imp 124 1  |-  ( ( D  e.  dom  F  /\  A. x  e.  A  B  C_  C )  -> 
( F `  D
)  C_  C )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398    e. wcel 2203   A.wral 2520   {crab 2524   _Vcvv 2813    C_ wss 3211    |-> cmpt 4171   dom cdm 4749   ` cfv 5352
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fv 5360
This theorem is referenced by:  relmptopab  6256
  Copyright terms: Public domain W3C validator