| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > inpreima | Structured version Visualization version GIF version | ||
| Description: Preimage of an intersection. (Contributed by Jeff Madsen, 2-Sep-2009.) (Proof shortened by Mario Carneiro, 14-Jun-2016.) |
| Ref | Expression |
|---|---|
| inpreima | ⊢ (Fun 𝐹 → (◡𝐹 “ (𝐴 ∩ 𝐵)) = ((◡𝐹 “ 𝐴) ∩ (◡𝐹 “ 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | funcnvcnv 6559 | . 2 ⊢ (Fun 𝐹 → Fun ◡◡𝐹) | |
| 2 | imain 6577 | . 2 ⊢ (Fun ◡◡𝐹 → (◡𝐹 “ (𝐴 ∩ 𝐵)) = ((◡𝐹 “ 𝐴) ∩ (◡𝐹 “ 𝐵))) | |
| 3 | 1, 2 | syl 17 | 1 ⊢ (Fun 𝐹 → (◡𝐹 “ (𝐴 ∩ 𝐵)) = ((◡𝐹 “ 𝐴) ∩ (◡𝐹 “ 𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∩ cin 3889 ◡ccnv 5623 “ cima 5627 Fun wfun 6486 |
| 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 5231 ax-pr 5370 |
| 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 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-br 5087 df-opab 5149 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-fun 6494 |
| This theorem is referenced by: cnvimainrn 7013 sspreima 7014 fimacnvinrn 7017 fsuppeq 8118 fsuppeqg 8119 ofco2 22426 cnrest2 23261 cnhaus 23329 kgencn3 23533 qtoptop2 23674 basqtop 23686 ismbfd 25616 mbfimaopn2 25634 i1fima 25655 i1fima2 25656 i1fd 25658 disjpreima 32669 smfco 47248 predisj 49298 |
| Copyright terms: Public domain | W3C validator |