![]() |
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 7067 | . . 3 ⊢ (𝐹 Fn 𝐴 → (𝑥 ∈ (◡𝐹 “ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) ∈ 𝐵))) | |
2 | 1 | eqabdv 2863 | . 2 ⊢ (𝐹 Fn 𝐴 → (◡𝐹 “ 𝐵) = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) ∈ 𝐵)}) |
3 | df-rab 3430 | . 2 ⊢ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ∈ 𝐵} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) ∈ 𝐵)} | |
4 | 2, 3 | eqtr4di 2786 | 1 ⊢ (𝐹 Fn 𝐴 → (◡𝐹 “ 𝐵) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ∈ 𝐵}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1534 ∈ wcel 2099 {cab 2705 {crab 3429 ◡ccnv 5677 “ cima 5681 Fn wfn 6543 ‘cfv 6548 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-12 2167 ax-ext 2699 ax-sep 5299 ax-nul 5306 ax-pr 5429 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2530 df-eu 2559 df-clab 2706 df-cleq 2720 df-clel 2806 df-ne 2938 df-ral 3059 df-rex 3068 df-rab 3430 df-v 3473 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4324 df-if 4530 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4909 df-br 5149 df-opab 5211 df-id 5576 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-res 5690 df-ima 5691 df-iota 6500 df-fun 6550 df-fn 6551 df-fv 6556 |
This theorem is referenced by: fniniseg2 7071 fncnvimaeqv 18110 rngqiprngimf1 21190 r0cld 23655 iunpreima 32368 xppreima 32445 xpinpreima 33507 xpinpreima2 33508 orvcval2 34078 preimaiocmnf 44946 preimaicomnf 46099 smfresal 46176 |
Copyright terms: Public domain | W3C validator |