![]() |
Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > ntrneifv4 | Structured version Visualization version GIF version |
Description: The value of the interior (closure) expressed in terms of the neighbors (convergents) function. (Contributed by RP, 26-Jun-2021.) |
Ref | Expression |
---|---|
ntrnei.o | ⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)}))) |
ntrnei.f | ⊢ 𝐹 = (𝒫 𝐵𝑂𝐵) |
ntrnei.r | ⊢ (𝜑 → 𝐼𝐹𝑁) |
ntrneifv.s | ⊢ (𝜑 → 𝑆 ∈ 𝒫 𝐵) |
Ref | Expression |
---|---|
ntrneifv4 | ⊢ (𝜑 → (𝐼‘𝑆) = {𝑥 ∈ 𝐵 ∣ 𝑆 ∈ (𝑁‘𝑥)}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfin5 3889 | . 2 ⊢ (𝐵 ∩ (𝐼‘𝑆)) = {𝑥 ∈ 𝐵 ∣ 𝑥 ∈ (𝐼‘𝑆)} | |
2 | ntrnei.o | . . . . . . 7 ⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)}))) | |
3 | ntrnei.f | . . . . . . 7 ⊢ 𝐹 = (𝒫 𝐵𝑂𝐵) | |
4 | ntrnei.r | . . . . . . 7 ⊢ (𝜑 → 𝐼𝐹𝑁) | |
5 | 2, 3, 4 | ntrneiiex 40779 | . . . . . 6 ⊢ (𝜑 → 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)) |
6 | elmapi 8411 | . . . . . 6 ⊢ (𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵) → 𝐼:𝒫 𝐵⟶𝒫 𝐵) | |
7 | 5, 6 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝐼:𝒫 𝐵⟶𝒫 𝐵) |
8 | ntrneifv.s | . . . . 5 ⊢ (𝜑 → 𝑆 ∈ 𝒫 𝐵) | |
9 | 7, 8 | ffvelrnd 6829 | . . . 4 ⊢ (𝜑 → (𝐼‘𝑆) ∈ 𝒫 𝐵) |
10 | 9 | elpwid 4508 | . . 3 ⊢ (𝜑 → (𝐼‘𝑆) ⊆ 𝐵) |
11 | sseqin2 4142 | . . 3 ⊢ ((𝐼‘𝑆) ⊆ 𝐵 ↔ (𝐵 ∩ (𝐼‘𝑆)) = (𝐼‘𝑆)) | |
12 | 10, 11 | sylib 221 | . 2 ⊢ (𝜑 → (𝐵 ∩ (𝐼‘𝑆)) = (𝐼‘𝑆)) |
13 | 4 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝐼𝐹𝑁) |
14 | simpr 488 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵) | |
15 | 8 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑆 ∈ 𝒫 𝐵) |
16 | 2, 3, 13, 14, 15 | ntrneiel 40784 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥 ∈ (𝐼‘𝑆) ↔ 𝑆 ∈ (𝑁‘𝑥))) |
17 | 16 | rabbidva 3425 | . 2 ⊢ (𝜑 → {𝑥 ∈ 𝐵 ∣ 𝑥 ∈ (𝐼‘𝑆)} = {𝑥 ∈ 𝐵 ∣ 𝑆 ∈ (𝑁‘𝑥)}) |
18 | 1, 12, 17 | 3eqtr3a 2857 | 1 ⊢ (𝜑 → (𝐼‘𝑆) = {𝑥 ∈ 𝐵 ∣ 𝑆 ∈ (𝑁‘𝑥)}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 {crab 3110 Vcvv 3441 ∩ cin 3880 ⊆ wss 3881 𝒫 cpw 4497 class class class wbr 5030 ↦ cmpt 5110 ⟶wf 6320 ‘cfv 6324 (class class class)co 7135 ∈ cmpo 7137 ↑m cmap 8389 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-ov 7138 df-oprab 7139 df-mpo 7140 df-1st 7671 df-2nd 7672 df-map 8391 |
This theorem is referenced by: ntrneiel2 40789 |
Copyright terms: Public domain | W3C validator |