| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > preimafvelsetpreimafv | Structured version Visualization version GIF version | ||
| Description: The preimage of a function value is an element of the class 𝑃 of all preimages of function values. (Contributed by AV, 10-Mar-2024.) |
| Ref | Expression |
|---|---|
| setpreimafvex.p | ⊢ 𝑃 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})} |
| Ref | Expression |
|---|---|
| preimafvelsetpreimafv | ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉 ∧ 𝑋 ∈ 𝐴) → (◡𝐹 “ {(𝐹‘𝑋)}) ∈ 𝑃) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | id 23 | . . . 4 ⊢ (𝑋 ∈ 𝐴 → 𝑋 ∈ 𝐴) | |
| 2 | fveq2 6916 | . . . . . . . 8 ⊢ (𝑥 = 𝑋 → (𝐹‘𝑥) = (𝐹‘𝑋)) | |
| 3 | 2 | sneqd 4596 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → {(𝐹‘𝑥)} = {(𝐹‘𝑋)}) |
| 4 | 3 | imaeq2d 6070 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (◡𝐹 “ {(𝐹‘𝑥)}) = (◡𝐹 “ {(𝐹‘𝑋)})) |
| 5 | 4 | eqeq2d 2774 | . . . . 5 ⊢ (𝑥 = 𝑋 → ((◡𝐹 “ {(𝐹‘𝑋)}) = (◡𝐹 “ {(𝐹‘𝑥)}) ↔ (◡𝐹 “ {(𝐹‘𝑋)}) = (◡𝐹 “ {(𝐹‘𝑋)}))) |
| 6 | 5 | adantl 487 | . . . 4 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑥 = 𝑋) → ((◡𝐹 “ {(𝐹‘𝑋)}) = (◡𝐹 “ {(𝐹‘𝑥)}) ↔ (◡𝐹 “ {(𝐹‘𝑋)}) = (◡𝐹 “ {(𝐹‘𝑋)}))) |
| 7 | eqidd 2764 | . . . 4 ⊢ (𝑋 ∈ 𝐴 → (◡𝐹 “ {(𝐹‘𝑋)}) = (◡𝐹 “ {(𝐹‘𝑋)})) | |
| 8 | 1, 6, 7 | rspcedvd 3582 | . . 3 ⊢ (𝑋 ∈ 𝐴 → ∃𝑥 ∈ 𝐴 (◡𝐹 “ {(𝐹‘𝑋)}) = (◡𝐹 “ {(𝐹‘𝑥)})) |
| 9 | 8 | 3ad2ant3 1153 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉 ∧ 𝑋 ∈ 𝐴) → ∃𝑥 ∈ 𝐴 (◡𝐹 “ {(𝐹‘𝑋)}) = (◡𝐹 “ {(𝐹‘𝑥)})) |
| 10 | fnex 7254 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) → 𝐹 ∈ V) | |
| 11 | cnvexg 7970 | . . . . 5 ⊢ (𝐹 ∈ V → ◡𝐹 ∈ V) | |
| 12 | imaexg 7959 | . . . . 5 ⊢ (◡𝐹 ∈ V → (◡𝐹 “ {(𝐹‘𝑋)}) ∈ V) | |
| 13 | 10, 11, 12 | 3syl 19 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) → (◡𝐹 “ {(𝐹‘𝑋)}) ∈ V) |
| 14 | 13 | 3adant3 1150 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉 ∧ 𝑋 ∈ 𝐴) → (◡𝐹 “ {(𝐹‘𝑋)}) ∈ V) |
| 15 | setpreimafvex.p | . . . 4 ⊢ 𝑃 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})} | |
| 16 | 15 | elsetpreimafvb 48800 | . . 3 ⊢ ((◡𝐹 “ {(𝐹‘𝑋)}) ∈ V → ((◡𝐹 “ {(𝐹‘𝑋)}) ∈ 𝑃 ↔ ∃𝑥 ∈ 𝐴 (◡𝐹 “ {(𝐹‘𝑋)}) = (◡𝐹 “ {(𝐹‘𝑥)}))) |
| 17 | 14, 16 | syl 18 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉 ∧ 𝑋 ∈ 𝐴) → ((◡𝐹 “ {(𝐹‘𝑋)}) ∈ 𝑃 ↔ ∃𝑥 ∈ 𝐴 (◡𝐹 “ {(𝐹‘𝑋)}) = (◡𝐹 “ {(𝐹‘𝑥)}))) |
| 18 | 9, 17 | mpbird 260 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉 ∧ 𝑋 ∈ 𝐴) → (◡𝐹 “ {(𝐹‘𝑋)}) ∈ 𝑃) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 {cab 2741 ∃wrex 3090 Vcvv 3454 {csn 4588 ◡ccnv 5657 “ cima 5661 Fn wfn 6561 ‘cfv 6566 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 |
| This theorem is used by: imasetpreimafvbijlemfo 48821 fundcmpsurbijinjpreimafv 48823 |
| Copyright terms: Public domain | W3C validator |