Theorem funres 5320

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

Syntax hints:   → wi 4   ⊆ wss 3170   ↾ cres 4684  Fun wfun 5273

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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2188

This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-v 2775  df-in 3176  df-ss 3183  df-br 4051  df-opab 4113  df-rel 4689  df-cnv 4690  df-co 4691  df-res 4694  df-fun 5281

This theorem is referenced by:  fnssresb  5396  fnresi  5402  fores  5519  respreima  5720  resfunexg  5817  funfvima  5828  smores  6390  smores2  6392  frecfun  6493  residfi  7056  sbthlem7  7079  setsfun  12937  setsfun0  12938