| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fimacnvinrn2 | 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, 17-Feb-2017.) |
| Ref | Expression |
|---|---|
| fimacnvinrn2 | ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝐵) → (◡𝐹 “ 𝐴) = (◡𝐹 “ (𝐴 ∩ 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | inass 4173 | . . . 4 ⊢ ((𝐴 ∩ 𝐵) ∩ ran 𝐹) = (𝐴 ∩ (𝐵 ∩ ran 𝐹)) | |
| 2 | sseqin2 4169 | . . . . . 6 ⊢ (ran 𝐹 ⊆ 𝐵 ↔ (𝐵 ∩ ran 𝐹) = ran 𝐹) | |
| 3 | 2 | bilani 510 | . . . . 5 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝐵) → (𝐵 ∩ ran 𝐹) = ran 𝐹) |
| 4 | 3 | ineq2d 4166 | . . . 4 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝐵) → (𝐴 ∩ (𝐵 ∩ ran 𝐹)) = (𝐴 ∩ ran 𝐹)) |
| 5 | 1, 4 | eqtrid 2807 | . . 3 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝐵) → ((𝐴 ∩ 𝐵) ∩ ran 𝐹) = (𝐴 ∩ ran 𝐹)) |
| 6 | 5 | imaeq2d 6056 | . 2 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝐵) → (◡𝐹 “ ((𝐴 ∩ 𝐵) ∩ ran 𝐹)) = (◡𝐹 “ (𝐴 ∩ ran 𝐹))) |
| 7 | fimacnvinrn 7064 | . . 3 ⊢ (Fun 𝐹 → (◡𝐹 “ (𝐴 ∩ 𝐵)) = (◡𝐹 “ ((𝐴 ∩ 𝐵) ∩ ran 𝐹))) | |
| 8 | 7 | adantr 486 | . 2 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝐵) → (◡𝐹 “ (𝐴 ∩ 𝐵)) = (◡𝐹 “ ((𝐴 ∩ 𝐵) ∩ ran 𝐹))) |
| 9 | fimacnvinrn 7064 | . . 3 ⊢ (Fun 𝐹 → (◡𝐹 “ 𝐴) = (◡𝐹 “ (𝐴 ∩ ran 𝐹))) | |
| 10 | 9 | adantr 486 | . 2 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝐵) → (◡𝐹 “ 𝐴) = (◡𝐹 “ (𝐴 ∩ ran 𝐹))) |
| 11 | 6, 8, 10 | 3eqtr4rd 2806 | 1 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝐵) → (◡𝐹 “ 𝐴) = (◡𝐹 “ (𝐴 ∩ 𝐵))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∩ cin 3898 ⊆ wss 3899 ◡ccnv 5654 ran crn 5656 “ cima 5658 Fun wfun 6527 |
| 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-10 2178 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-pr 5398 |
| 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-nf 1817 df-sb 2100 df-mo 2564 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 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 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-fun 6535 df-fn 6536 df-f 6537 df-fo 6539 |
| This theorem is used by: eulerpartgbij 34883 orvcval4 34972 preimaioomnf 47547 |
| Copyright terms: Public domain | W3C validator |