Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > fsovfvfvd | Structured version Visualization version GIF version |
Description: Value of the operator, (𝐴𝑂𝐵), which maps between maps from one base set to subsets of the second to maps from the second base set to subsets of the first for base sets, 𝐴 and 𝐵, when applied to function 𝐹 and element 𝑌. (Contributed by RP, 25-Apr-2021.) |
Ref | Expression |
---|---|
fsovd.fs | ⊢ 𝑂 = (𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑓 ∈ (𝒫 𝑏 ↑m 𝑎) ↦ (𝑦 ∈ 𝑏 ↦ {𝑥 ∈ 𝑎 ∣ 𝑦 ∈ (𝑓‘𝑥)}))) |
fsovd.a | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
fsovd.b | ⊢ (𝜑 → 𝐵 ∈ 𝑊) |
fsovfvd.g | ⊢ 𝐺 = (𝐴𝑂𝐵) |
fsovfvd.f | ⊢ (𝜑 → 𝐹 ∈ (𝒫 𝐵 ↑m 𝐴)) |
fsovfvfvd.h | ⊢ 𝐻 = (𝐺‘𝐹) |
fsovfvfvd.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
Ref | Expression |
---|---|
fsovfvfvd | ⊢ (𝜑 → (𝐻‘𝑌) = {𝑥 ∈ 𝐴 ∣ 𝑌 ∈ (𝐹‘𝑥)}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fsovfvfvd.h | . . 3 ⊢ 𝐻 = (𝐺‘𝐹) | |
2 | fsovd.fs | . . . 4 ⊢ 𝑂 = (𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑓 ∈ (𝒫 𝑏 ↑m 𝑎) ↦ (𝑦 ∈ 𝑏 ↦ {𝑥 ∈ 𝑎 ∣ 𝑦 ∈ (𝑓‘𝑥)}))) | |
3 | fsovd.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
4 | fsovd.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑊) | |
5 | fsovfvd.g | . . . 4 ⊢ 𝐺 = (𝐴𝑂𝐵) | |
6 | fsovfvd.f | . . . 4 ⊢ (𝜑 → 𝐹 ∈ (𝒫 𝐵 ↑m 𝐴)) | |
7 | 2, 3, 4, 5, 6 | fsovfvd 41618 | . . 3 ⊢ (𝜑 → (𝐺‘𝐹) = (𝑦 ∈ 𝐵 ↦ {𝑥 ∈ 𝐴 ∣ 𝑦 ∈ (𝐹‘𝑥)})) |
8 | 1, 7 | eqtrid 2790 | . 2 ⊢ (𝜑 → 𝐻 = (𝑦 ∈ 𝐵 ↦ {𝑥 ∈ 𝐴 ∣ 𝑦 ∈ (𝐹‘𝑥)})) |
9 | eleq1 2826 | . . . 4 ⊢ (𝑦 = 𝑌 → (𝑦 ∈ (𝐹‘𝑥) ↔ 𝑌 ∈ (𝐹‘𝑥))) | |
10 | 9 | rabbidv 3414 | . . 3 ⊢ (𝑦 = 𝑌 → {𝑥 ∈ 𝐴 ∣ 𝑦 ∈ (𝐹‘𝑥)} = {𝑥 ∈ 𝐴 ∣ 𝑌 ∈ (𝐹‘𝑥)}) |
11 | 10 | adantl 482 | . 2 ⊢ ((𝜑 ∧ 𝑦 = 𝑌) → {𝑥 ∈ 𝐴 ∣ 𝑦 ∈ (𝐹‘𝑥)} = {𝑥 ∈ 𝐴 ∣ 𝑌 ∈ (𝐹‘𝑥)}) |
12 | fsovfvfvd.y | . 2 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
13 | rabexg 5255 | . . 3 ⊢ (𝐴 ∈ 𝑉 → {𝑥 ∈ 𝐴 ∣ 𝑌 ∈ (𝐹‘𝑥)} ∈ V) | |
14 | 3, 13 | syl 17 | . 2 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝑌 ∈ (𝐹‘𝑥)} ∈ V) |
15 | 8, 11, 12, 14 | fvmptd 6882 | 1 ⊢ (𝜑 → (𝐻‘𝑌) = {𝑥 ∈ 𝐴 ∣ 𝑌 ∈ (𝐹‘𝑥)}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2106 {crab 3068 Vcvv 3432 𝒫 cpw 4533 ↦ cmpt 5157 ‘cfv 6433 (class class class)co 7275 ∈ cmpo 7277 ↑m cmap 8615 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pr 5352 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-ov 7278 df-oprab 7279 df-mpo 7280 |
This theorem is referenced by: ntrneiel 41691 |
Copyright terms: Public domain | W3C validator |