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

Theorem mptfvex 5277
Description: Sufficient condition for a maps-to notation to be set-like. (Contributed by Mario Carneiro, 3-Jul-2019.)
Hypothesis
Ref Expression
fvmpt2.1  |-  F  =  ( x  e.  A  |->  B )
Assertion
Ref Expression
mptfvex  |-  ( ( A. x  B  e.  V  /\  C  e.  W )  ->  ( F `  C )  e.  _V )
Distinct variable groups:    x, A    x, C
Allowed substitution hints:    B( x)    F( x)    V( x)    W( x)

Proof of Theorem mptfvex
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 csbeq1 2911 . . 3  |-  ( y  =  C  ->  [_ y  /  x ]_ B  = 
[_ C  /  x ]_ B )
2 fvmpt2.1 . . . 4  |-  F  =  ( x  e.  A  |->  B )
3 nfcv 2219 . . . . 5  |-  F/_ y B
4 nfcsb1v 2938 . . . . 5  |-  F/_ x [_ y  /  x ]_ B
5 csbeq1a 2916 . . . . 5  |-  ( x  =  y  ->  B  =  [_ y  /  x ]_ B )
63, 4, 5cbvmpt 3872 . . . 4  |-  ( x  e.  A  |->  B )  =  ( y  e.  A  |->  [_ y  /  x ]_ B )
72, 6eqtri 2101 . . 3  |-  F  =  ( y  e.  A  |-> 
[_ y  /  x ]_ B )
81, 7fvmptss2 5268 . 2  |-  ( F `
 C )  C_  [_ C  /  x ]_ B
9 elex 2610 . . . . . 6  |-  ( B  e.  V  ->  B  e.  _V )
109alimi 1384 . . . . 5  |-  ( A. x  B  e.  V  ->  A. x  B  e. 
_V )
113nfel1 2229 . . . . . 6  |-  F/ y  B  e.  _V
124nfel1 2229 . . . . . 6  |-  F/ x [_ y  /  x ]_ B  e.  _V
135eleq1d 2147 . . . . . 6  |-  ( x  =  y  ->  ( B  e.  _V  <->  [_ y  /  x ]_ B  e.  _V ) )
1411, 12, 13cbval 1677 . . . . 5  |-  ( A. x  B  e.  _V  <->  A. y [_ y  /  x ]_ B  e.  _V )
1510, 14sylib 120 . . . 4  |-  ( A. x  B  e.  V  ->  A. y [_ y  /  x ]_ B  e. 
_V )
161eleq1d 2147 . . . . 5  |-  ( y  =  C  ->  ( [_ y  /  x ]_ B  e.  _V  <->  [_ C  /  x ]_ B  e.  _V )
)
1716spcgv 2685 . . . 4  |-  ( C  e.  W  ->  ( A. y [_ y  /  x ]_ B  e.  _V  ->  [_ C  /  x ]_ B  e.  _V ) )
1815, 17syl5 32 . . 3  |-  ( C  e.  W  ->  ( A. x  B  e.  V  ->  [_ C  /  x ]_ B  e.  _V ) )
1918impcom 123 . 2  |-  ( ( A. x  B  e.  V  /\  C  e.  W )  ->  [_ C  /  x ]_ B  e. 
_V )
20 ssexg 3917 . 2  |-  ( ( ( F `  C
)  C_  [_ C  /  x ]_ B  /\  [_ C  /  x ]_ B  e. 
_V )  ->  ( F `  C )  e.  _V )
218, 19, 20sylancr 405 1  |-  ( ( A. x  B  e.  V  /\  C  e.  W )  ->  ( F `  C )  e.  _V )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102   A.wal 1282    = wceq 1284    e. wcel 1433   _Vcvv 2601   [_csb 2908    C_ wss 2973    |-> cmpt 3839   ` cfv 4922
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-sbc 2816  df-csb 2909  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-br 3786  df-opab 3840  df-mpt 3841  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-iota 4887  df-fun 4924  df-fv 4930
This theorem is referenced by:  mpt2fvex  5849  xpcomco  6323
  Copyright terms: Public domain W3C validator