Theorem fnresin2 6676

Description: Restriction of a function's domain with an intersection. (Contributed by NM, 9-Aug-1994.)

Assertion

Ref	Expression
fnresin2	⊢ (𝐹 Fn 𝐴 → (𝐹 ↾ (𝐵 ∩ 𝐴)) Fn (𝐵 ∩ 𝐴))

Proof of Theorem fnresin2

Step	Hyp	Ref	Expression
1		inss2 4229	. 2 ⊢ (𝐵 ∩ 𝐴) ⊆ 𝐴
2		fnssres 6673	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ (𝐵 ∩ 𝐴) ⊆ 𝐴) → (𝐹 ↾ (𝐵 ∩ 𝐴)) Fn (𝐵 ∩ 𝐴))
3	1, 2	mpan2 689	1 ⊢ (𝐹 Fn 𝐴 → (𝐹 ↾ (𝐵 ∩ 𝐴)) Fn (𝐵 ∩ 𝐴))

Syntax hints:   → wi 4   ∩ cin 3947   ⊆ wss 3948   ↾ cres 5678   Fn wfn 6538

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2703  ax-sep 5299  ax-nul 5306  ax-pr 5427

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-sb 2068  df-clab 2710  df-cleq 2724  df-clel 2810  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-sn 4629  df-pr 4631  df-op 4635  df-br 5149  df-opab 5211  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-res 5688  df-fun 6545  df-fn 6546

This theorem is referenced by:  resfnfinfin  9331  resfifsupp  9391  hashresfn  14299