MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  rescnvimafod Structured version   Visualization version   GIF version

Theorem rescnvimafod 7065
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
StepHypRef Expression
1 rescnvimafod.f . . 3 (𝜑 → 𝐹 Fn 𝐴)
2 cnvimass 6076 . . . . 5 (◡𝐹 “ 𝐵) ⊆ dom 𝐹
32a1i 11 . . . 4 (𝜑 → (◡𝐹 “ 𝐵) ⊆ dom 𝐹)
4 rescnvimafod.d . . . 4 (𝜑 → 𝐷 = (◡𝐹 “ 𝐵))
51fndmd 6636 . . . . 5 (𝜑 → dom 𝐹 = 𝐴)
65eqcomd 2767 . . . 4 (𝜑 → 𝐴 = dom 𝐹)
73, 4, 63sstr4d 3986 . . 3 (𝜑 → 𝐷 ⊆ 𝐴)
81, 7fnssresd 6655 . 2 (𝜑 → (𝐹 ↾ 𝐷) Fn 𝐷)
9 df-ima 5664 . . . 4 (𝐹 “ 𝐷) = ran (𝐹 ↾ 𝐷)
104imaeq2d 6054 . . . . 5 (𝜑 → (𝐹 “ 𝐷) = (𝐹 “ (◡𝐹 “ 𝐵)))
11 fnfun 6631 . . . . . 6 (𝐹 Fn 𝐴 → Fun 𝐹)
12 funimacnv 6613 . . . . . 6 (Fun 𝐹 → (𝐹 “ (◡𝐹 “ 𝐵)) = (𝐵 ∩ ran 𝐹))
131, 11, 123syl 19 . . . . 5 (𝜑 → (𝐹 “ (◡𝐹 “ 𝐵)) = (𝐵 ∩ ran 𝐹))
14 incom 4155 . . . . . 6 (𝐵 ∩ ran 𝐹) = (ran 𝐹 ∩ 𝐵)
1514a1i 11 . . . . 5 (𝜑 → (𝐵 ∩ ran 𝐹) = (ran 𝐹 ∩ 𝐵))
1610, 13, 153eqtrd 2800 . . . 4 (𝜑 → (𝐹 “ 𝐷) = (ran 𝐹 ∩ 𝐵))
179, 16eqtr3id 2810 . . 3 (𝜑 → ran (𝐹 ↾ 𝐷) = (ran 𝐹 ∩ 𝐵))
18 rescnvimafod.e . . 3 (𝜑 → 𝐸 = (ran 𝐹 ∩ 𝐵))
1917, 18eqtr4d 2799 . 2 (𝜑 → ran (𝐹 ↾ 𝐷) = 𝐸)
20 df-fo 6537 . 2 ((𝐹 ↾ 𝐷):𝐷–onto→𝐸 ↔ ((𝐹 ↾ 𝐷) Fn 𝐷 ∧ ran (𝐹 ↾ 𝐷) = 𝐸))
218, 19, 20sylanbrc 595 1 (𝜑 → (𝐹 ↾ 𝐷):𝐷–onto→𝐸)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∩ cin 3898   ⊆ wss 3899  ◡ccnv 5650  dom cdm 5651  ran crn 5652   ↾ cres 5653   “ cima 5654  Fun wfun 6525   Fn wfn 6526  –onto→wfo 6529
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-12 2213  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-mo 2565  df-eu 2595  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-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-fun 6533  df-fn 6534  df-fo 6537
This theorem is used by:  fresfo  48062  fcoreslem3  48079  3f1oss1  48089
  Copyright terms: Public domain W3C validator