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

Theorem feqmptd 5370
Description: Deduction form of dffn5im 5363. (Contributed by Mario Carneiro, 8-Jan-2015.)
Hypothesis
Ref Expression
feqmptd.1  |-  ( ph  ->  F : A --> B )
Assertion
Ref Expression
feqmptd  |-  ( ph  ->  F  =  ( x  e.  A  |->  ( F `
 x ) ) )
Distinct variable groups:    x, A    x, F
Allowed substitution hints:    ph( x)    B( x)

Proof of Theorem feqmptd
StepHypRef Expression
1 feqmptd.1 . . 3  |-  ( ph  ->  F : A --> B )
2 ffn 5174 . . 3  |-  ( F : A --> B  ->  F  Fn  A )
31, 2syl 14 . 2  |-  ( ph  ->  F  Fn  A )
4 dffn5im 5363 . 2  |-  ( F  Fn  A  ->  F  =  ( x  e.  A  |->  ( F `  x ) ) )
53, 4syl 14 1  |-  ( ph  ->  F  =  ( x  e.  A  |->  ( F `
 x ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1290    |-> cmpt 3905    Fn wfn 5023   -->wf 5024   ` cfv 5028
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 666  ax-5 1382  ax-7 1383  ax-gen 1384  ax-ie1 1428  ax-ie2 1429  ax-8 1441  ax-10 1442  ax-11 1443  ax-i12 1444  ax-bndl 1445  ax-4 1446  ax-14 1451  ax-17 1465  ax-i9 1469  ax-ial 1473  ax-i5r 1474  ax-ext 2071  ax-sep 3963  ax-pow 4015  ax-pr 4045
This theorem depends on definitions:  df-bi 116  df-3an 927  df-tru 1293  df-nf 1396  df-sb 1694  df-eu 1952  df-mo 1953  df-clab 2076  df-cleq 2082  df-clel 2085  df-nfc 2218  df-ral 2365  df-rex 2366  df-v 2622  df-sbc 2842  df-un 3004  df-in 3006  df-ss 3013  df-pw 3435  df-sn 3456  df-pr 3457  df-op 3459  df-uni 3660  df-br 3852  df-opab 3906  df-mpt 3907  df-id 4129  df-xp 4458  df-rel 4459  df-cnv 4460  df-co 4461  df-dm 4462  df-iota 4993  df-fun 5030  df-fn 5031  df-f 5032  df-fv 5036
This theorem is referenced by:  feqresmpt  5371  fcoconst  5482  suppssof1  5886  ofco  5887  caofinvl  5891  caofcom  5892  mapxpen  6618  xpmapenlem  6619  cnrecnv  10405
  Copyright terms: Public domain W3C validator