Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > dssmapf1od | Structured version Visualization version GIF version |
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.) |
Ref | Expression |
---|---|
dssmapfvd.o | ⊢ 𝑂 = (𝑏 ∈ V ↦ (𝑓 ∈ (𝒫 𝑏 ↑𝑚 𝒫 𝑏) ↦ (𝑠 ∈ 𝒫 𝑏 ↦ (𝑏 ∖ (𝑓‘(𝑏 ∖ 𝑠)))))) |
dssmapfvd.d | ⊢ 𝐷 = (𝑂‘𝐵) |
dssmapfvd.b | ⊢ (𝜑 → 𝐵 ∈ 𝑉) |
Ref | Expression |
---|---|
dssmapf1od | ⊢ (𝜑 → 𝐷:(𝒫 𝐵 ↑𝑚 𝒫 𝐵)–1-1-onto→(𝒫 𝐵 ↑𝑚 𝒫 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dssmapfvd.o | . . . 4 ⊢ 𝑂 = (𝑏 ∈ V ↦ (𝑓 ∈ (𝒫 𝑏 ↑𝑚 𝒫 𝑏) ↦ (𝑠 ∈ 𝒫 𝑏 ↦ (𝑏 ∖ (𝑓‘(𝑏 ∖ 𝑠)))))) | |
2 | dssmapfvd.d | . . . 4 ⊢ 𝐷 = (𝑂‘𝐵) | |
3 | dssmapfvd.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑉) | |
4 | 1, 2, 3 | dssmapfvd 37331 | . . 3 ⊢ (𝜑 → 𝐷 = (𝑓 ∈ (𝒫 𝐵 ↑𝑚 𝒫 𝐵) ↦ (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠)))))) |
5 | pwexg 4776 | . . . . . . 7 ⊢ (𝐵 ∈ 𝑉 → 𝒫 𝐵 ∈ V) | |
6 | 3, 5 | syl 17 | . . . . . 6 ⊢ (𝜑 → 𝒫 𝐵 ∈ V) |
7 | mptexg 6389 | . . . . . 6 ⊢ (𝒫 𝐵 ∈ V → (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠)))) ∈ V) | |
8 | 6, 7 | syl 17 | . . . . 5 ⊢ (𝜑 → (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠)))) ∈ V) |
9 | 8 | ralrimivw 2950 | . . . 4 ⊢ (𝜑 → ∀𝑓 ∈ (𝒫 𝐵 ↑𝑚 𝒫 𝐵)(𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠)))) ∈ V) |
10 | nfcv 2751 | . . . . 5 ⊢ Ⅎ𝑓(𝒫 𝐵 ↑𝑚 𝒫 𝐵) | |
11 | 10 | fnmptf 5929 | . . . 4 ⊢ (∀𝑓 ∈ (𝒫 𝐵 ↑𝑚 𝒫 𝐵)(𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠)))) ∈ V → (𝑓 ∈ (𝒫 𝐵 ↑𝑚 𝒫 𝐵) ↦ (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠))))) Fn (𝒫 𝐵 ↑𝑚 𝒫 𝐵)) |
12 | 9, 11 | syl 17 | . . 3 ⊢ (𝜑 → (𝑓 ∈ (𝒫 𝐵 ↑𝑚 𝒫 𝐵) ↦ (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠))))) Fn (𝒫 𝐵 ↑𝑚 𝒫 𝐵)) |
13 | fneq1 5893 | . . . 4 ⊢ (𝐷 = (𝑓 ∈ (𝒫 𝐵 ↑𝑚 𝒫 𝐵) ↦ (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠))))) → (𝐷 Fn (𝒫 𝐵 ↑𝑚 𝒫 𝐵) ↔ (𝑓 ∈ (𝒫 𝐵 ↑𝑚 𝒫 𝐵) ↦ (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠))))) Fn (𝒫 𝐵 ↑𝑚 𝒫 𝐵))) | |
14 | 13 | biimprd 237 | . . 3 ⊢ (𝐷 = (𝑓 ∈ (𝒫 𝐵 ↑𝑚 𝒫 𝐵) ↦ (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠))))) → ((𝑓 ∈ (𝒫 𝐵 ↑𝑚 𝒫 𝐵) ↦ (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠))))) Fn (𝒫 𝐵 ↑𝑚 𝒫 𝐵) → 𝐷 Fn (𝒫 𝐵 ↑𝑚 𝒫 𝐵))) |
15 | 4, 12, 14 | sylc 63 | . 2 ⊢ (𝜑 → 𝐷 Fn (𝒫 𝐵 ↑𝑚 𝒫 𝐵)) |
16 | 1, 2, 3 | dssmapnvod 37334 | . 2 ⊢ (𝜑 → ◡𝐷 = 𝐷) |
17 | nvof1o 6436 | . 2 ⊢ ((𝐷 Fn (𝒫 𝐵 ↑𝑚 𝒫 𝐵) ∧ ◡𝐷 = 𝐷) → 𝐷:(𝒫 𝐵 ↑𝑚 𝒫 𝐵)–1-1-onto→(𝒫 𝐵 ↑𝑚 𝒫 𝐵)) | |
18 | 15, 16, 17 | syl2anc 691 | 1 ⊢ (𝜑 → 𝐷:(𝒫 𝐵 ↑𝑚 𝒫 𝐵)–1-1-onto→(𝒫 𝐵 ↑𝑚 𝒫 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1475 ∈ wcel 1977 ∀wral 2896 Vcvv 3173 ∖ cdif 3537 𝒫 cpw 4108 ↦ cmpt 4643 ◡ccnv 5037 Fn wfn 5799 –1-1-onto→wf1o 5803 ‘cfv 5804 (class class class)co 6549 ↑𝑚 cmap 7744 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-1st 7059 df-2nd 7060 df-map 7746 |
This theorem is referenced by: dssmap2d 37336 ntrclsf1o 37369 clsneif1o 37422 clsneikex 37424 clsneinex 37425 clsneiel1 37426 neicvgf1o 37432 neicvgmex 37435 neicvgel1 37437 dssmapntrcls 37446 dssmapclsntr 37447 |
Copyright terms: Public domain | W3C validator |