Theorem rescnvimafod 7045

Description: The restriction of a function to a preimage of a class is a function onto the intersection of this class and the range of the function. (Contributed by AV, 13-Sep-2024.) (Revised by AV, 29-Sep-2024.)

Hypotheses

Ref	Expression
rescnvimafod.f	⊢ (𝜑 → 𝐹 Fn 𝐴)
rescnvimafod.e	⊢ (𝜑 → 𝐸 = (ran 𝐹 ∩ 𝐵))
rescnvimafod.d	⊢ (𝜑 → 𝐷 = (◡𝐹 “ 𝐵))

Assertion

Ref	Expression
rescnvimafod	⊢ (𝜑 → (𝐹 ↾ 𝐷):𝐷–onto→𝐸)

Proof of Theorem rescnvimafod

Step	Hyp	Ref	Expression
1		rescnvimafod.f	. . 3 ⊢ (𝜑 → 𝐹 Fn 𝐴)
2		cnvimass 6053	. . . . 5 ⊢ (◡𝐹 “ 𝐵) ⊆ dom 𝐹
3	2	a1i 11	. . . 4 ⊢ (𝜑 → (◡𝐹 “ 𝐵) ⊆ dom 𝐹)
4		rescnvimafod.d	. . . 4 ⊢ (𝜑 → 𝐷 = (◡𝐹 “ 𝐵))
5	1	fndmd 6623	. . . . 5 ⊢ (𝜑 → dom 𝐹 = 𝐴)
6	5	eqcomd 2735	. . . 4 ⊢ (𝜑 → 𝐴 = dom 𝐹)
7	3, 4, 6	3sstr4d 4002	. . 3 ⊢ (𝜑 → 𝐷 ⊆ 𝐴)
8	1, 7	fnssresd 6642	. 2 ⊢ (𝜑 → (𝐹 ↾ 𝐷) Fn 𝐷)
9		df-ima 5651	. . . 4 ⊢ (𝐹 “ 𝐷) = ran (𝐹 ↾ 𝐷)
10	4	imaeq2d 6031	. . . . 5 ⊢ (𝜑 → (𝐹 “ 𝐷) = (𝐹 “ (◡𝐹 “ 𝐵)))
11		fnfun 6618	. . . . . 6 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹)
12		funimacnv 6597	. . . . . 6 ⊢ (Fun 𝐹 → (𝐹 “ (◡𝐹 “ 𝐵)) = (𝐵 ∩ ran 𝐹))
13	1, 11, 12	3syl 18	. . . . 5 ⊢ (𝜑 → (𝐹 “ (◡𝐹 “ 𝐵)) = (𝐵 ∩ ran 𝐹))
14		incom 4172	. . . . . 6 ⊢ (𝐵 ∩ ran 𝐹) = (ran 𝐹 ∩ 𝐵)
15	14	a1i 11	. . . . 5 ⊢ (𝜑 → (𝐵 ∩ ran 𝐹) = (ran 𝐹 ∩ 𝐵))
16	10, 13, 15	3eqtrd 2768	. . . 4 ⊢ (𝜑 → (𝐹 “ 𝐷) = (ran 𝐹 ∩ 𝐵))
17	9, 16	eqtr3id 2778	. . 3 ⊢ (𝜑 → ran (𝐹 ↾ 𝐷) = (ran 𝐹 ∩ 𝐵))
18		rescnvimafod.e	. . 3 ⊢ (𝜑 → 𝐸 = (ran 𝐹 ∩ 𝐵))
19	17, 18	eqtr4d 2767	. 2 ⊢ (𝜑 → ran (𝐹 ↾ 𝐷) = 𝐸)
20		df-fo 6517	. 2 ⊢ ((𝐹 ↾ 𝐷):𝐷–onto→𝐸 ↔ ((𝐹 ↾ 𝐷) Fn 𝐷 ∧ ran (𝐹 ↾ 𝐷) = 𝐸))
21	8, 19, 20	sylanbrc 583	1 ⊢ (𝜑 → (𝐹 ↾ 𝐷):𝐷–onto→𝐸)

Syntax hints:   → wi 4   = wceq 1540   ∩ cin 3913   ⊆ wss 3914  ^◡ccnv 5637  dom cdm 5638  ran crn 5639   ↾ cres 5640   “ cima 5641  Fun wfun 6505   Fn wfn 6506  –onto→wfo 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-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387

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-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-br 5108  df-opab 5170  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-fun 6513  df-fn 6514  df-fo 6517

This theorem is referenced by:  fresfo  47049  fcoreslem3  47066  3f1oss1  47076