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 6337 | . . 3 ⊢ (𝐹 Fn 𝐴 → (𝑥 ∈ (◡𝐹 “ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) ∈ 𝐵))) | |
2 | 1 | abbi2dv 2742 | . 2 ⊢ (𝐹 Fn 𝐴 → (◡𝐹 “ 𝐵) = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) ∈ 𝐵)}) |
3 | df-rab 2921 | . 2 ⊢ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ∈ 𝐵} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) ∈ 𝐵)} | |
4 | 2, 3 | syl6eqr 2674 | 1 ⊢ (𝐹 Fn 𝐴 → (◡𝐹 “ 𝐵) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ∈ 𝐵}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 = wceq 1483 ∈ wcel 1990 {cab 2608 {crab 2916 ◡ccnv 5113 “ cima 5117 Fn wfn 5883 ‘cfv 5888 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pr 4906 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-sbc 3436 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-opab 4713 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-iota 5851 df-fun 5890 df-fn 5891 df-fv 5896 |
This theorem is referenced by: fniniseg2 6340 fncnvimaeqv 16760 r0cld 21541 iunpreima 29383 xppreima 29449 xpinpreima 29952 xpinpreima2 29953 orvcval2 30520 preimaiocmnf 39788 preimaicomnf 40922 smfresal 40995 |
Copyright terms: Public domain | W3C validator |