![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > fncnvima2 | Structured version Visualization version GIF version |
Description: Inverse images under functions expressed as abstractions. (Contributed by Stefan O'Rear, 1-Feb-2015.) |
Ref | Expression |
---|---|
fncnvima2 | ⊢ (𝐹 Fn 𝐴 → (◡𝐹 “ 𝐵) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ∈ 𝐵}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elpreima 6805 | . . 3 ⊢ (𝐹 Fn 𝐴 → (𝑥 ∈ (◡𝐹 “ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) ∈ 𝐵))) | |
2 | 1 | abbi2dv 2927 | . 2 ⊢ (𝐹 Fn 𝐴 → (◡𝐹 “ 𝐵) = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) ∈ 𝐵)}) |
3 | df-rab 3115 | . 2 ⊢ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ∈ 𝐵} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) ∈ 𝐵)} | |
4 | 2, 3 | eqtr4di 2851 | 1 ⊢ (𝐹 Fn 𝐴 → (◡𝐹 “ 𝐵) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ∈ 𝐵}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 {cab 2776 {crab 3110 ◡ccnv 5518 “ cima 5522 Fn wfn 6319 ‘cfv 6324 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-sbc 3721 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-iota 6283 df-fun 6326 df-fn 6327 df-fv 6332 |
This theorem is referenced by: fniniseg2 6809 fncnvimaeqv 17362 r0cld 22343 iunpreima 30328 xppreima 30408 xpinpreima 31259 xpinpreima2 31260 orvcval2 31826 preimaiocmnf 42198 preimaicomnf 43347 smfresal 43420 |
Copyright terms: Public domain | W3C validator |