Theorem funres 5392

Description: A restriction of a function is a function. Compare Exercise 18 of [TakeutiZaring] p. 25. (Contributed by NM, 16-Aug-1994.)

Assertion

Ref	Expression
funres	⊢ (Fun 𝐹 → Fun (𝐹 ↾ 𝐴))

Proof of Theorem funres

Step	Hyp	Ref	Expression
1		resss 5061	. 2 ⊢ (𝐹 ↾ 𝐴) ⊆ 𝐹
2		funss 5370	. 2 ⊢ ((𝐹 ↾ 𝐴) ⊆ 𝐹 → (Fun 𝐹 → Fun (𝐹 ↾ 𝐴)))
3	1, 2	ax-mp 5	1 ⊢ (Fun 𝐹 → Fun (𝐹 ↾ 𝐴))

Syntax hints:   → wi 4   ⊆ wss 3210   ↾ cres 4750  Fun wfun 5345

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-ext 2214

This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-v 2814  df-in 3216  df-ss 3223  df-br 4109  df-opab 4171  df-rel 4755  df-cnv 4756  df-co 4757  df-res 4760  df-fun 5353

This theorem is referenced by:  funresd  5393  fnssresb  5469  fnresi  5475  fores  5599  respreima  5804  resfunexg  5904  funfvima  5917  smores  6522  smores2  6524  frecfun  6625  residfi  7206  sbthlem7  7232  setsfun  13239  setsfun0  13240  uhgrspansubgrlem  16263