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

Theorem fvmptssdm 5505
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 5421 . . . . . 6  |-  ( y  =  D  ->  ( F `  y )  =  ( F `  D ) )
21sseq1d 3126 . . . . 5  |-  ( y  =  D  ->  (
( F `  y
)  C_  C  <->  ( F `  D )  C_  C
) )
32imbi2d 229 . . . 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 2610 . . . . . . 7  |-  F/_ x { x  e.  A  |  B  e.  _V }
54nfcri 2275 . . . . . 6  |-  F/ x  y  e.  { x  e.  A  |  B  e.  _V }
6 nfra1 2466 . . . . . . 7  |-  F/ x A. x  e.  A  B  C_  C
7 fvmpt2.1 . . . . . . . . . 10  |-  F  =  ( x  e.  A  |->  B )
8 nfmpt1 4021 . . . . . . . . . 10  |-  F/_ x
( x  e.  A  |->  B )
97, 8nfcxfr 2278 . . . . . . . . 9  |-  F/_ x F
10 nfcv 2281 . . . . . . . . 9  |-  F/_ x
y
119, 10nffv 5431 . . . . . . . 8  |-  F/_ x
( F `  y
)
12 nfcv 2281 . . . . . . . 8  |-  F/_ x C
1311, 12nfss 3090 . . . . . . 7  |-  F/ x
( F `  y
)  C_  C
146, 13nfim 1551 . . . . . 6  |-  F/ x
( A. x  e.  A  B  C_  C  ->  ( F `  y
)  C_  C )
155, 14nfim 1551 . . . . 5  |-  F/ x
( y  e.  {
x  e.  A  |  B  e.  _V }  ->  ( A. x  e.  A  B  C_  C  ->  ( F `  y )  C_  C ) )
16 eleq1 2202 . . . . . 6  |-  ( x  =  y  ->  (
x  e.  { x  e.  A  |  B  e.  _V }  <->  y  e.  { x  e.  A  |  B  e.  _V } ) )
17 fveq2 5421 . . . . . . . 8  |-  ( x  =  y  ->  ( F `  x )  =  ( F `  y ) )
1817sseq1d 3126 . . . . . . 7  |-  ( x  =  y  ->  (
( F `  x
)  C_  C  <->  ( F `  y )  C_  C
) )
1918imbi2d 229 . . . . . 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 233 . . . . 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 5034 . . . . . . 7  |-  dom  F  =  { x  e.  A  |  B  e.  _V }
2221eleq2i 2206 . . . . . 6  |-  ( x  e.  dom  F  <->  x  e.  { x  e.  A  |  B  e.  _V } )
2321rabeq2i 2683 . . . . . . . . . 10  |-  ( x  e.  dom  F  <->  ( x  e.  A  /\  B  e. 
_V ) )
247fvmpt2 5504 . . . . . . . . . . 11  |-  ( ( x  e.  A  /\  B  e.  _V )  ->  ( F `  x
)  =  B )
25 eqimss 3151 . . . . . . . . . . 11  |-  ( ( F `  x )  =  B  ->  ( F `  x )  C_  B )
2624, 25syl 14 . . . . . . . . . 10  |-  ( ( x  e.  A  /\  B  e.  _V )  ->  ( F `  x
)  C_  B )
2723, 26sylbi 120 . . . . . . . . 9  |-  ( x  e.  dom  F  -> 
( F `  x
)  C_  B )
2827adantr 274 . . . . . . . 8  |-  ( ( x  e.  dom  F  /\  A. x  e.  A  B  C_  C )  -> 
( F `  x
)  C_  B )
297dmmptss 5035 . . . . . . . . . 10  |-  dom  F  C_  A
3029sseli 3093 . . . . . . . . 9  |-  ( x  e.  dom  F  ->  x  e.  A )
31 rsp 2480 . . . . . . . . 9  |-  ( A. x  e.  A  B  C_  C  ->  ( x  e.  A  ->  B  C_  C ) )
3230, 31mpan9 279 . . . . . . . 8  |-  ( ( x  e.  dom  F  /\  A. x  e.  A  B  C_  C )  ->  B  C_  C )
3328, 32sstrd 3107 . . . . . . 7  |-  ( ( x  e.  dom  F  /\  A. x  e.  A  B  C_  C )  -> 
( F `  x
)  C_  C )
3433ex 114 . . . . . 6  |-  ( x  e.  dom  F  -> 
( A. x  e.  A  B  C_  C  ->  ( F `  x
)  C_  C )
)
3522, 34sylbir 134 . . . . 5  |-  ( x  e.  { x  e.  A  |  B  e. 
_V }  ->  ( A. x  e.  A  B  C_  C  ->  ( F `  x )  C_  C ) )
3615, 20, 35chvar 1730 . . . 4  |-  ( y  e.  { x  e.  A  |  B  e. 
_V }  ->  ( A. x  e.  A  B  C_  C  ->  ( F `  y )  C_  C ) )
373, 36vtoclga 2752 . . 3  |-  ( D  e.  { x  e.  A  |  B  e. 
_V }  ->  ( A. x  e.  A  B  C_  C  ->  ( F `  D )  C_  C ) )
3837, 21eleq2s 2234 . 2  |-  ( D  e.  dom  F  -> 
( A. x  e.  A  B  C_  C  ->  ( F `  D
)  C_  C )
)
3938imp 123 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 103    = wceq 1331    e. wcel 1480   A.wral 2416   {crab 2420   _Vcvv 2686    C_ wss 3071    |-> cmpt 3989   dom cdm 4539   ` cfv 5123
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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-mpt 3991  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fv 5131
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator