Theorem funmptd 16504

Description: The maps-to notation defines a function (deduction form).

Note: one should similarly prove a deduction form of funopab4 5370, then prove funmptd 16504 from it, and then prove funmpt 5371 from that: this would reduce global proof length. (Contributed by BJ, 5-Aug-2024.)

Hypothesis

Ref	Expression
funmptd.def	|- ( ph -> F = ( x e. A |-> B ) )

Assertion

Ref	Expression
funmptd	|- ( ph -> Fun F )

Proof of Theorem funmptd

Step	Hyp	Ref	Expression
1		funmpt 5371	. 2 |- Fun ( x e. A |-> B )
2		funmptd.def	. . 3 |- ( ph -> F = ( x e. A |-> B ) )
3	2	funeqd 5355	. 2 |- ( ph -> ( Fun F <-> Fun ( x e. A |-> B ) ) )
4	1, 3	mpbiri 168	1 |- ( ph -> Fun F )

Syntax hints:   -> wi 4   = wceq 1398   |-> cmpt 4155   Fun wfun 5327

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-fun 5335

This theorem is referenced by: (None)