![]() |
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 43974 | . . 3 ⊢ (𝜑 → (𝐺‘𝐹) = (𝑦 ∈ 𝐵 ↦ {𝑥 ∈ 𝐴 ∣ 𝑦 ∈ (𝐹‘𝑥)})) |
8 | 1, 7 | eqtrid 2792 | . 2 ⊢ (𝜑 → 𝐻 = (𝑦 ∈ 𝐵 ↦ {𝑥 ∈ 𝐴 ∣ 𝑦 ∈ (𝐹‘𝑥)})) |
9 | eleq1 2832 | . . . 4 ⊢ (𝑦 = 𝑌 → (𝑦 ∈ (𝐹‘𝑥) ↔ 𝑌 ∈ (𝐹‘𝑥))) | |
10 | 9 | rabbidv 3451 | . . 3 ⊢ (𝑦 = 𝑌 → {𝑥 ∈ 𝐴 ∣ 𝑦 ∈ (𝐹‘𝑥)} = {𝑥 ∈ 𝐴 ∣ 𝑌 ∈ (𝐹‘𝑥)}) |
11 | 10 | adantl 481 | . 2 ⊢ ((𝜑 ∧ 𝑦 = 𝑌) → {𝑥 ∈ 𝐴 ∣ 𝑦 ∈ (𝐹‘𝑥)} = {𝑥 ∈ 𝐴 ∣ 𝑌 ∈ (𝐹‘𝑥)}) |
12 | fsovfvfvd.y | . 2 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
13 | rabexg 5355 | . . 3 ⊢ (𝐴 ∈ 𝑉 → {𝑥 ∈ 𝐴 ∣ 𝑌 ∈ (𝐹‘𝑥)} ∈ V) | |
14 | 3, 13 | syl 17 | . 2 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝑌 ∈ (𝐹‘𝑥)} ∈ V) |
15 | 8, 11, 12, 14 | fvmptd 7038 | 1 ⊢ (𝜑 → (𝐻‘𝑌) = {𝑥 ∈ 𝐴 ∣ 𝑌 ∈ (𝐹‘𝑥)}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2108 {crab 3443 Vcvv 3488 𝒫 cpw 4622 ↦ cmpt 5249 ‘cfv 6575 (class class class)co 7450 ∈ cmpo 7452 ↑m cmap 8886 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pr 5447 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-iota 6527 df-fun 6577 df-fn 6578 df-f 6579 df-f1 6580 df-fo 6581 df-f1o 6582 df-fv 6583 df-ov 7453 df-oprab 7454 df-mpo 7455 |
This theorem is referenced by: ntrneiel 44045 |
Copyright terms: Public domain | W3C validator |