![]() |
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 43071 | . . 3 ⊢ (𝜑 → 𝐷 = (𝑓 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵) ↦ (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠)))))) |
6 | fveq1 6890 | . . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑓‘(𝐵 ∖ 𝑠)) = (𝐹‘(𝐵 ∖ 𝑠))) | |
7 | 6 | difeq2d 4122 | . . . . 5 ⊢ (𝑓 = 𝐹 → (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠))) = (𝐵 ∖ (𝐹‘(𝐵 ∖ 𝑠)))) |
8 | 7 | mpteq2dv 5250 | . . . 4 ⊢ (𝑓 = 𝐹 → (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠)))) = (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵 ∖ 𝑠))))) |
9 | 8 | adantl 481 | . . 3 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠)))) = (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵 ∖ 𝑠))))) |
10 | dssmapfv2d.f | . . 3 ⊢ (𝜑 → 𝐹 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)) | |
11 | pwexg 5376 | . . . 4 ⊢ (𝐵 ∈ 𝑉 → 𝒫 𝐵 ∈ V) | |
12 | mptexg 7225 | . . . 4 ⊢ (𝒫 𝐵 ∈ V → (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵 ∖ 𝑠)))) ∈ V) | |
13 | 4, 11, 12 | 3syl 18 | . . 3 ⊢ (𝜑 → (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵 ∖ 𝑠)))) ∈ V) |
14 | 5, 9, 10, 13 | fvmptd 7005 | . 2 ⊢ (𝜑 → (𝐷‘𝐹) = (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵 ∖ 𝑠))))) |
15 | 1, 14 | eqtrid 2783 | 1 ⊢ (𝜑 → 𝐺 = (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵 ∖ 𝑠))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2105 Vcvv 3473 ∖ cdif 3945 𝒫 cpw 4602 ↦ cmpt 5231 ‘cfv 6543 (class class class)co 7412 ↑m cmap 8824 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2702 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 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 3475 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5574 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7415 |
This theorem is referenced by: dssmapfv3d 43073 |
Copyright terms: Public domain | W3C validator |