Theorem funres 5398

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 5067	. 2 ⊢ (𝐹 ↾ 𝐴) ⊆ 𝐹
2		funss 5376	. 2 ⊢ ((𝐹 ↾ 𝐴) ⊆ 𝐹 → (Fun 𝐹 → Fun (𝐹 ↾ 𝐴)))
3	1, 2	ax-mp 5	1 ⊢ (Fun 𝐹 → Fun (𝐹 ↾ 𝐴))

Syntax hints:   → wi 4   ⊆ wss 3214   ↾ cres 4756  Fun wfun 5351

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 2216

This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-v 2817  df-in 3220  df-ss 3227  df-br 4115  df-opab 4177  df-rel 4761  df-cnv 4762  df-co 4763  df-res 4766  df-fun 5359

This theorem is referenced by:  funresd  5399  fnssresb  5475  fnresi  5481  fores  5605  respreima  5810  resfunexg  5910  funfvima  5923  smores  6536  smores2  6538  frecfun  6639  residfi  7220  sbthlem7  7246  setsfun  13331  setsfun0  13332  uhgrspansubgrlem  16383