| 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 ↦ (𝑓 ∈ (𝒫 𝑏 ↑m 𝒫 𝑏) ↦ (𝑠 ∈ 𝒫 𝑏 ↦ (𝑏 ∖ (𝑓‘(𝑏 ∖ 𝑠)))))) |
| dssmapfvd.d | ⊢ 𝐷 = (𝑂‘𝐵) |
| dssmapfvd.b | ⊢ (𝜑 → 𝐵 ∈ 𝑉) |
| Ref | Expression |
|---|---|
| dssmapf1od | ⊢ (𝜑 → 𝐷:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝐵 ↑m 𝒫 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dssmapfvd.o | . . . 4 ⊢ 𝑂 = (𝑏 ∈ V ↦ (𝑓 ∈ (𝒫 𝑏 ↑m 𝒫 𝑏) ↦ (𝑠 ∈ 𝒫 𝑏 ↦ (𝑏 ∖ (𝑓‘(𝑏 ∖ 𝑠)))))) | |
| 2 | dssmapfvd.d | . . . 4 ⊢ 𝐷 = (𝑂‘𝐵) | |
| 3 | dssmapfvd.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑉) | |
| 4 | 1, 2, 3 | dssmapfvd 43988 | . . 3 ⊢ (𝜑 → 𝐷 = (𝑓 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵) ↦ (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠)))))) |
| 5 | 3 | pwexd 5349 | . . . . . 6 ⊢ (𝜑 → 𝒫 𝐵 ∈ V) |
| 6 | 5 | mptexd 7215 | . . . . 5 ⊢ (𝜑 → (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠)))) ∈ V) |
| 7 | 6 | ralrimivw 3136 | . . . 4 ⊢ (𝜑 → ∀𝑓 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)(𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠)))) ∈ V) |
| 8 | nfcv 2898 | . . . . 5 ⊢ Ⅎ𝑓(𝒫 𝐵 ↑m 𝒫 𝐵) | |
| 9 | 8 | fnmptf 6673 | . . . 4 ⊢ (∀𝑓 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)(𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠)))) ∈ V → (𝑓 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵) ↦ (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠))))) Fn (𝒫 𝐵 ↑m 𝒫 𝐵)) |
| 10 | 7, 9 | syl 17 | . . 3 ⊢ (𝜑 → (𝑓 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵) ↦ (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠))))) Fn (𝒫 𝐵 ↑m 𝒫 𝐵)) |
| 11 | fneq1 6628 | . . . 4 ⊢ (𝐷 = (𝑓 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵) ↦ (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠))))) → (𝐷 Fn (𝒫 𝐵 ↑m 𝒫 𝐵) ↔ (𝑓 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵) ↦ (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠))))) Fn (𝒫 𝐵 ↑m 𝒫 𝐵))) | |
| 12 | 11 | biimprd 248 | . . 3 ⊢ (𝐷 = (𝑓 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵) ↦ (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠))))) → ((𝑓 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵) ↦ (𝑠 ∈ 𝒫 𝐵 ↦ (𝐵 ∖ (𝑓‘(𝐵 ∖ 𝑠))))) Fn (𝒫 𝐵 ↑m 𝒫 𝐵) → 𝐷 Fn (𝒫 𝐵 ↑m 𝒫 𝐵))) |
| 13 | 4, 10, 12 | sylc 65 | . 2 ⊢ (𝜑 → 𝐷 Fn (𝒫 𝐵 ↑m 𝒫 𝐵)) |
| 14 | 1, 2, 3 | dssmapnvod 43991 | . 2 ⊢ (𝜑 → ◡𝐷 = 𝐷) |
| 15 | nvof1o 7272 | . 2 ⊢ ((𝐷 Fn (𝒫 𝐵 ↑m 𝒫 𝐵) ∧ ◡𝐷 = 𝐷) → 𝐷:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝐵 ↑m 𝒫 𝐵)) | |
| 16 | 13, 14, 15 | syl2anc 584 | 1 ⊢ (𝜑 → 𝐷:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝐵 ↑m 𝒫 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2108 ∀wral 3051 Vcvv 3459 ∖ cdif 3923 𝒫 cpw 4575 ↦ cmpt 5201 ◡ccnv 5653 Fn wfn 6525 –1-1-onto→wf1o 6529 ‘cfv 6530 (class class class)co 7403 ↑m cmap 8838 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-rep 5249 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7727 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-reu 3360 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-iun 4969 df-br 5120 df-opab 5182 df-mpt 5202 df-id 5548 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-iota 6483 df-fun 6532 df-fn 6533 df-f 6534 df-f1 6535 df-fo 6536 df-f1o 6537 df-fv 6538 df-ov 7406 df-oprab 7407 df-mpo 7408 df-1st 7986 df-2nd 7987 df-map 8840 |
| This theorem is referenced by: dssmap2d 43993 ntrclsf1o 44022 clsneif1o 44075 clsneikex 44077 clsneinex 44078 clsneiel1 44079 neicvgf1o 44085 neicvgmex 44088 neicvgel1 44090 dssmapntrcls 44099 dssmapclsntr 44100 |
| Copyright terms: Public domain | W3C validator |