Theorem fnresin2 6663

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

This proof depends on syntax axioms:   → wi 4   ∩ cin 3898   ⊆ wss 3899   ↾ cres 5653   Fn wfn 6532

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-res 5663  df-fun 6539  df-fn 6540

This theorem is used by:  resfnfinfin  9319  resfifsupp  9382  hashresfn  14477