Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ntrneifv3 Structured version   Visualization version   GIF version

Theorem ntrneifv3 42509
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
StepHypRef Expression
1 dfin5 3936 . 2 (𝒫 𝐡 ∩ (π‘β€˜π‘‹)) = {𝑠 ∈ 𝒫 𝐡 ∣ 𝑠 ∈ (π‘β€˜π‘‹)}
2 ntrnei.o . . . . . . 7 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (π‘˜ ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {π‘š ∈ 𝑖 ∣ 𝑙 ∈ (π‘˜β€˜π‘š)})))
3 ntrnei.f . . . . . . 7 𝐹 = (𝒫 𝐡𝑂𝐡)
4 ntrnei.r . . . . . . 7 (πœ‘ β†’ 𝐼𝐹𝑁)
52, 3, 4ntrneinex 42504 . . . . . 6 (πœ‘ β†’ 𝑁 ∈ (𝒫 𝒫 𝐡 ↑m 𝐡))
6 elmapi 8809 . . . . . 6 (𝑁 ∈ (𝒫 𝒫 𝐡 ↑m 𝐡) β†’ 𝑁:π΅βŸΆπ’« 𝒫 𝐡)
75, 6syl 17 . . . . 5 (πœ‘ β†’ 𝑁:π΅βŸΆπ’« 𝒫 𝐡)
8 ntrnei.x . . . . 5 (πœ‘ β†’ 𝑋 ∈ 𝐡)
97, 8ffvelcdmd 7056 . . . 4 (πœ‘ β†’ (π‘β€˜π‘‹) ∈ 𝒫 𝒫 𝐡)
109elpwid 4589 . . 3 (πœ‘ β†’ (π‘β€˜π‘‹) βŠ† 𝒫 𝐡)
11 sseqin2 4195 . . 3 ((π‘β€˜π‘‹) βŠ† 𝒫 𝐡 ↔ (𝒫 𝐡 ∩ (π‘β€˜π‘‹)) = (π‘β€˜π‘‹))
1210, 11sylib 217 . 2 (πœ‘ β†’ (𝒫 𝐡 ∩ (π‘β€˜π‘‹)) = (π‘β€˜π‘‹))
134adantr 481 . . . . 5 ((πœ‘ ∧ 𝑠 ∈ 𝒫 𝐡) β†’ 𝐼𝐹𝑁)
148adantr 481 . . . . 5 ((πœ‘ ∧ 𝑠 ∈ 𝒫 𝐡) β†’ 𝑋 ∈ 𝐡)
15 simpr 485 . . . . 5 ((πœ‘ ∧ 𝑠 ∈ 𝒫 𝐡) β†’ 𝑠 ∈ 𝒫 𝐡)
162, 3, 13, 14, 15ntrneiel 42508 . . . 4 ((πœ‘ ∧ 𝑠 ∈ 𝒫 𝐡) β†’ (𝑋 ∈ (πΌβ€˜π‘ ) ↔ 𝑠 ∈ (π‘β€˜π‘‹)))
1716bicomd 222 . . 3 ((πœ‘ ∧ 𝑠 ∈ 𝒫 𝐡) β†’ (𝑠 ∈ (π‘β€˜π‘‹) ↔ 𝑋 ∈ (πΌβ€˜π‘ )))
1817rabbidva 3425 . 2 (πœ‘ β†’ {𝑠 ∈ 𝒫 𝐡 ∣ 𝑠 ∈ (π‘β€˜π‘‹)} = {𝑠 ∈ 𝒫 𝐡 ∣ 𝑋 ∈ (πΌβ€˜π‘ )})
191, 12, 183eqtr3a 2795 1 (πœ‘ β†’ (π‘β€˜π‘‹) = {𝑠 ∈ 𝒫 𝐡 ∣ 𝑋 ∈ (πΌβ€˜π‘ )})
Colors of variables: wff setvar class
Syntax hints:   β†’ wi 4   ∧ wa 396   = wceq 1541   ∈ wcel 2106  {crab 3418  Vcvv 3459   ∩ cin 3927   βŠ† wss 3928  π’« cpw 4580   class class class wbr 5125   ↦ cmpt 5208  βŸΆwf 6512  β€˜cfv 6516  (class class class)co 7377   ∈ cmpo 7379   ↑m cmap 8787
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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2702  ax-rep 5262  ax-sep 5276  ax-nul 5283  ax-pow 5340  ax-pr 5404  ax-un 7692
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-reu 3365  df-rab 3419  df-v 3461  df-sbc 3758  df-csb 3874  df-dif 3931  df-un 3933  df-in 3935  df-ss 3945  df-nul 4303  df-if 4507  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4886  df-iun 4976  df-br 5126  df-opab 5188  df-mpt 5209  df-id 5551  df-xp 5659  df-rel 5660  df-cnv 5661  df-co 5662  df-dm 5663  df-rn 5664  df-res 5665  df-ima 5666  df-iota 6468  df-fun 6518  df-fn 6519  df-f 6520  df-f1 6521  df-fo 6522  df-f1o 6523  df-fv 6524  df-ov 7380  df-oprab 7381  df-mpo 7382  df-1st 7941  df-2nd 7942  df-map 8789
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator