Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > neicvgfv | Structured version Visualization version GIF version |
Description: The value of the neighborhoods (convergents) in terms of the the convergents (neighborhoods) function. (Contributed by RP, 27-Jun-2021.) |
Ref | Expression |
---|---|
neicvg.o | ⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)}))) |
neicvg.p | ⊢ 𝑃 = (𝑛 ∈ V ↦ (𝑝 ∈ (𝒫 𝑛 ↑m 𝒫 𝑛) ↦ (𝑜 ∈ 𝒫 𝑛 ↦ (𝑛 ∖ (𝑝‘(𝑛 ∖ 𝑜)))))) |
neicvg.d | ⊢ 𝐷 = (𝑃‘𝐵) |
neicvg.f | ⊢ 𝐹 = (𝒫 𝐵𝑂𝐵) |
neicvg.g | ⊢ 𝐺 = (𝐵𝑂𝒫 𝐵) |
neicvg.h | ⊢ 𝐻 = (𝐹 ∘ (𝐷 ∘ 𝐺)) |
neicvg.r | ⊢ (𝜑 → 𝑁𝐻𝑀) |
neicvgfv.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
Ref | Expression |
---|---|
neicvgfv | ⊢ (𝜑 → (𝑁‘𝑋) = {𝑠 ∈ 𝒫 𝐵 ∣ ¬ (𝐵 ∖ 𝑠) ∈ (𝑀‘𝑋)}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfin5 3943 | . 2 ⊢ (𝒫 𝐵 ∩ (𝑁‘𝑋)) = {𝑠 ∈ 𝒫 𝐵 ∣ 𝑠 ∈ (𝑁‘𝑋)} | |
2 | neicvg.o | . . . . . . 7 ⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)}))) | |
3 | neicvg.p | . . . . . . 7 ⊢ 𝑃 = (𝑛 ∈ V ↦ (𝑝 ∈ (𝒫 𝑛 ↑m 𝒫 𝑛) ↦ (𝑜 ∈ 𝒫 𝑛 ↦ (𝑛 ∖ (𝑝‘(𝑛 ∖ 𝑜)))))) | |
4 | neicvg.d | . . . . . . 7 ⊢ 𝐷 = (𝑃‘𝐵) | |
5 | neicvg.f | . . . . . . 7 ⊢ 𝐹 = (𝒫 𝐵𝑂𝐵) | |
6 | neicvg.g | . . . . . . 7 ⊢ 𝐺 = (𝐵𝑂𝒫 𝐵) | |
7 | neicvg.h | . . . . . . 7 ⊢ 𝐻 = (𝐹 ∘ (𝐷 ∘ 𝐺)) | |
8 | neicvg.r | . . . . . . 7 ⊢ (𝜑 → 𝑁𝐻𝑀) | |
9 | 2, 3, 4, 5, 6, 7, 8 | neicvgnex 40466 | . . . . . 6 ⊢ (𝜑 → 𝑁 ∈ (𝒫 𝒫 𝐵 ↑m 𝐵)) |
10 | elmapi 8427 | . . . . . 6 ⊢ (𝑁 ∈ (𝒫 𝒫 𝐵 ↑m 𝐵) → 𝑁:𝐵⟶𝒫 𝒫 𝐵) | |
11 | 9, 10 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝑁:𝐵⟶𝒫 𝒫 𝐵) |
12 | neicvgfv.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
13 | 11, 12 | ffvelrnd 6851 | . . . 4 ⊢ (𝜑 → (𝑁‘𝑋) ∈ 𝒫 𝒫 𝐵) |
14 | 13 | elpwid 4549 | . . 3 ⊢ (𝜑 → (𝑁‘𝑋) ⊆ 𝒫 𝐵) |
15 | sseqin2 4191 | . . 3 ⊢ ((𝑁‘𝑋) ⊆ 𝒫 𝐵 ↔ (𝒫 𝐵 ∩ (𝑁‘𝑋)) = (𝑁‘𝑋)) | |
16 | 14, 15 | sylib 220 | . 2 ⊢ (𝜑 → (𝒫 𝐵 ∩ (𝑁‘𝑋)) = (𝑁‘𝑋)) |
17 | 8 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → 𝑁𝐻𝑀) |
18 | 12 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → 𝑋 ∈ 𝐵) |
19 | simpr 487 | . . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → 𝑠 ∈ 𝒫 𝐵) | |
20 | 2, 3, 4, 5, 6, 7, 17, 18, 19 | neicvgel1 40467 | . . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝑠 ∈ (𝑁‘𝑋) ↔ ¬ (𝐵 ∖ 𝑠) ∈ (𝑀‘𝑋))) |
21 | 20 | rabbidva 3478 | . 2 ⊢ (𝜑 → {𝑠 ∈ 𝒫 𝐵 ∣ 𝑠 ∈ (𝑁‘𝑋)} = {𝑠 ∈ 𝒫 𝐵 ∣ ¬ (𝐵 ∖ 𝑠) ∈ (𝑀‘𝑋)}) |
22 | 1, 16, 21 | 3eqtr3a 2880 | 1 ⊢ (𝜑 → (𝑁‘𝑋) = {𝑠 ∈ 𝒫 𝐵 ∣ ¬ (𝐵 ∖ 𝑠) ∈ (𝑀‘𝑋)}) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 = wceq 1533 ∈ wcel 2110 {crab 3142 Vcvv 3494 ∖ cdif 3932 ∩ cin 3934 ⊆ wss 3935 𝒫 cpw 4538 class class class wbr 5065 ↦ cmpt 5145 ∘ ccom 5558 ⟶wf 6350 ‘cfv 6354 (class class class)co 7155 ∈ cmpo 7157 ↑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: (None) |
Copyright terms: Public domain | W3C validator |