| 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 6567 | . 2 ⊢ (Fun 𝐹 → Fun ◡◡𝐹) | |
| 2 | imain 6585 | . 2 ⊢ (Fun ◡◡𝐹 → (◡𝐹 “ (𝐴 ∩ 𝐵)) = ((◡𝐹 “ 𝐴) ∩ (◡𝐹 “ 𝐵))) | |
| 3 | 1, 2 | syl 17 | 1 ⊢ (Fun 𝐹 → (◡𝐹 “ (𝐴 ∩ 𝐵)) = ((◡𝐹 “ 𝐴) ∩ (◡𝐹 “ 𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∩ cin 3902 ◡ccnv 5631 “ cima 5635 Fun wfun 6494 |
| 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 5243 ax-pr 5379 |
| 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 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-br 5101 df-opab 5163 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-fun 6502 |
| This theorem is referenced by: cnvimainrn 7021 sspreima 7022 fimacnvinrn 7025 fsuppeq 8127 fsuppeqg 8128 ofco2 22407 cnrest2 23242 cnhaus 23310 kgencn3 23514 qtoptop2 23655 basqtop 23667 ismbfd 25608 mbfimaopn2 25626 i1fima 25647 i1fima2 25648 i1fd 25650 disjpreima 32670 smfco 47154 predisj 49164 |
| Copyright terms: Public domain | W3C validator |