| 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 4181 | . . . 4 ⊢ ((𝐴 ∩ 𝐵) ∩ ran 𝐹) = (𝐴 ∩ (𝐵 ∩ ran 𝐹)) | |
| 2 | sseqin2 4176 | . . . . . . 7 ⊢ (ran 𝐹 ⊆ 𝐵 ↔ (𝐵 ∩ ran 𝐹) = ran 𝐹) | |
| 3 | 2 | biimpi 216 | . . . . . 6 ⊢ (ran 𝐹 ⊆ 𝐵 → (𝐵 ∩ ran 𝐹) = ran 𝐹) |
| 4 | 3 | adantl 481 | . . . . 5 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝐵) → (𝐵 ∩ ran 𝐹) = ran 𝐹) |
| 5 | 4 | ineq2d 4173 | . . . 4 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝐵) → (𝐴 ∩ (𝐵 ∩ ran 𝐹)) = (𝐴 ∩ ran 𝐹)) |
| 6 | 1, 5 | eqtrid 2784 | . . 3 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝐵) → ((𝐴 ∩ 𝐵) ∩ ran 𝐹) = (𝐴 ∩ ran 𝐹)) |
| 7 | 6 | imaeq2d 6020 | . 2 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝐵) → (◡𝐹 “ ((𝐴 ∩ 𝐵) ∩ ran 𝐹)) = (◡𝐹 “ (𝐴 ∩ ran 𝐹))) |
| 8 | fimacnvinrn 7018 | . . 3 ⊢ (Fun 𝐹 → (◡𝐹 “ (𝐴 ∩ 𝐵)) = (◡𝐹 “ ((𝐴 ∩ 𝐵) ∩ ran 𝐹))) | |
| 9 | 8 | adantr 480 | . 2 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝐵) → (◡𝐹 “ (𝐴 ∩ 𝐵)) = (◡𝐹 “ ((𝐴 ∩ 𝐵) ∩ ran 𝐹))) |
| 10 | fimacnvinrn 7018 | . . 3 ⊢ (Fun 𝐹 → (◡𝐹 “ 𝐴) = (◡𝐹 “ (𝐴 ∩ ran 𝐹))) | |
| 11 | 10 | adantr 480 | . 2 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝐵) → (◡𝐹 “ 𝐴) = (◡𝐹 “ (𝐴 ∩ ran 𝐹))) |
| 12 | 7, 9, 11 | 3eqtr4rd 2783 | 1 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝐵) → (◡𝐹 “ 𝐴) = (◡𝐹 “ (𝐴 ∩ 𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∩ cin 3901 ⊆ wss 3902 ◡ccnv 5624 ran crn 5626 “ cima 5628 Fun wfun 6487 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-12 2185 ax-ext 2709 ax-sep 5242 ax-nul 5252 ax-pr 5378 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rex 3062 df-rab 3401 df-v 3443 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4287 df-if 4481 df-sn 4582 df-pr 4584 df-op 4588 df-br 5100 df-opab 5162 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-fun 6495 df-fn 6496 df-f 6497 df-fo 6499 |
| This theorem is referenced by: eulerpartgbij 34542 orvcval4 34631 preimaioomnf 47040 |
| Copyright terms: Public domain | W3C validator |