MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fvmptdv2 Unicode version

Theorem fvmptdv2 5757
Description: Alternate deduction version of fvmpt 5745, suitable for iteration. (Contributed by Mario Carneiro, 7-Jan-2017.)
Hypotheses
Ref Expression
fvmptdv2.1  |-  ( ph  ->  A  e.  D )
fvmptdv2.2  |-  ( (
ph  /\  x  =  A )  ->  B  e.  V )
fvmptdv2.3  |-  ( (
ph  /\  x  =  A )  ->  B  =  C )
Assertion
Ref Expression
fvmptdv2  |-  ( ph  ->  ( F  =  ( x  e.  D  |->  B )  ->  ( F `  A )  =  C ) )
Distinct variable groups:    x, A    x, C    x, D    ph, x
Allowed substitution hints:    B( x)    F( x)    V( x)

Proof of Theorem fvmptdv2
StepHypRef Expression
1 eqidd 2388 . . 3  |-  ( ph  ->  ( x  e.  D  |->  B )  =  ( x  e.  D  |->  B ) )
2 fvmptdv2.3 . . 3  |-  ( (
ph  /\  x  =  A )  ->  B  =  C )
3 fvmptdv2.1 . . 3  |-  ( ph  ->  A  e.  D )
4 elex 2907 . . . . . 6  |-  ( A  e.  D  ->  A  e.  _V )
53, 4syl 16 . . . . 5  |-  ( ph  ->  A  e.  _V )
6 isset 2903 . . . . 5  |-  ( A  e.  _V  <->  E. x  x  =  A )
75, 6sylib 189 . . . 4  |-  ( ph  ->  E. x  x  =  A )
8 fvmptdv2.2 . . . . . 6  |-  ( (
ph  /\  x  =  A )  ->  B  e.  V )
9 elex 2907 . . . . . 6  |-  ( B  e.  V  ->  B  e.  _V )
108, 9syl 16 . . . . 5  |-  ( (
ph  /\  x  =  A )  ->  B  e.  _V )
112, 10eqeltrrd 2462 . . . 4  |-  ( (
ph  /\  x  =  A )  ->  C  e.  _V )
127, 11exlimddv 1645 . . 3  |-  ( ph  ->  C  e.  _V )
131, 2, 3, 12fvmptd 5749 . 2  |-  ( ph  ->  ( ( x  e.  D  |->  B ) `  A )  =  C )
14 fveq1 5667 . . 3  |-  ( F  =  ( x  e.  D  |->  B )  -> 
( F `  A
)  =  ( ( x  e.  D  |->  B ) `  A ) )
1514eqeq1d 2395 . 2  |-  ( F  =  ( x  e.  D  |->  B )  -> 
( ( F `  A )  =  C  <-> 
( ( x  e.  D  |->  B ) `  A )  =  C ) )
1613, 15syl5ibrcom 214 1  |-  ( ph  ->  ( F  =  ( x  e.  D  |->  B )  ->  ( F `  A )  =  C ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 359   E.wex 1547    = wceq 1649    e. wcel 1717   _Vcvv 2899    e. cmpt 4207   ` cfv 5394
This theorem is referenced by:  curf12  14251  curf2  14253  yonedalem4b  14300
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-14 1721  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2368  ax-sep 4271  ax-nul 4279  ax-pr 4344
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2242  df-mo 2243  df-clab 2374  df-cleq 2380  df-clel 2383  df-nfc 2512  df-ne 2552  df-ral 2654  df-rex 2655  df-rab 2658  df-v 2901  df-sbc 3105  df-csb 3195  df-dif 3266  df-un 3268  df-in 3270  df-ss 3277  df-nul 3572  df-if 3683  df-sn 3763  df-pr 3764  df-op 3766  df-uni 3958  df-br 4154  df-opab 4208  df-mpt 4209  df-id 4439  df-xp 4824  df-rel 4825  df-cnv 4826  df-co 4827  df-dm 4828  df-iota 5358  df-fun 5396  df-fv 5402
  Copyright terms: Public domain W3C validator