Theorem fnresin 32557

Description: Restriction of a function with a subclass of its domain. (Contributed by Thierry Arnoux, 10-Oct-2017.)

Assertion

Ref	Expression
fnresin	⊢ (𝐹 Fn 𝐴 → (𝐹 ↾ 𝐵) Fn (𝐴 ∩ 𝐵))

Proof of Theorem fnresin

Step	Hyp	Ref	Expression
1		fnresin1 6646	. 2 ⊢ (𝐹 Fn 𝐴 → (𝐹 ↾ (𝐴 ∩ 𝐵)) Fn (𝐴 ∩ 𝐵))
2		resindi 5969	. . . 4 ⊢ (𝐹 ↾ (𝐴 ∩ 𝐵)) = ((𝐹 ↾ 𝐴) ∩ (𝐹 ↾ 𝐵))
3		fnresdm 6640	. . . . . 6 ⊢ (𝐹 Fn 𝐴 → (𝐹 ↾ 𝐴) = 𝐹)
4	3	ineq1d 4185	. . . . 5 ⊢ (𝐹 Fn 𝐴 → ((𝐹 ↾ 𝐴) ∩ (𝐹 ↾ 𝐵)) = (𝐹 ∩ (𝐹 ↾ 𝐵)))
5		incom 4175	. . . . . 6 ⊢ ((𝐹 ↾ 𝐵) ∩ 𝐹) = (𝐹 ∩ (𝐹 ↾ 𝐵))
6		resss 5975	. . . . . . 7 ⊢ (𝐹 ↾ 𝐵) ⊆ 𝐹
7		dfss2 3935	. . . . . . 7 ⊢ ((𝐹 ↾ 𝐵) ⊆ 𝐹 ↔ ((𝐹 ↾ 𝐵) ∩ 𝐹) = (𝐹 ↾ 𝐵))
8	6, 7	mpbi 230	. . . . . 6 ⊢ ((𝐹 ↾ 𝐵) ∩ 𝐹) = (𝐹 ↾ 𝐵)
9	5, 8	eqtr3i 2755	. . . . 5 ⊢ (𝐹 ∩ (𝐹 ↾ 𝐵)) = (𝐹 ↾ 𝐵)
10	4, 9	eqtrdi 2781	. . . 4 ⊢ (𝐹 Fn 𝐴 → ((𝐹 ↾ 𝐴) ∩ (𝐹 ↾ 𝐵)) = (𝐹 ↾ 𝐵))
11	2, 10	eqtrid 2777	. . 3 ⊢ (𝐹 Fn 𝐴 → (𝐹 ↾ (𝐴 ∩ 𝐵)) = (𝐹 ↾ 𝐵))
12	11	fneq1d 6614	. 2 ⊢ (𝐹 Fn 𝐴 → ((𝐹 ↾ (𝐴 ∩ 𝐵)) Fn (𝐴 ∩ 𝐵) ↔ (𝐹 ↾ 𝐵) Fn (𝐴 ∩ 𝐵)))
13	1, 12	mpbid 232	1 ⊢ (𝐹 Fn 𝐴 → (𝐹 ↾ 𝐵) Fn (𝐴 ∩ 𝐵))

Syntax hints:   → wi 4   = wceq 1540   ∩ cin 3916   ⊆ wss 3917   ↾ cres 5643   Fn wfn 6509

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pr 5390

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2709  df-cleq 2722  df-clel 2804  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-sn 4593  df-pr 4595  df-op 4599  df-br 5111  df-opab 5173  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-res 5653  df-fun 6516  df-fn 6517

This theorem is referenced by:  fsuppcurry1  32655  fsuppcurry2  32656  signstres  34573