Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fimacnvinrn | Structured version Visualization version GIF version |
Description: Taking the converse image of a set can be limited to the range of the function used. (Contributed by Thierry Arnoux, 21-Jan-2017.) |
Ref | Expression |
---|---|
fimacnvinrn | ⊢ (Fun 𝐹 → (◡𝐹 “ 𝐴) = (◡𝐹 “ (𝐴 ∩ ran 𝐹))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | inpreima 6941 | . 2 ⊢ (Fun 𝐹 → (◡𝐹 “ (𝐴 ∩ ran 𝐹)) = ((◡𝐹 “ 𝐴) ∩ (◡𝐹 “ ran 𝐹))) | |
2 | funforn 6695 | . . . . 5 ⊢ (Fun 𝐹 ↔ 𝐹:dom 𝐹–onto→ran 𝐹) | |
3 | fof 6688 | . . . . 5 ⊢ (𝐹:dom 𝐹–onto→ran 𝐹 → 𝐹:dom 𝐹⟶ran 𝐹) | |
4 | 2, 3 | sylbi 216 | . . . 4 ⊢ (Fun 𝐹 → 𝐹:dom 𝐹⟶ran 𝐹) |
5 | fimacnv 6622 | . . . 4 ⊢ (𝐹:dom 𝐹⟶ran 𝐹 → (◡𝐹 “ ran 𝐹) = dom 𝐹) | |
6 | 4, 5 | syl 17 | . . 3 ⊢ (Fun 𝐹 → (◡𝐹 “ ran 𝐹) = dom 𝐹) |
7 | 6 | ineq2d 4146 | . 2 ⊢ (Fun 𝐹 → ((◡𝐹 “ 𝐴) ∩ (◡𝐹 “ ran 𝐹)) = ((◡𝐹 “ 𝐴) ∩ dom 𝐹)) |
8 | cnvresima 6133 | . . 3 ⊢ (◡(𝐹 ↾ dom 𝐹) “ 𝐴) = ((◡𝐹 “ 𝐴) ∩ dom 𝐹) | |
9 | resdm2 6134 | . . . . . 6 ⊢ (𝐹 ↾ dom 𝐹) = ◡◡𝐹 | |
10 | funrel 6451 | . . . . . . 7 ⊢ (Fun 𝐹 → Rel 𝐹) | |
11 | dfrel2 6092 | . . . . . . 7 ⊢ (Rel 𝐹 ↔ ◡◡𝐹 = 𝐹) | |
12 | 10, 11 | sylib 217 | . . . . . 6 ⊢ (Fun 𝐹 → ◡◡𝐹 = 𝐹) |
13 | 9, 12 | eqtrid 2790 | . . . . 5 ⊢ (Fun 𝐹 → (𝐹 ↾ dom 𝐹) = 𝐹) |
14 | 13 | cnveqd 5784 | . . . 4 ⊢ (Fun 𝐹 → ◡(𝐹 ↾ dom 𝐹) = ◡𝐹) |
15 | 14 | imaeq1d 5968 | . . 3 ⊢ (Fun 𝐹 → (◡(𝐹 ↾ dom 𝐹) “ 𝐴) = (◡𝐹 “ 𝐴)) |
16 | 8, 15 | eqtr3id 2792 | . 2 ⊢ (Fun 𝐹 → ((◡𝐹 “ 𝐴) ∩ dom 𝐹) = (◡𝐹 “ 𝐴)) |
17 | 1, 7, 16 | 3eqtrrd 2783 | 1 ⊢ (Fun 𝐹 → (◡𝐹 “ 𝐴) = (◡𝐹 “ (𝐴 ∩ ran 𝐹))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 ∩ cin 3886 ◡ccnv 5588 dom cdm 5589 ran crn 5590 ↾ cres 5591 “ cima 5592 Rel wrel 5594 Fun wfun 6427 ⟶wf 6429 –onto→wfo 6431 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-br 5075 df-opab 5137 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-fun 6435 df-fn 6436 df-f 6437 df-fo 6439 |
This theorem is referenced by: fimacnvinrn2 6950 preiman0 31042 |
Copyright terms: Public domain | W3C validator |