Theorem fresin 6781

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 4136	. . 3 ⊢ (𝐴 ∩ 𝑋) ⊆ 𝐴
2		fssres 6778	. . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ (𝐴 ∩ 𝑋) ⊆ 𝐴) → (𝐹 ↾ (𝐴 ∩ 𝑋)):(𝐴 ∩ 𝑋)⟶𝐵)
3	1, 2	mpan2 704	. 2 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 ↾ (𝐴 ∩ 𝑋)):(𝐴 ∩ 𝑋)⟶𝐵)
4		resres 5999	. . . 4 ⊢ ((𝐹 ↾ 𝐴) ↾ 𝑋) = (𝐹 ↾ (𝐴 ∩ 𝑋))
5		ffn 6739	. . . . . 6 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴)
6		fnresdm 6688	. . . . . 6 ⊢ (𝐹 Fn 𝐴 → (𝐹 ↾ 𝐴) = 𝐹)
7	5, 6	syl 18	. . . . 5 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 ↾ 𝐴) = 𝐹)
8	7	reseq1d 5985	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → ((𝐹 ↾ 𝐴) ↾ 𝑋) = (𝐹 ↾ 𝑋))
9	4, 8	eqtr3id 2812	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 ↾ (𝐴 ∩ 𝑋)) = (𝐹 ↾ 𝑋))
10	9	feq1d 6721	. 2 ⊢ (𝐹:𝐴⟶𝐵 → ((𝐹 ↾ (𝐴 ∩ 𝑋)):(𝐴 ∩ 𝑋)⟶𝐵 ↔ (𝐹 ↾ 𝑋):(𝐴 ∩ 𝑋)⟶𝐵))
11	3, 10	mpbid 235	1 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 ↾ 𝑋):(𝐴 ∩ 𝑋)⟶𝐵)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ⊆ wss 3900   ∩ cin 4092   ↾ cres 5660   Fn wfn 6561  ⟶wf 6562

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5255  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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-fun 6568  df-fn 6569  df-f 6570

This theorem is used by:  o1res  15771  limcresi  26260  dvreslem  26284  dvres2lem  26285  noreson  28074  mbfresfi  38852  ofoafg  44617  limcresiooub  46925  limcresioolb  46926  limcleqr  46927  limclner  46934  mbfres2cn  47241  fouriersw  47514  sge0less  47675  sge0ssre  47680  smfres  48073