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

Theorem mptfvex 5643
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 3083 . . 3  |-  ( y  =  C  ->  [_ y  /  x ]_ B  = 
[_ C  /  x ]_ B )
2 fvmpt2.1 . . . 4  |-  F  =  ( x  e.  A  |->  B )
3 nfcv 2336 . . . . 5  |-  F/_ y B
4 nfcsb1v 3113 . . . . 5  |-  F/_ x [_ y  /  x ]_ B
5 csbeq1a 3089 . . . . 5  |-  ( x  =  y  ->  B  =  [_ y  /  x ]_ B )
63, 4, 5cbvmpt 4124 . . . 4  |-  ( x  e.  A  |->  B )  =  ( y  e.  A  |->  [_ y  /  x ]_ B )
72, 6eqtri 2214 . . 3  |-  F  =  ( y  e.  A  |-> 
[_ y  /  x ]_ B )
81, 7fvmptss2 5632 . 2  |-  ( F `
 C )  C_  [_ C  /  x ]_ B
9 elex 2771 . . . . . 6  |-  ( B  e.  V  ->  B  e.  _V )
109alimi 1466 . . . . 5  |-  ( A. x  B  e.  V  ->  A. x  B  e. 
_V )
113nfel1 2347 . . . . . 6  |-  F/ y  B  e.  _V
124nfel1 2347 . . . . . 6  |-  F/ x [_ y  /  x ]_ B  e.  _V
135eleq1d 2262 . . . . . 6  |-  ( x  =  y  ->  ( B  e.  _V  <->  [_ y  /  x ]_ B  e.  _V ) )
1411, 12, 13cbval 1765 . . . . 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 2262 . . . . 5  |-  ( y  =  C  ->  ( [_ y  /  x ]_ B  e.  _V  <->  [_ C  /  x ]_ B  e.  _V )
)
1716spcgv 2847 . . . 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 4168 . 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 2164   _Vcvv 2760   [_csb 3080    C_ wss 3153    |-> cmpt 4090   ` cfv 5254
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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-v 2762  df-sbc 2986  df-csb 3081  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-iota 5215  df-fun 5256  df-fv 5262
This theorem is referenced by:  mpofvex  6256  xpcomco  6880  lssex  13850
  Copyright terms: Public domain W3C validator