Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fniniseg2 | Structured version Visualization version GIF version |
Description: Inverse point images under functions expressed as abstractions. (Contributed by Stefan O'Rear, 1-Feb-2015.) |
Ref | Expression |
---|---|
fniniseg2 | ⊢ (𝐹 Fn 𝐴 → (◡𝐹 “ {𝐵}) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) = 𝐵}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fncnvima2 6247 | . 2 ⊢ (𝐹 Fn 𝐴 → (◡𝐹 “ {𝐵}) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ∈ {𝐵}}) | |
2 | fvex 6113 | . . . . 5 ⊢ (𝐹‘𝑥) ∈ V | |
3 | 2 | elsn 4140 | . . . 4 ⊢ ((𝐹‘𝑥) ∈ {𝐵} ↔ (𝐹‘𝑥) = 𝐵) |
4 | 3 | a1i 11 | . . 3 ⊢ (𝑥 ∈ 𝐴 → ((𝐹‘𝑥) ∈ {𝐵} ↔ (𝐹‘𝑥) = 𝐵)) |
5 | 4 | rabbiia 3161 | . 2 ⊢ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ∈ {𝐵}} = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) = 𝐵} |
6 | 1, 5 | syl6eq 2660 | 1 ⊢ (𝐹 Fn 𝐴 → (◡𝐹 “ {𝐵}) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) = 𝐵}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 = wceq 1475 ∈ wcel 1977 {crab 2900 {csn 4125 ◡ccnv 5037 “ cima 5041 Fn wfn 5799 ‘cfv 5804 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pr 4833 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-br 4584 df-opab 4644 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-fv 5812 |
This theorem is referenced by: idomrootle 36792 proot1hash 36797 |
Copyright terms: Public domain | W3C validator |