Theorem fresin 6749

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 6746	. . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ (𝐴 ∩ 𝑋) ⊆ 𝐴) → (𝐹 ↾ (𝐴 ∩ 𝑋)):(𝐴 ∩ 𝑋)⟶𝐵)
3	1, 2	mpan2 704	. 2 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 ↾ (𝐴 ∩ 𝑋)):(𝐴 ∩ 𝑋)⟶𝐵)
4		resres 5983	. . . 4 ⊢ ((𝐹 ↾ 𝐴) ↾ 𝑋) = (𝐹 ↾ (𝐴 ∩ 𝑋))
5		ffn 6707	. . . . . 6 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴)
6		fnresdm 6656	. . . . . 6 ⊢ (𝐹 Fn 𝐴 → (𝐹 ↾ 𝐴) = 𝐹)
7	5, 6	syl 18	. . . . 5 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 ↾ 𝐴) = 𝐹)
8	7	reseq1d 5969	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → ((𝐹 ↾ 𝐴) ↾ 𝑋) = (𝐹 ↾ 𝑋))
9	4, 8	eqtr3id 2810	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 ↾ (𝐴 ∩ 𝑋)) = (𝐹 ↾ 𝑋))
10	9	feq1d 6689	. 2 ⊢ (𝐹:𝐴⟶𝐵 → ((𝐹 ↾ (𝐴 ∩ 𝑋)):(𝐴 ∩ 𝑋)⟶𝐵 ↔ (𝐹 ↾ 𝑋):(𝐴 ∩ 𝑋)⟶𝐵))
11	3, 10	mpbid 235	1 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 ↾ 𝑋):(𝐴 ∩ 𝑋)⟶𝐵)

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

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-rn 5662  df-res 5663  df-fun 6539  df-fn 6540  df-f 6541

This theorem is used by:  o1res  15720  limcresi  26198  dvreslem  26222  dvres2lem  26223  noreson  28010  mbfresfi  38564  ofoafg  44340  limcresiooub  46621  limcresioolb  46622  limcleqr  46623  limclner  46630  mbfres2cn  46937  fouriersw  47210  sge0less  47371  sge0ssre  47376  smfres  47769