![]() |
Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > dssmapfv2d | Structured version Visualization version GIF version |
Description: Value of the duality operator for self-mappings of subsets of a base set, 𝐵 when applied to function 𝐹. (Contributed by RP, 19-Apr-2021.) |
Ref | Expression |
---|---|
dssmapfvd.o | ⊢ 𝑂 = (𝑏 ∈ V ↦ (𝑓 ∈ (𝒫 𝑏 ↑m 𝒫 𝑏) ↦ (𝑠 ∈ 𝒫 𝑏 ↦ (𝑏 ∖ (𝑓‘(𝑏 ∖ 𝑠)))))) |
dssmapfvd.d | ⊢ 𝐷 = (𝑂‘𝐵) |
dssmapfvd.b | ⊢ (𝜑 → 𝐵 ∈ 𝑉) |
dssmapfv2d.f | ⊢ (𝜑 → 𝐹 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)) |
dssmapfv2d.g | ⊢ 𝐺 = (𝐷‘𝐹) |
Ref | Expression |
---|---|
dssmapfv2d | ⊢ (𝜑 → 𝐺 = (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵 ∖ 𝑠))))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dssmapfv2d.g | . 2 ⊢ 𝐺 = (𝐷‘𝐹) | |
2 | dssmapfvd.o | . . . 4 ⊢ 𝑂 = (𝑏 ∈ V ↦ (𝑓 ∈ (𝒫 𝑏 ↑m 𝒫 𝑏) ↦ (𝑠 ∈ 𝒫 𝑏 ↦ (𝑏 ∖ (𝑓‘(𝑏 ∖ 𝑠)))))) | |
3 | dssmapfvd.d | . . . 4 ⊢ 𝐷 = (𝑂‘𝐵) | |
4 | dssmapfvd.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑉) | |
5 | 2, 3, 4 | dssmapfvd 42527 | . . 3 ⊢ (𝜑 → 𝐷 = (𝑓 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵) ↦ (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠)))))) |
6 | fveq1 6876 | . . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑓‘(𝐵 ∖ 𝑠)) = (𝐹‘(𝐵 ∖ 𝑠))) | |
7 | 6 | difeq2d 4117 | . . . . 5 ⊢ (𝑓 = 𝐹 → (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠))) = (𝐵 ∖ (𝐹‘(𝐵 ∖ 𝑠)))) |
8 | 7 | mpteq2dv 5242 | . . . 4 ⊢ (𝑓 = 𝐹 → (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠)))) = (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵 ∖ 𝑠))))) |
9 | 8 | adantl 482 | . . 3 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠)))) = (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵 ∖ 𝑠))))) |
10 | dssmapfv2d.f | . . 3 ⊢ (𝜑 → 𝐹 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)) | |
11 | pwexg 5368 | . . . 4 ⊢ (𝐵 ∈ 𝑉 → 𝒫 𝐵 ∈ V) | |
12 | mptexg 7206 | . . . 4 ⊢ (𝒫 𝐵 ∈ V → (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵 ∖ 𝑠)))) ∈ V) | |
13 | 4, 11, 12 | 3syl 18 | . . 3 ⊢ (𝜑 → (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵 ∖ 𝑠)))) ∈ V) |
14 | 5, 9, 10, 13 | fvmptd 6990 | . 2 ⊢ (𝜑 → (𝐷‘𝐹) = (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵 ∖ 𝑠))))) |
15 | 1, 14 | eqtrid 2783 | 1 ⊢ (𝜑 → 𝐺 = (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵 ∖ 𝑠))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2106 Vcvv 3472 ∖ cdif 3940 𝒫 cpw 4595 ↦ cmpt 5223 ‘cfv 6531 (class class class)co 7392 ↑m cmap 8802 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 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 2702 ax-rep 5277 ax-sep 5291 ax-nul 5298 ax-pow 5355 ax-pr 5419 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-ral 3061 df-rex 3070 df-reu 3376 df-rab 3432 df-v 3474 df-sbc 3773 df-csb 3889 df-dif 3946 df-un 3948 df-in 3950 df-ss 3960 df-nul 4318 df-if 4522 df-pw 4597 df-sn 4622 df-pr 4624 df-op 4628 df-uni 4901 df-iun 4991 df-br 5141 df-opab 5203 df-mpt 5224 df-id 5566 df-xp 5674 df-rel 5675 df-cnv 5676 df-co 5677 df-dm 5678 df-rn 5679 df-res 5680 df-ima 5681 df-iota 6483 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-ov 7395 |
This theorem is referenced by: dssmapfv3d 42529 |
Copyright terms: Public domain | W3C validator |