| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > elsetpreimafvb | Structured version Visualization version GIF version | ||
| Description: The characterization of an element of the class 𝑃 of all preimages of function values. (Contributed by AV, 10-Mar-2024.) |
| Ref | Expression |
|---|---|
| setpreimafvex.p | ⊢ 𝑃 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})} |
| Ref | Expression |
|---|---|
| elsetpreimafvb | ⊢ (𝑆 ∈ 𝑉 → (𝑆 ∈ 𝑃 ↔ ∃𝑥 ∈ 𝐴 𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | setpreimafvex.p | . . 3 ⊢ 𝑃 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})} | |
| 2 | 1 | eleq2i 2823 | . 2 ⊢ (𝑆 ∈ 𝑃 ↔ 𝑆 ∈ {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})}) |
| 3 | eqeq1 2735 | . . . 4 ⊢ (𝑧 = 𝑆 → (𝑧 = (◡𝐹 “ {(𝐹‘𝑥)}) ↔ 𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}))) | |
| 4 | 3 | rexbidv 3156 | . . 3 ⊢ (𝑧 = 𝑆 → (∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)}) ↔ ∃𝑥 ∈ 𝐴 𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}))) |
| 5 | 4 | elabg 3627 | . 2 ⊢ (𝑆 ∈ 𝑉 → (𝑆 ∈ {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})} ↔ ∃𝑥 ∈ 𝐴 𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}))) |
| 6 | 2, 5 | bitrid 283 | 1 ⊢ (𝑆 ∈ 𝑉 → (𝑆 ∈ 𝑃 ↔ ∃𝑥 ∈ 𝐴 𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1541 ∈ wcel 2111 {cab 2709 ∃wrex 3056 {csn 4573 ◡ccnv 5613 “ cima 5617 ‘cfv 6481 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-ext 2703 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1544 df-ex 1781 df-sb 2068 df-clab 2710 df-cleq 2723 df-clel 2806 df-rex 3057 |
| This theorem is referenced by: elsetpreimafv 47424 preimafvelsetpreimafv 47427 0nelsetpreimafv 47429 |
| Copyright terms: Public domain | W3C validator |