Theorem ntrneifv3 44925

Description: The value of the neighbors (convergents) expressed in terms of the interior (closure) function. (Contributed by RP, 26-Jun-2021.)

Hypotheses

Ref	Expression
ntrnei.o	⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)})))
ntrnei.f	⊢ 𝐹 = (𝒫 𝐵𝑂𝐵)
ntrnei.r	⊢ (𝜑 → 𝐼𝐹𝑁)
ntrnei.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)

Assertion

Ref	Expression
ntrneifv3	⊢ (𝜑 → (𝑁‘𝑋) = {𝑠 ∈ 𝒫 𝐵 ∣ 𝑋 ∈ (𝐼‘𝑠)})

Distinct variable groups:   𝐵,𝑖,𝑗,𝑘,𝑙,𝑚,𝑠   𝑘,𝐼,𝑙,𝑚   𝑁,𝑠   𝑋,𝑙,𝑚,𝑠   𝜑,𝑖,𝑗,𝑘,𝑙,𝑠

Allowed substitution hints:   𝜑(𝑚)   𝐹(𝑖, 𝑗, 𝑘, 𝑚, 𝑠, 𝑙)   𝐼(𝑖, 𝑗, 𝑠)   𝑁(𝑖, 𝑗, 𝑘, 𝑚, 𝑙)   𝑂(𝑖, 𝑗, 𝑘, 𝑚, 𝑠, 𝑙)   𝑋(𝑖, 𝑗, 𝑘)

Proof of Theorem ntrneifv3

Step	Hyp	Ref	Expression
1		dfin5 3907	. 2 ⊢ (𝒫 𝐵 ∩ (𝑁‘𝑋)) = {𝑠 ∈ 𝒫 𝐵 ∣ 𝑠 ∈ (𝑁‘𝑋)}
2		ntrnei.o	. . . . . . 7 ⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)})))
3		ntrnei.f	. . . . . . 7 ⊢ 𝐹 = (𝒫 𝐵𝑂𝐵)
4		ntrnei.r	. . . . . . 7 ⊢ (𝜑 → 𝐼𝐹𝑁)
5	2, 3, 4	ntrneinex 44920	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ (𝒫 𝒫 𝐵 ↑m 𝐵))
6		elmapi 8851	. . . . . 6 ⊢ (𝑁 ∈ (𝒫 𝒫 𝐵 ↑m 𝐵) → 𝑁:𝐵⟶𝒫 𝒫 𝐵)
7	5, 6	syl 18	. . . . 5 ⊢ (𝜑 → 𝑁:𝐵⟶𝒫 𝒫 𝐵)
8		ntrnei.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
9	7, 8	ffvelcdmd 7079	. . . 4 ⊢ (𝜑 → (𝑁‘𝑋) ∈ 𝒫 𝒫 𝐵)
10	9	elpwid 4566	. . 3 ⊢ (𝜑 → (𝑁‘𝑋) ⊆ 𝒫 𝐵)
11		sseqin2 4169	. . 3 ⊢ ((𝑁‘𝑋) ⊆ 𝒫 𝐵 ↔ (𝒫 𝐵 ∩ (𝑁‘𝑋)) = (𝑁‘𝑋))
12	10, 11	sylib 221	. 2 ⊢ (𝜑 → (𝒫 𝐵 ∩ (𝑁‘𝑋)) = (𝑁‘𝑋))
13	4	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → 𝐼𝐹𝑁)
14	8	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → 𝑋 ∈ 𝐵)
15		simpr 490	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → 𝑠 ∈ 𝒫 𝐵)
16	2, 3, 13, 14, 15	ntrneiel 44924	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝑋 ∈ (𝐼‘𝑠) ↔ 𝑠 ∈ (𝑁‘𝑋)))
17	16	bicomd 226	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (𝑠 ∈ (𝑁‘𝑋) ↔ 𝑋 ∈ (𝐼‘𝑠)))
18	17	rabbidva 3418	. 2 ⊢ (𝜑 → {𝑠 ∈ 𝒫 𝐵 ∣ 𝑠 ∈ (𝑁‘𝑋)} = {𝑠 ∈ 𝒫 𝐵 ∣ 𝑋 ∈ (𝐼‘𝑠)})
19	1, 12, 18	3eqtr3a 2819	1 ⊢ (𝜑 → (𝑁‘𝑋) = {𝑠 ∈ 𝒫 𝐵 ∣ 𝑋 ∈ (𝐼‘𝑠)})

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {crab 3412  Vcvv 3450   ∩ cin 3898   ⊆ wss 3899  𝒫 cpw 4557   class class class wbr 5103   ↦ cmpt 5186  ⟶wf 6529  ‘cfv 6533  (class class class)co 7414   ∈ cmpo 7416   ↑_m cmap 8829

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7417  df-oprab 7418  df-mpo 7419  df-1st 7987  df-2nd 7988  df-map 8831

This theorem is used by: (None)