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

Theorem mptfvex 5647
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 3087 . . 3  |-  ( y  =  C  ->  [_ y  /  x ]_ B  = 
[_ C  /  x ]_ B )
2 fvmpt2.1 . . . 4  |-  F  =  ( x  e.  A  |->  B )
3 nfcv 2339 . . . . 5  |-  F/_ y B
4 nfcsb1v 3117 . . . . 5  |-  F/_ x [_ y  /  x ]_ B
5 csbeq1a 3093 . . . . 5  |-  ( x  =  y  ->  B  =  [_ y  /  x ]_ B )
63, 4, 5cbvmpt 4128 . . . 4  |-  ( x  e.  A  |->  B )  =  ( y  e.  A  |->  [_ y  /  x ]_ B )
72, 6eqtri 2217 . . 3  |-  F  =  ( y  e.  A  |-> 
[_ y  /  x ]_ B )
81, 7fvmptss2 5636 . 2  |-  ( F `
 C )  C_  [_ C  /  x ]_ B
9 elex 2774 . . . . . 6  |-  ( B  e.  V  ->  B  e.  _V )
109alimi 1469 . . . . 5  |-  ( A. x  B  e.  V  ->  A. x  B  e. 
_V )
113nfel1 2350 . . . . . 6  |-  F/ y  B  e.  _V
124nfel1 2350 . . . . . 6  |-  F/ x [_ y  /  x ]_ B  e.  _V
135eleq1d 2265 . . . . . 6  |-  ( x  =  y  ->  ( B  e.  _V  <->  [_ y  /  x ]_ B  e.  _V ) )
1411, 12, 13cbval 1768 . . . . 5  |-  ( A. x  B  e.  _V  <->  A. y [_ y  /  x ]_ B  e.  _V )
1510, 14sylib 122 . . . 4  |-  ( A. x  B  e.  V  ->  A. y [_ y  /  x ]_ B  e. 
_V )
161eleq1d 2265 . . . . 5  |-  ( y  =  C  ->  ( [_ y  /  x ]_ B  e.  _V  <->  [_ C  /  x ]_ B  e.  _V )
)
1716spcgv 2851 . . . 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 125 . 2  |-  ( ( A. x  B  e.  V  /\  C  e.  W )  ->  [_ C  /  x ]_ B  e. 
_V )
20 ssexg 4172 . 2  |-  ( ( ( F `  C
)  C_  [_ C  /  x ]_ B  /\  [_ C  /  x ]_ B  e. 
_V )  ->  ( F `  C )  e.  _V )
218, 19, 20sylancr 414 1  |-  ( ( A. x  B  e.  V  /\  C  e.  W )  ->  ( F `  C )  e.  _V )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104   A.wal 1362    = wceq 1364    e. wcel 2167   _Vcvv 2763   [_csb 3084    C_ wss 3157    |-> cmpt 4094   ` cfv 5258
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-sbc 2990  df-csb 3085  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-br 4034  df-opab 4095  df-mpt 4096  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-iota 5219  df-fun 5260  df-fv 5266
This theorem is referenced by:  mpofvex  6263  xpcomco  6885  lssex  13910  mopnset  14108  metuex  14111
  Copyright terms: Public domain W3C validator