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

Theorem dssmapfv3d 44859
Description: Value of the duality operator for self-mappings of subsets of a base set, 𝐵 when applied to function 𝐹 and subset 𝑆. (Contributed by RP, 19-Apr-2021.)
Hypotheses
Ref Expression
dssmapfvd.o 𝑂 = (𝑏 ∈ V ↦ (𝑓 ∈ (𝒫 𝑏m 𝒫 𝑏) ↦ (𝑠 ∈ 𝒫 𝑏 ↦ (𝑏 ∖ (𝑓‘(𝑏𝑠))))))
dssmapfvd.d 𝐷 = (𝑂𝐵)
dssmapfvd.b (𝜑𝐵𝑉)
dssmapfv2d.f (𝜑𝐹 ∈ (𝒫 𝐵m 𝒫 𝐵))
dssmapfv2d.g 𝐺 = (𝐷𝐹)
dssmapfv3d.s (𝜑𝑆 ∈ 𝒫 𝐵)
dssmapfv3d.t 𝑇 = (𝐺𝑆)
Assertion
Ref Expression
dssmapfv3d (𝜑𝑇 = (𝐵 ∖ (𝐹‘(𝐵𝑆))))
Distinct variable groups:   𝐵,𝑏,𝑓,𝑠   𝑓,𝐹,𝑠   𝑆,𝑠   𝜑,𝑏,𝑓,𝑠
Allowed substitution hints:   𝐷(𝑓, 𝑠, 𝑏)   𝑆(𝑓, 𝑏)   𝑇(𝑓, 𝑠, 𝑏)   𝐹(𝑏)   𝐺(𝑓, 𝑠, 𝑏)   𝑂(𝑓, 𝑠, 𝑏)   𝑉(𝑓, 𝑠, 𝑏)

Proof of Theorem dssmapfv3d
StepHypRef Expression
1 dssmapfv3d.t . 2 𝑇 = (𝐺𝑆)
2 dssmapfvd.o . . . 4 𝑂 = (𝑏 ∈ V ↦ (𝑓 ∈ (𝒫 𝑏m 𝒫 𝑏) ↦ (𝑠 ∈ 𝒫 𝑏 ↦ (𝑏 ∖ (𝑓‘(𝑏𝑠))))))
3 dssmapfvd.d . . . 4 𝐷 = (𝑂𝐵)
4 dssmapfvd.b . . . 4 (𝜑𝐵𝑉)
5 dssmapfv2d.f . . . 4 (𝜑𝐹 ∈ (𝒫 𝐵m 𝒫 𝐵))
6 dssmapfv2d.g . . . 4 𝐺 = (𝐷𝐹)
72, 3, 4, 5, 6dssmapfv2d 44858 . . 3 (𝜑𝐺 = (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝐹‘(𝐵𝑠)))))
8 difeq2 4068 . . . . . 6 (𝑠 = 𝑆 → (𝐵𝑠) = (𝐵𝑆))
98fveq2d 6882 . . . . 5 (𝑠 = 𝑆 → (𝐹‘(𝐵𝑠)) = (𝐹‘(𝐵𝑆)))
109difeq2d 4074 . . . 4 (𝑠 = 𝑆 → (𝐵 ∖ (𝐹‘(𝐵𝑠))) = (𝐵 ∖ (𝐹‘(𝐵𝑆))))
1110adantl 487 . . 3 ((𝜑𝑠 = 𝑆) → (𝐵 ∖ (𝐹‘(𝐵𝑠))) = (𝐵 ∖ (𝐹‘(𝐵𝑆))))
12 dssmapfv3d.s . . 3 (𝜑𝑆 ∈ 𝒫 𝐵)
134difexd 5296 . . 3 (𝜑 → (𝐵 ∖ (𝐹‘(𝐵𝑆))) ∈ V)
147, 11, 12, 13fvmptd 6994 . 2 (𝜑 → (𝐺𝑆) = (𝐵 ∖ (𝐹‘(𝐵𝑆))))
151, 14eqtrid 2807 1 (𝜑𝑇 = (𝐵 ∖ (𝐹‘(𝐵𝑆))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4   = wceq 1570  wcel 2145  Vcvv 3450  cdif 3896  𝒫 cpw 4557  cmpt 5186  cfv 6533  (class class class)co 7413  m cmap 8826
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 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398
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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7416
This theorem is used by:  ntrclselnel1  44897  ntrclsfv  44899  ntrclscls00  44906  ntrclsiso  44907  ntrclsk2  44908  ntrclskb  44909  ntrclsk3  44910  ntrclsk13  44911  dssmapntrcls  44968
  Copyright terms: Public domain W3C validator