Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > clsneikex | Structured version Visualization version GIF version |
Description: If closure and neighborhoods functions are related, the closure function exists. (Contributed by RP, 27-Jun-2021.) |
Ref | Expression |
---|---|
clsnei.o | ⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑𝑚 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)}))) |
clsnei.p | ⊢ 𝑃 = (𝑛 ∈ V ↦ (𝑝 ∈ (𝒫 𝑛 ↑𝑚 𝒫 𝑛) ↦ (𝑜 ∈ 𝒫 𝑛 ↦ (𝑛 ∖ (𝑝‘(𝑛 ∖ 𝑜)))))) |
clsnei.d | ⊢ 𝐷 = (𝑃‘𝐵) |
clsnei.f | ⊢ 𝐹 = (𝒫 𝐵𝑂𝐵) |
clsnei.h | ⊢ 𝐻 = (𝐹 ∘ 𝐷) |
clsnei.r | ⊢ (𝜑 → 𝐾𝐻𝑁) |
Ref | Expression |
---|---|
clsneikex | ⊢ (𝜑 → 𝐾 ∈ (𝒫 𝐵 ↑𝑚 𝒫 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | clsnei.p | . 2 ⊢ 𝑃 = (𝑛 ∈ V ↦ (𝑝 ∈ (𝒫 𝑛 ↑𝑚 𝒫 𝑛) ↦ (𝑜 ∈ 𝒫 𝑛 ↦ (𝑛 ∖ (𝑝‘(𝑛 ∖ 𝑜)))))) | |
2 | clsnei.d | . 2 ⊢ 𝐷 = (𝑃‘𝐵) | |
3 | clsnei.h | . . . . 5 ⊢ 𝐻 = (𝐹 ∘ 𝐷) | |
4 | clsnei.r | . . . . 5 ⊢ (𝜑 → 𝐾𝐻𝑁) | |
5 | 2, 3, 4 | clsneibex 37420 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ V) |
6 | clsnei.o | . . . . . . 7 ⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑𝑚 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)}))) | |
7 | pwexg 4776 | . . . . . . . 8 ⊢ (𝐵 ∈ V → 𝒫 𝐵 ∈ V) | |
8 | 7 | adantl 481 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → 𝒫 𝐵 ∈ V) |
9 | simpr 476 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → 𝐵 ∈ V) | |
10 | clsnei.f | . . . . . . 7 ⊢ 𝐹 = (𝒫 𝐵𝑂𝐵) | |
11 | 6, 8, 9, 10 | fsovf1od 37330 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → 𝐹:(𝒫 𝐵 ↑𝑚 𝒫 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑𝑚 𝐵)) |
12 | f1ofn 6051 | . . . . . 6 ⊢ (𝐹:(𝒫 𝐵 ↑𝑚 𝒫 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑𝑚 𝐵) → 𝐹 Fn (𝒫 𝐵 ↑𝑚 𝒫 𝐵)) | |
13 | 11, 12 | syl 17 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → 𝐹 Fn (𝒫 𝐵 ↑𝑚 𝒫 𝐵)) |
14 | 1, 2, 9 | dssmapf1od 37335 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → 𝐷:(𝒫 𝐵 ↑𝑚 𝒫 𝐵)–1-1-onto→(𝒫 𝐵 ↑𝑚 𝒫 𝐵)) |
15 | f1of 6050 | . . . . . 6 ⊢ (𝐷:(𝒫 𝐵 ↑𝑚 𝒫 𝐵)–1-1-onto→(𝒫 𝐵 ↑𝑚 𝒫 𝐵) → 𝐷:(𝒫 𝐵 ↑𝑚 𝒫 𝐵)⟶(𝒫 𝐵 ↑𝑚 𝒫 𝐵)) | |
16 | 14, 15 | syl 17 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → 𝐷:(𝒫 𝐵 ↑𝑚 𝒫 𝐵)⟶(𝒫 𝐵 ↑𝑚 𝒫 𝐵)) |
17 | 4 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → 𝐾𝐻𝑁) |
18 | 3 | breqi 4589 | . . . . . 6 ⊢ (𝐾𝐻𝑁 ↔ 𝐾(𝐹 ∘ 𝐷)𝑁) |
19 | 17, 18 | sylib 207 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → 𝐾(𝐹 ∘ 𝐷)𝑁) |
20 | 13, 16, 19 | brcoffn 37348 | . . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ V) → (𝐾𝐷(𝐷‘𝐾) ∧ (𝐷‘𝐾)𝐹𝑁)) |
21 | 5, 20 | mpdan 699 | . . 3 ⊢ (𝜑 → (𝐾𝐷(𝐷‘𝐾) ∧ (𝐷‘𝐾)𝐹𝑁)) |
22 | 21 | simpld 474 | . 2 ⊢ (𝜑 → 𝐾𝐷(𝐷‘𝐾)) |
23 | 1, 2, 22 | ntrclsiex 37371 | 1 ⊢ (𝜑 → 𝐾 ∈ (𝒫 𝐵 ↑𝑚 𝒫 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1475 ∈ wcel 1977 {crab 2900 Vcvv 3173 ∖ cdif 3537 𝒫 cpw 4108 class class class wbr 4583 ↦ cmpt 4643 ∘ ccom 5042 Fn wfn 5799 ⟶wf 5800 –1-1-onto→wf1o 5803 ‘cfv 5804 (class class class)co 6549 ↦ cmpt2 6551 ↑𝑚 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: clsneifv4 37429 |
Copyright terms: Public domain | W3C validator |