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 44785
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 44784 . . 3 (𝜑𝐷 = (𝑓 ∈ (𝒫 𝐵m 𝒫 𝐵) ↦ (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵𝑠))))))
6 fveq1 6887 . . . . . 6 (𝑓 = 𝐹 → (𝑓‘(𝐵𝑠)) = (𝐹‘(𝐵𝑠)))
76difeq2d 4084 . . . . 5 (𝑓 = 𝐹 → (𝐵 ∖ (𝑓‘(𝐵𝑠))) = (𝐵 ∖ (𝐹‘(𝐵𝑠))))
87mpteq2dv 5210 . . . 4 (𝑓 = 𝐹 → (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵𝑠)))) = (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵𝑠)))))
98adantl 487 . . 3 ((𝜑𝑓 = 𝐹) → (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵𝑠)))) = (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵𝑠)))))
10 dssmapfv2d.f . . 3 (𝜑𝐹 ∈ (𝒫 𝐵m 𝒫 𝐵))
11 pwexg 5354 . . . 4 (𝐵𝑉 → 𝒫 𝐵 ∈ V)
12 mptexg 7226 . . . 4 (𝒫 𝐵 ∈ V → (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵𝑠)))) ∈ V)
134, 11, 123syl 19 . . 3 (𝜑 → (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵𝑠)))) ∈ V)
145, 9, 10, 13fvmptd 7004 . 2 (𝜑 → (𝐷𝐹) = (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵𝑠)))))
151, 14eqtrid 2813 1 (𝜑𝐺 = (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵𝑠)))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4   = wceq 1570  wcel 2146  Vcvv 3458  cdif 3905  𝒫 cpw 4567  cmpt 5197  cfv 6543  (class class class)co 7423  m cmap 8833
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409
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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7426
This theorem is used by:  dssmapfv3d  44786
  Copyright terms: Public domain W3C validator