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

Theorem dssmapf1od 40365
 Description: For any base set 𝐵 the duality operator for self-mappings of subsets of that base set is one-to-one and onto. (Contributed by RP, 21-Apr-2021.)
Hypotheses
Ref Expression
dssmapfvd.o 𝑂 = (𝑏 ∈ V ↦ (𝑓 ∈ (𝒫 𝑏m 𝒫 𝑏) ↦ (𝑠 ∈ 𝒫 𝑏 ↦ (𝑏 ∖ (𝑓‘(𝑏𝑠))))))
dssmapfvd.d 𝐷 = (𝑂𝐵)
dssmapfvd.b (𝜑𝐵𝑉)
Assertion
Ref Expression
dssmapf1od (𝜑𝐷:(𝒫 𝐵m 𝒫 𝐵)–1-1-onto→(𝒫 𝐵m 𝒫 𝐵))
Distinct variable groups:   𝐵,𝑏,𝑓,𝑠   𝜑,𝑏,𝑓,𝑠
Allowed substitution hints:   𝐷(𝑓,𝑠,𝑏)   𝑂(𝑓,𝑠,𝑏)   𝑉(𝑓,𝑠,𝑏)

Proof of Theorem dssmapf1od
StepHypRef Expression
1 dssmapfvd.o . . . 4 𝑂 = (𝑏 ∈ V ↦ (𝑓 ∈ (𝒫 𝑏m 𝒫 𝑏) ↦ (𝑠 ∈ 𝒫 𝑏 ↦ (𝑏 ∖ (𝑓‘(𝑏𝑠))))))
2 dssmapfvd.d . . . 4 𝐷 = (𝑂𝐵)
3 dssmapfvd.b . . . 4 (𝜑𝐵𝑉)
41, 2, 3dssmapfvd 40361 . . 3 (𝜑𝐷 = (𝑓 ∈ (𝒫 𝐵m 𝒫 𝐵) ↦ (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵𝑠))))))
53pwexd 5279 . . . . . 6 (𝜑 → 𝒫 𝐵 ∈ V)
65mptexd 6986 . . . . 5 (𝜑 → (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵𝑠)))) ∈ V)
76ralrimivw 3183 . . . 4 (𝜑 → ∀𝑓 ∈ (𝒫 𝐵m 𝒫 𝐵)(𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵𝑠)))) ∈ V)
8 nfcv 2977 . . . . 5 𝑓(𝒫 𝐵m 𝒫 𝐵)
98fnmptf 6483 . . . 4 (∀𝑓 ∈ (𝒫 𝐵m 𝒫 𝐵)(𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵𝑠)))) ∈ V → (𝑓 ∈ (𝒫 𝐵m 𝒫 𝐵) ↦ (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵𝑠))))) Fn (𝒫 𝐵m 𝒫 𝐵))
107, 9syl 17 . . 3 (𝜑 → (𝑓 ∈ (𝒫 𝐵m 𝒫 𝐵) ↦ (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵𝑠))))) Fn (𝒫 𝐵m 𝒫 𝐵))
11 fneq1 6443 . . . 4 (𝐷 = (𝑓 ∈ (𝒫 𝐵m 𝒫 𝐵) ↦ (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵𝑠))))) → (𝐷 Fn (𝒫 𝐵m 𝒫 𝐵) ↔ (𝑓 ∈ (𝒫 𝐵m 𝒫 𝐵) ↦ (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵𝑠))))) Fn (𝒫 𝐵m 𝒫 𝐵)))
1211biimprd 250 . . 3 (𝐷 = (𝑓 ∈ (𝒫 𝐵m 𝒫 𝐵) ↦ (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵𝑠))))) → ((𝑓 ∈ (𝒫 𝐵m 𝒫 𝐵) ↦ (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵𝑠))))) Fn (𝒫 𝐵m 𝒫 𝐵) → 𝐷 Fn (𝒫 𝐵m 𝒫 𝐵)))
134, 10, 12sylc 65 . 2 (𝜑𝐷 Fn (𝒫 𝐵m 𝒫 𝐵))
141, 2, 3dssmapnvod 40364 . 2 (𝜑𝐷 = 𝐷)
15 nvof1o 7036 . 2 ((𝐷 Fn (𝒫 𝐵m 𝒫 𝐵) ∧ 𝐷 = 𝐷) → 𝐷:(𝒫 𝐵m 𝒫 𝐵)–1-1-onto→(𝒫 𝐵m 𝒫 𝐵))
1613, 14, 15syl2anc 586 1 (𝜑𝐷:(𝒫 𝐵m 𝒫 𝐵)–1-1-onto→(𝒫 𝐵m 𝒫 𝐵))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   = wceq 1533   ∈ wcel 2110  ∀wral 3138  Vcvv 3494   ∖ cdif 3932  𝒫 cpw 4538   ↦ cmpt 5145  ◡ccnv 5553   Fn wfn 6349  –1-1-onto→wf1o 6353  ‘cfv 6354  (class class class)co 7155   ↑m cmap 8405 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-rep 5189  ax-sep 5202  ax-nul 5209  ax-pow 5265  ax-pr 5329  ax-un 7460 This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4567  df-pr 4569  df-op 4573  df-uni 4838  df-iun 4920  df-br 5066  df-opab 5128  df-mpt 5146  df-id 5459  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-res 5566  df-ima 5567  df-iota 6313  df-fun 6356  df-fn 6357  df-f 6358  df-f1 6359  df-fo 6360  df-f1o 6361  df-fv 6362  df-ov 7158  df-oprab 7159  df-mpo 7160  df-1st 7688  df-2nd 7689  df-map 8407 This theorem is referenced by:  dssmap2d  40366  ntrclsf1o  40399  clsneif1o  40452  clsneikex  40454  clsneinex  40455  clsneiel1  40456  neicvgf1o  40462  neicvgmex  40465  neicvgel1  40467  dssmapntrcls  40476  dssmapclsntr  40477
 Copyright terms: Public domain W3C validator