Theorem fresin 6744

Description: An identity for the mapping relationship under restriction. (Contributed by Scott Fenton, 4-Sep-2011.) (Proof shortened by Mario Carneiro, 26-May-2016.)

Assertion

Ref	Expression
fresin	⊢ (𝐹:𝐴⟶𝐵 → (𝐹 ↾ 𝑋):(𝐴 ∩ 𝑋)⟶𝐵)

Proof of Theorem fresin

Step	Hyp	Ref	Expression
1		inss1 4182	. . 3 ⊢ (𝐴 ∩ 𝑋) ⊆ 𝐴
2		fssres 6741	. . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ (𝐴 ∩ 𝑋) ⊆ 𝐴) → (𝐹 ↾ (𝐴 ∩ 𝑋)):(𝐴 ∩ 𝑋)⟶𝐵)
3	1, 2	mpan2 704	. 2 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 ↾ (𝐴 ∩ 𝑋)):(𝐴 ∩ 𝑋)⟶𝐵)
4		resres 5985	. . . 4 ⊢ ((𝐹 ↾ 𝐴) ↾ 𝑋) = (𝐹 ↾ (𝐴 ∩ 𝑋))
5		ffn 6702	. . . . . 6 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴)
6		fnresdm 6651	. . . . . 6 ⊢ (𝐹 Fn 𝐴 → (𝐹 ↾ 𝐴) = 𝐹)
7	5, 6	syl 18	. . . . 5 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 ↾ 𝐴) = 𝐹)
8	7	reseq1d 5971	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → ((𝐹 ↾ 𝐴) ↾ 𝑋) = (𝐹 ↾ 𝑋))
9	4, 8	eqtr3id 2809	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 ↾ (𝐴 ∩ 𝑋)) = (𝐹 ↾ 𝑋))
10	9	feq1d 6684	. 2 ⊢ (𝐹:𝐴⟶𝐵 → ((𝐹 ↾ (𝐴 ∩ 𝑋)):(𝐴 ∩ 𝑋)⟶𝐵 ↔ (𝐹 ↾ 𝑋):(𝐴 ∩ 𝑋)⟶𝐵))
11	3, 10	mpbid 235	1 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 ↾ 𝑋):(𝐴 ∩ 𝑋)⟶𝐵)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∩ cin 3898   ⊆ wss 3899   ↾ cres 5657   Fn wfn 6528  ⟶wf 6529

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 2732  ax-sep 5251  ax-pr 5398

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 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  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 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-fun 6535  df-fn 6536  df-f 6537

This theorem is used by:  o1res  15647  limcresi  26112  dvreslem  26136  dvres2lem  26137  noreson  27896  mbfresfi  38415  ofoafg  44195  limcresiooub  46470  limcresioolb  46471  limcleqr  46472  limclner  46479  mbfres2cn  46786  fouriersw  47059  sge0less  47220  sge0ssre  47225  smfres  47618