| Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > ntrneifv1 | Structured version Visualization version GIF version | ||
| Description: If (pseudo-)interior and (pseudo-)neighborhood functions are related by the operator, 𝐹, then the function value of 𝐹 is the neighborhood function. (Contributed by RP, 29-May-2021.) |
| Ref | Expression |
|---|---|
| ntrnei.o | ⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)}))) |
| ntrnei.f | ⊢ 𝐹 = (𝒫 𝐵𝑂𝐵) |
| ntrnei.r | ⊢ (𝜑 → 𝐼𝐹𝑁) |
| Ref | Expression |
|---|---|
| ntrneifv1 | ⊢ (𝜑 → (𝐹‘𝐼) = 𝑁) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ntrnei.r | . 2 ⊢ (𝜑 → 𝐼𝐹𝑁) | |
| 2 | ntrnei.o | . . . . . 6 ⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)}))) | |
| 3 | ntrnei.f | . . . . . 6 ⊢ 𝐹 = (𝒫 𝐵𝑂𝐵) | |
| 4 | 2, 3, 1 | ntrneif1o 45074 | . . . . 5 ⊢ (𝜑 → 𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵)) |
| 5 | f1ofn 6825 | . . . . 5 ⊢ (𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵) → 𝐹 Fn (𝒫 𝐵 ↑m 𝒫 𝐵)) | |
| 6 | 4, 5 | syl 18 | . . . 4 ⊢ (𝜑 → 𝐹 Fn (𝒫 𝐵 ↑m 𝒫 𝐵)) |
| 7 | 2, 3, 1 | ntrneiiex 45075 | . . . 4 ⊢ (𝜑 → 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)) |
| 8 | 6, 7 | jca 521 | . . 3 ⊢ (𝜑 → (𝐹 Fn (𝒫 𝐵 ↑m 𝒫 𝐵) ∧ 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵))) |
| 9 | fnfun 6639 | . . . . 5 ⊢ (𝐹 Fn (𝒫 𝐵 ↑m 𝒫 𝐵) → Fun 𝐹) | |
| 10 | 9 | adantr 486 | . . . 4 ⊢ ((𝐹 Fn (𝒫 𝐵 ↑m 𝒫 𝐵) ∧ 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)) → Fun 𝐹) |
| 11 | fndm 6642 | . . . . . 6 ⊢ (𝐹 Fn (𝒫 𝐵 ↑m 𝒫 𝐵) → dom 𝐹 = (𝒫 𝐵 ↑m 𝒫 𝐵)) | |
| 12 | 11 | eleq2d 2847 | . . . . 5 ⊢ (𝐹 Fn (𝒫 𝐵 ↑m 𝒫 𝐵) → (𝐼 ∈ dom 𝐹 ↔ 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵))) |
| 13 | 12 | biimpar 483 | . . . 4 ⊢ ((𝐹 Fn (𝒫 𝐵 ↑m 𝒫 𝐵) ∧ 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)) → 𝐼 ∈ dom 𝐹) |
| 14 | 10, 13 | jca 521 | . . 3 ⊢ ((𝐹 Fn (𝒫 𝐵 ↑m 𝒫 𝐵) ∧ 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)) → (Fun 𝐹 ∧ 𝐼 ∈ dom 𝐹)) |
| 15 | funbrfvb 6938 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐼 ∈ dom 𝐹) → ((𝐹‘𝐼) = 𝑁 ↔ 𝐼𝐹𝑁)) | |
| 16 | 8, 14, 15 | 3syl 19 | . 2 ⊢ (𝜑 → ((𝐹‘𝐼) = 𝑁 ↔ 𝐼𝐹𝑁)) |
| 17 | 1, 16 | mpbird 260 | 1 ⊢ (𝜑 → (𝐹‘𝐼) = 𝑁) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 {crab 3413 Vcvv 3451 𝒫 cpw 4557 class class class wbr 5103 ↦ cmpt 5186 dom cdm 5651 Fun wfun 6532 Fn wfn 6533 –1-1-onto→wf1o 6537 ‘cfv 6538 (class class class)co 7420 ∈ cmpo 7422 ↑m cmap 8847 |
| 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 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 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 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-ov 7423 df-oprab 7424 df-mpo 7425 df-1st 8001 df-2nd 8002 df-map 8849 |
| This theorem is used by: ntrneiel 45080 |
| Copyright terms: Public domain | W3C validator |