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

Theorem fvmptssdm 5687
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 5599 . . . . . 6  |-  ( y  =  D  ->  ( F `  y )  =  ( F `  D ) )
21sseq1d 3230 . . . . 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 2688 . . . . . . 7  |-  F/_ x { x  e.  A  |  B  e.  _V }
54nfcri 2344 . . . . . 6  |-  F/ x  y  e.  { x  e.  A  |  B  e.  _V }
6 nfra1 2539 . . . . . . 7  |-  F/ x A. x  e.  A  B  C_  C
7 fvmpt2.1 . . . . . . . . . 10  |-  F  =  ( x  e.  A  |->  B )
8 nfmpt1 4153 . . . . . . . . . 10  |-  F/_ x
( x  e.  A  |->  B )
97, 8nfcxfr 2347 . . . . . . . . 9  |-  F/_ x F
10 nfcv 2350 . . . . . . . . 9  |-  F/_ x
y
119, 10nffv 5609 . . . . . . . 8  |-  F/_ x
( F `  y
)
12 nfcv 2350 . . . . . . . 8  |-  F/_ x C
1311, 12nfss 3194 . . . . . . 7  |-  F/ x
( F `  y
)  C_  C
146, 13nfim 1596 . . . . . 6  |-  F/ x
( A. x  e.  A  B  C_  C  ->  ( F `  y
)  C_  C )
155, 14nfim 1596 . . . . 5  |-  F/ x
( y  e.  {
x  e.  A  |  B  e.  _V }  ->  ( A. x  e.  A  B  C_  C  ->  ( F `  y )  C_  C ) )
16 eleq1 2270 . . . . . 6  |-  ( x  =  y  ->  (
x  e.  { x  e.  A  |  B  e.  _V }  <->  y  e.  { x  e.  A  |  B  e.  _V } ) )
17 fveq2 5599 . . . . . . . 8  |-  ( x  =  y  ->  ( F `  x )  =  ( F `  y ) )
1817sseq1d 3230 . . . . . . 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 5197 . . . . . . 7  |-  dom  F  =  { x  e.  A  |  B  e.  _V }
2221eleq2i 2274 . . . . . 6  |-  ( x  e.  dom  F  <->  x  e.  { x  e.  A  |  B  e.  _V } )
2321rabeq2i 2773 . . . . . . . . . 10  |-  ( x  e.  dom  F  <->  ( x  e.  A  /\  B  e. 
_V ) )
247fvmpt2 5686 . . . . . . . . . . 11  |-  ( ( x  e.  A  /\  B  e.  _V )  ->  ( F `  x
)  =  B )
25 eqimss 3255 . . . . . . . . . . 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 5198 . . . . . . . . . 10  |-  dom  F  C_  A
3029sseli 3197 . . . . . . . . 9  |-  ( x  e.  dom  F  ->  x  e.  A )
31 rsp 2555 . . . . . . . . 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 3211 . . . . . . 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 1781 . . . 4  |-  ( y  e.  { x  e.  A  |  B  e. 
_V }  ->  ( A. x  e.  A  B  C_  C  ->  ( F `  y )  C_  C ) )
373, 36vtoclga 2844 . . 3  |-  ( D  e.  { x  e.  A  |  B  e. 
_V }  ->  ( A. x  e.  A  B  C_  C  ->  ( F `  D )  C_  C ) )
3837, 21eleq2s 2302 . 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 1373    e. wcel 2178   A.wral 2486   {crab 2490   _Vcvv 2776    C_ wss 3174    |-> cmpt 4121   dom cdm 4693   ` cfv 5290
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 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269
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 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-rex 2492  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-br 4060  df-opab 4122  df-mpt 4123  df-id 4358  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fv 5298
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator