Theorem fresin 6752

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 4133	. . 3 ⊢ (𝐴 ∩ 𝑋) ⊆ 𝐴
2		fssres 6749	. . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ (𝐴 ∩ 𝑋) ⊆ 𝐴) → (𝐹 ↾ (𝐴 ∩ 𝑋)):(𝐴 ∩ 𝑋)⟶𝐵)
3	1, 2	mpan2 704	. 2 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 ↾ (𝐴 ∩ 𝑋)):(𝐴 ∩ 𝑋)⟶𝐵)
4		resres 5982	. . . 4 ⊢ ((𝐹 ↾ 𝐴) ↾ 𝑋) = (𝐹 ↾ (𝐴 ∩ 𝑋))
5		ffn 6710	. . . . . 6 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴)
6		fnresdm 6659	. . . . . 6 ⊢ (𝐹 Fn 𝐴 → (𝐹 ↾ 𝐴) = 𝐹)
7	5, 6	syl 18	. . . . 5 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 ↾ 𝐴) = 𝐹)
8	7	reseq1d 5968	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → ((𝐹 ↾ 𝐴) ↾ 𝑋) = (𝐹 ↾ 𝑋))
9	4, 8	eqtr3id 2809	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 ↾ (𝐴 ∩ 𝑋)) = (𝐹 ↾ 𝑋))
10	9	feq1d 6692	. 2 ⊢ (𝐹:𝐴⟶𝐵 → ((𝐹 ↾ (𝐴 ∩ 𝑋)):(𝐴 ∩ 𝑋)⟶𝐵 ↔ (𝐹 ↾ 𝑋):(𝐴 ∩ 𝑋)⟶𝐵))
11	3, 10	mpbid 235	1 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 ↾ 𝑋):(𝐴 ∩ 𝑋)⟶𝐵)

This proof depends on syntax axioms:   → wi 4   = wceq 1569   ⊆ wss 3895   ∩ cin 4089   ↾ cres 5652   Fn wfn 6534  ⟶wf 6535

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-fun 6541  df-fn 6542  df-f 6543

This theorem is used by:  o1res  15733  limcresi  26211  dvreslem  26235  dvres2lem  26236  noreson  28023  mbfresfi  38678  ofoafg  44450  limcresiooub  46746  limcresioolb  46747  limcleqr  46748  limclner  46755  mbfres2cn  47062  fouriersw  47335  sge0less  47496  sge0ssre  47501  smfres  47894