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

Theorem rescnvimafod 7100
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 6212 . . . . 5 (◡𝐹 “ 𝐵) ⊆ dom 𝐹
32a1i 11 . . . 4 (𝜑 → (◡𝐹 “ 𝐵) ⊆ dom 𝐹)
4 rescnvimafod.d . . . 4 (𝜑 → 𝐷 = (◡𝐹 “ 𝐵))
51fndmd 6669 . . . . 5 (𝜑 → dom 𝐹 = 𝐴)
65eqcomd 2769 . . . 4 (𝜑 → 𝐴 = dom 𝐹)
73, 4, 63sstr4d 3968 . . 3 (𝜑 → 𝐷 ⊆ 𝐴)
81, 7fnssresd 6688 . 2 (𝜑 → (𝐹 ↾ 𝐷) Fn 𝐷)
9 df-ima 5669 . . . 4 (𝐹 “ 𝐷) = ran (𝐹 ↾ 𝐷)
104imaeq2d 6065 . . . . 5 (𝜑 → (𝐹 “ 𝐷) = (𝐹 “ (◡𝐹 “ 𝐵)))
11 fnfun 6664 . . . . . 6 (𝐹 Fn 𝐴 → Fun 𝐹)
12 funimacnv 6646 . . . . . 6 (Fun 𝐹 → (𝐹 “ (◡𝐹 “ 𝐵)) = (𝐵 ∩ ran 𝐹))
131, 11, 123syl 19 . . . . 5 (𝜑 → (𝐹 “ (◡𝐹 “ 𝐵)) = (𝐵 ∩ ran 𝐹))
14 incom 4109 . . . . . 6 (𝐵 ∩ ran 𝐹) = (ran 𝐹 ∩ 𝐵)
1514a1i 11 . . . . 5 (𝜑 → (𝐵 ∩ ran 𝐹) = (ran 𝐹 ∩ 𝐵))
1610, 13, 153eqtrd 2802 . . . 4 (𝜑 → (𝐹 “ 𝐷) = (ran 𝐹 ∩ 𝐵))
179, 16eqtr3id 2812 . . 3 (𝜑 → ran (𝐹 ↾ 𝐷) = (ran 𝐹 ∩ 𝐵))
18 rescnvimafod.e . . 3 (𝜑 → 𝐸 = (ran 𝐹 ∩ 𝐵))
1917, 18eqtr4d 2801 . 2 (𝜑 → ran (𝐹 ↾ 𝐷) = 𝐸)
20 df-fo 6567 . 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   ⊆ wss 3900   ∩ cin 4092  ◡ccnv 5655  dom cdm 5656  ran crn 5657   ↾ cres 5658   “ cima 5659  Fun wfun 6555   Fn wfn 6556  ⟶ontowfo 6559
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-pr 5396
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5172  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-fun 6563  df-fn 6564  df-fo 6567
This theorem is used by:  fresfo  48333  fcoreslem3  48350  3f1oss1  48360
  Copyright terms: Public domain W3C validator