| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rescnvimafod | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| rescnvimafod.f | ⊢ (𝜑 → 𝐹 Fn 𝐴) |
| rescnvimafod.e | ⊢ (𝜑 → 𝐸 = (ran 𝐹 ∩ 𝐵)) |
| rescnvimafod.d | ⊢ (𝜑 → 𝐷 = (◡𝐹 “ 𝐵)) |
| Ref | Expression |
|---|---|
| rescnvimafod | ⊢ (𝜑 → (𝐹 ↾ 𝐷):𝐷–onto→𝐸) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rescnvimafod.f | . . 3 ⊢ (𝜑 → 𝐹 Fn 𝐴) | |
| 2 | cnvimass 6082 | . . . . 5 ⊢ (◡𝐹 “ 𝐵) ⊆ dom 𝐹 | |
| 3 | 2 | a1i 11 | . . . 4 ⊢ (𝜑 → (◡𝐹 “ 𝐵) ⊆ dom 𝐹) |
| 4 | rescnvimafod.d | . . . 4 ⊢ (𝜑 → 𝐷 = (◡𝐹 “ 𝐵)) | |
| 5 | 1 | fndmd 6641 | . . . . 5 ⊢ (𝜑 → dom 𝐹 = 𝐴) |
| 6 | 5 | eqcomd 2768 | . . . 4 ⊢ (𝜑 → 𝐴 = dom 𝐹) |
| 7 | 3, 4, 6 | 3sstr4d 3989 | . . 3 ⊢ (𝜑 → 𝐷 ⊆ 𝐴) |
| 8 | 1, 7 | fnssresd 6660 | . 2 ⊢ (𝜑 → (𝐹 ↾ 𝐷) Fn 𝐷) |
| 9 | df-ima 5672 | . . . 4 ⊢ (𝐹 “ 𝐷) = ran (𝐹 ↾ 𝐷) | |
| 10 | 4 | imaeq2d 6060 | . . . . 5 ⊢ (𝜑 → (𝐹 “ 𝐷) = (𝐹 “ (◡𝐹 “ 𝐵))) |
| 11 | fnfun 6636 | . . . . . 6 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹) | |
| 12 | funimacnv 6618 | . . . . . 6 ⊢ (Fun 𝐹 → (𝐹 “ (◡𝐹 “ 𝐵)) = (𝐵 ∩ ran 𝐹)) | |
| 13 | 1, 11, 12 | 3syl 19 | . . . . 5 ⊢ (𝜑 → (𝐹 “ (◡𝐹 “ 𝐵)) = (𝐵 ∩ ran 𝐹)) |
| 14 | incom 4158 | . . . . . 6 ⊢ (𝐵 ∩ ran 𝐹) = (ran 𝐹 ∩ 𝐵) | |
| 15 | 14 | a1i 11 | . . . . 5 ⊢ (𝜑 → (𝐵 ∩ ran 𝐹) = (ran 𝐹 ∩ 𝐵)) |
| 16 | 10, 13, 15 | 3eqtrd 2801 | . . . 4 ⊢ (𝜑 → (𝐹 “ 𝐷) = (ran 𝐹 ∩ 𝐵)) |
| 17 | 9, 16 | eqtr3id 2811 | . . 3 ⊢ (𝜑 → ran (𝐹 ↾ 𝐷) = (ran 𝐹 ∩ 𝐵)) |
| 18 | rescnvimafod.e | . . 3 ⊢ (𝜑 → 𝐸 = (ran 𝐹 ∩ 𝐵)) | |
| 19 | 17, 18 | eqtr4d 2800 | . 2 ⊢ (𝜑 → ran (𝐹 ↾ 𝐷) = 𝐸) |
| 20 | df-fo 6543 | . 2 ⊢ ((𝐹 ↾ 𝐷):𝐷–onto→𝐸 ↔ ((𝐹 ↾ 𝐷) Fn 𝐷 ∧ ran (𝐹 ↾ 𝐷) = 𝐸)) | |
| 21 | 8, 19, 20 | sylanbrc 595 | 1 ⊢ (𝜑 → (𝐹 ↾ 𝐷):𝐷–onto→𝐸) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∩ cin 3901 ⊆ wss 3902 ◡ccnv 5658 dom cdm 5659 ran crn 5660 ↾ cres 5661 “ cima 5662 Fun wfun 6531 Fn wfn 6532 –onto→wfo 6535 |
| 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 2215 ax-ext 2734 ax-sep 5255 ax-pr 5402 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-br 5108 df-opab 5172 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-fun 6539 df-fn 6540 df-fo 6543 |
| This theorem is used by: fresfo 47944 fcoreslem3 47961 3f1oss1 47971 |
| Copyright terms: Public domain | W3C validator |