Theorem fnresin2 6670

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 4224	. 2 ⊢ (𝐵 ∩ 𝐴) ⊆ 𝐴
2		fnssres 6667	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ (𝐵 ∩ 𝐴) ⊆ 𝐴) → (𝐹 ↾ (𝐵 ∩ 𝐴)) Fn (𝐵 ∩ 𝐴))
3	1, 2	mpan2 688	1 ⊢ (𝐹 Fn 𝐴 → (𝐹 ↾ (𝐵 ∩ 𝐴)) Fn (𝐵 ∩ 𝐴))

Syntax hints:   → wi 4   ∩ cin 3942   ⊆ wss 3943   ↾ cres 5671   Fn wfn 6532

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-ext 2697  ax-sep 5292  ax-nul 5299  ax-pr 5420

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-sb 2060  df-clab 2704  df-cleq 2718  df-clel 2804  df-ral 3056  df-rex 3065  df-rab 3427  df-v 3470  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-nul 4318  df-if 4524  df-sn 4624  df-pr 4626  df-op 4630  df-br 5142  df-opab 5204  df-xp 5675  df-rel 5676  df-cnv 5677  df-co 5678  df-dm 5679  df-res 5681  df-fun 6539  df-fn 6540

This theorem is referenced by:  resfnfinfin  9334  resfifsupp  9394  hashresfn  14305