Theorem fresin 5568

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 3451	. . 3 ⊢ (𝐴 ∩ 𝑋) ⊆ 𝐴
2		fssres 5565	. . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ (𝐴 ∩ 𝑋) ⊆ 𝐴) → (𝐹 ↾ (𝐴 ∩ 𝑋)):(𝐴 ∩ 𝑋)⟶𝐵)
3	1, 2	mpan2 429	. 2 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 ↾ (𝐴 ∩ 𝑋)):(𝐴 ∩ 𝑋)⟶𝐵)
4		resres 5075	. . . 4 ⊢ ((𝐹 ↾ 𝐴) ↾ 𝑋) = (𝐹 ↾ (𝐴 ∩ 𝑋))
5		ffn 5533	. . . . . 6 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴)
6		fnresdm 5492	. . . . . 6 ⊢ (𝐹 Fn 𝐴 → (𝐹 ↾ 𝐴) = 𝐹)
7	5, 6	syl 14	. . . . 5 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 ↾ 𝐴) = 𝐹)
8	7	reseq1d 5062	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → ((𝐹 ↾ 𝐴) ↾ 𝑋) = (𝐹 ↾ 𝑋))
9	4, 8	eqtr3id 2285	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 ↾ (𝐴 ∩ 𝑋)) = (𝐹 ↾ 𝑋))
10	9	feq1d 5520	. 2 ⊢ (𝐹:𝐴⟶𝐵 → ((𝐹 ↾ (𝐴 ∩ 𝑋)):(𝐴 ∩ 𝑋)⟶𝐵 ↔ (𝐹 ↾ 𝑋):(𝐴 ∩ 𝑋)⟶𝐵))
11	3, 10	mpbid 147	1 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 ↾ 𝑋):(𝐴 ∩ 𝑋)⟶𝐵)

This proof depends on syntax axioms:   → wi 4   = wceq 1402   ∩ cin 3219   ⊆ wss 3220   ↾ cres 4776   Fn wfn 5372  ⟶wf 5373

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131  df-opab 4193  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-fun 5379  df-fn 5380  df-f 5381

This theorem is used by:  limcresi  15767