Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > rfovcnvfvd | Structured version Visualization version GIF version |
Description: Value of the converse of the operator, (𝐴𝑂𝐵), which maps between relations and functions for relations between base sets, 𝐴 and 𝐵, evaluated at function 𝐺. (Contributed by RP, 27-Apr-2021.) |
Ref | Expression |
---|---|
rfovd.rf | ⊢ 𝑂 = (𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑟 ∈ 𝒫 (𝑎 × 𝑏) ↦ (𝑥 ∈ 𝑎 ↦ {𝑦 ∈ 𝑏 ∣ 𝑥𝑟𝑦}))) |
rfovd.a | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
rfovd.b | ⊢ (𝜑 → 𝐵 ∈ 𝑊) |
rfovcnvf1od.f | ⊢ 𝐹 = (𝐴𝑂𝐵) |
rfovcnvfv.g | ⊢ (𝜑 → 𝐺 ∈ (𝒫 𝐵 ↑m 𝐴)) |
Ref | Expression |
---|---|
rfovcnvfvd | ⊢ (𝜑 → (◡𝐹‘𝐺) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐺‘𝑥))}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rfovd.rf | . . 3 ⊢ 𝑂 = (𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑟 ∈ 𝒫 (𝑎 × 𝑏) ↦ (𝑥 ∈ 𝑎 ↦ {𝑦 ∈ 𝑏 ∣ 𝑥𝑟𝑦}))) | |
2 | rfovd.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
3 | rfovd.b | . . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑊) | |
4 | rfovcnvf1od.f | . . 3 ⊢ 𝐹 = (𝐴𝑂𝐵) | |
5 | 1, 2, 3, 4 | rfovcnvd 41242 | . 2 ⊢ (𝜑 → ◡𝐹 = (𝑔 ∈ (𝒫 𝐵 ↑m 𝐴) ↦ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝑔‘𝑥))})) |
6 | fveq1 6705 | . . . . . 6 ⊢ (𝑔 = 𝐺 → (𝑔‘𝑥) = (𝐺‘𝑥)) | |
7 | 6 | eleq2d 2819 | . . . . 5 ⊢ (𝑔 = 𝐺 → (𝑦 ∈ (𝑔‘𝑥) ↔ 𝑦 ∈ (𝐺‘𝑥))) |
8 | 7 | anbi2d 632 | . . . 4 ⊢ (𝑔 = 𝐺 → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝑔‘𝑥)) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐺‘𝑥)))) |
9 | 8 | opabbidv 5109 | . . 3 ⊢ (𝑔 = 𝐺 → {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝑔‘𝑥))} = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐺‘𝑥))}) |
10 | 9 | adantl 485 | . 2 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝑔‘𝑥))} = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐺‘𝑥))}) |
11 | rfovcnvfv.g | . 2 ⊢ (𝜑 → 𝐺 ∈ (𝒫 𝐵 ↑m 𝐴)) | |
12 | simprl 771 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐺‘𝑥))) → 𝑥 ∈ 𝐴) | |
13 | elmapi 8519 | . . . . . . . 8 ⊢ (𝐺 ∈ (𝒫 𝐵 ↑m 𝐴) → 𝐺:𝐴⟶𝒫 𝐵) | |
14 | 13 | ffvelrnda 6893 | . . . . . . 7 ⊢ ((𝐺 ∈ (𝒫 𝐵 ↑m 𝐴) ∧ 𝑥 ∈ 𝐴) → (𝐺‘𝑥) ∈ 𝒫 𝐵) |
15 | 11, 14 | sylan 583 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐺‘𝑥) ∈ 𝒫 𝐵) |
16 | 15 | elpwid 4514 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐺‘𝑥) ⊆ 𝐵) |
17 | 16 | sseld 3890 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑦 ∈ (𝐺‘𝑥) → 𝑦 ∈ 𝐵)) |
18 | 17 | impr 458 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐺‘𝑥))) → 𝑦 ∈ 𝐵) |
19 | 2, 3, 12, 18 | opabex2 7816 | . 2 ⊢ (𝜑 → {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐺‘𝑥))} ∈ V) |
20 | 5, 10, 11, 19 | fvmptd 6814 | 1 ⊢ (𝜑 → (◡𝐹‘𝐺) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐺‘𝑥))}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1543 ∈ wcel 2110 {crab 3058 Vcvv 3401 𝒫 cpw 4503 class class class wbr 5043 {copab 5105 ↦ cmpt 5124 × cxp 5538 ◡ccnv 5539 ‘cfv 6369 (class class class)co 7202 ∈ cmpo 7204 ↑m cmap 8497 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2706 ax-rep 5168 ax-sep 5181 ax-nul 5188 ax-pow 5247 ax-pr 5311 ax-un 7512 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2537 df-eu 2566 df-clab 2713 df-cleq 2726 df-clel 2812 df-nfc 2882 df-ne 2936 df-ral 3059 df-rex 3060 df-reu 3061 df-rab 3063 df-v 3403 df-sbc 3688 df-csb 3803 df-dif 3860 df-un 3862 df-in 3864 df-ss 3874 df-nul 4228 df-if 4430 df-pw 4505 df-sn 4532 df-pr 4534 df-op 4538 df-uni 4810 df-iun 4896 df-br 5044 df-opab 5106 df-mpt 5125 df-id 5444 df-xp 5546 df-rel 5547 df-cnv 5548 df-co 5549 df-dm 5550 df-rn 5551 df-res 5552 df-ima 5553 df-iota 6327 df-fun 6371 df-fn 6372 df-f 6373 df-f1 6374 df-fo 6375 df-f1o 6376 df-fv 6377 df-ov 7205 df-oprab 7206 df-mpo 7207 df-1st 7750 df-2nd 7751 df-map 8499 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |