Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dssmapfv2d Structured version   Visualization version   GIF version

Theorem dssmapfv2d 44866
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.)
Hypotheses
Ref Expression
dssmapfvd.o 𝑂 = (𝑏 ∈ V ↦ (𝑓 ∈ (𝒫 𝑏m 𝒫 𝑏) ↦ (𝑠 ∈ 𝒫 𝑏 ↦ (𝑏 ∖ (𝑓‘(𝑏𝑠))))))
dssmapfvd.d 𝐷 = (𝑂𝐵)
dssmapfvd.b (𝜑𝐵𝑉)
dssmapfv2d.f (𝜑𝐹 ∈ (𝒫 𝐵m 𝒫 𝐵))
dssmapfv2d.g 𝐺 = (𝐷𝐹)
Assertion
Ref Expression
dssmapfv2d (𝜑𝐺 = (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵𝑠)))))
Distinct variable groups:   𝐵,𝑏,𝑓,𝑠   𝑓,𝐹,𝑠   𝜑,𝑏,𝑓
Allowed substitution hints:   𝜑(𝑠)   𝐷(𝑓, 𝑠, 𝑏)   𝐹(𝑏)   𝐺(𝑓, 𝑠, 𝑏)   𝑂(𝑓, 𝑠, 𝑏)   𝑉(𝑓, 𝑠, 𝑏)

Proof of Theorem dssmapfv2d
StepHypRef Expression
1 dssmapfv2d.g . 2 𝐺 = (𝐷𝐹)
2 dssmapfvd.o . . . 4 𝑂 = (𝑏 ∈ V ↦ (𝑓 ∈ (𝒫 𝑏m 𝒫 𝑏) ↦ (𝑠 ∈ 𝒫 𝑏 ↦ (𝑏 ∖ (𝑓‘(𝑏𝑠))))))
3 dssmapfvd.d . . . 4 𝐷 = (𝑂𝐵)
4 dssmapfvd.b . . . 4 (𝜑𝐵𝑉)
52, 3, 4dssmapfvd 44865 . . 3 (𝜑𝐷 = (𝑓 ∈ (𝒫 𝐵m 𝒫 𝐵) ↦ (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵𝑠))))))
6 fveq1 6881 . . . . . 6 (𝑓 = 𝐹 → (𝑓‘(𝐵𝑠)) = (𝐹‘(𝐵𝑠)))
76difeq2d 4077 . . . . 5 (𝑓 = 𝐹 → (𝐵 ∖ (𝑓‘(𝐵𝑠))) = (𝐵 ∖ (𝐹‘(𝐵𝑠))))
87mpteq2dv 5203 . . . 4 (𝑓 = 𝐹 → (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵𝑠)))) = (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵𝑠)))))
98adantl 487 . . 3 ((𝜑𝑓 = 𝐹) → (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵𝑠)))) = (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵𝑠)))))
10 dssmapfv2d.f . . 3 (𝜑𝐹 ∈ (𝒫 𝐵m 𝒫 𝐵))
11 pwexg 5347 . . . 4 (𝐵𝑉 → 𝒫 𝐵 ∈ V)
12 mptexg 7224 . . . 4 (𝒫 𝐵 ∈ V → (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵𝑠)))) ∈ V)
134, 11, 123syl 19 . . 3 (𝜑 → (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵𝑠)))) ∈ V)
145, 9, 10, 13fvmptd 6998 . 2 (𝜑 → (𝐷𝐹) = (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵𝑠)))))
151, 14eqtrid 2809 1 (𝜑𝐺 = (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵𝑠)))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4   = wceq 1570  wcel 2145  Vcvv 3453  cdif 3899  𝒫 cpw 4560  cmpt 5190  cfv 6537  (class class class)co 7417  m cmap 8830
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7420
This theorem is used by:  dssmapfv3d  44867
  Copyright terms: Public domain W3C validator