![]() |
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 40718 | . . 3 ⊢ (𝜑 → 𝐷 = (𝑓 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵) ↦ (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠)))))) |
6 | fveq1 6644 | . . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑓‘(𝐵 ∖ 𝑠)) = (𝐹‘(𝐵 ∖ 𝑠))) | |
7 | 6 | difeq2d 4050 | . . . . 5 ⊢ (𝑓 = 𝐹 → (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠))) = (𝐵 ∖ (𝐹‘(𝐵 ∖ 𝑠)))) |
8 | 7 | mpteq2dv 5126 | . . . 4 ⊢ (𝑓 = 𝐹 → (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠)))) = (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵 ∖ 𝑠))))) |
9 | 8 | adantl 485 | . . 3 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠)))) = (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵 ∖ 𝑠))))) |
10 | dssmapfv2d.f | . . 3 ⊢ (𝜑 → 𝐹 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)) | |
11 | pwexg 5244 | . . . 4 ⊢ (𝐵 ∈ 𝑉 → 𝒫 𝐵 ∈ V) | |
12 | mptexg 6961 | . . . 4 ⊢ (𝒫 𝐵 ∈ V → (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵 ∖ 𝑠)))) ∈ V) | |
13 | 4, 11, 12 | 3syl 18 | . . 3 ⊢ (𝜑 → (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵 ∖ 𝑠)))) ∈ V) |
14 | 5, 9, 10, 13 | fvmptd 6752 | . 2 ⊢ (𝜑 → (𝐷‘𝐹) = (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵 ∖ 𝑠))))) |
15 | 1, 14 | syl5eq 2845 | 1 ⊢ (𝜑 → 𝐺 = (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵 ∖ 𝑠))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1538 ∈ wcel 2111 Vcvv 3441 ∖ cdif 3878 𝒫 cpw 4497 ↦ cmpt 5110 ‘cfv 6324 (class class class)co 7135 ↑m cmap 8389 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-ov 7138 |
This theorem is referenced by: dssmapfv3d 40720 |
Copyright terms: Public domain | W3C validator |