| Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > clsneibex | Structured version Visualization version GIF version | ||
| Description: If (pseudo-)closure and (pseudo-)neighborhood functions are related by the composite operator, 𝐻, then the base set exists. (Contributed by RP, 4-Jun-2021.) |
| Ref | Expression |
|---|---|
| clsneibex.d | ⊢ 𝐷 = (𝑃‘𝐵) |
| clsneibex.h | ⊢ 𝐻 = (𝐹 ∘ 𝐷) |
| clsneibex.r | ⊢ (𝜑 → 𝐾𝐻𝑁) |
| Ref | Expression |
|---|---|
| clsneibex | ⊢ (𝜑 → 𝐵 ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | clsneibex.h | . . . . 5 ⊢ 𝐻 = (𝐹 ∘ 𝐷) | |
| 2 | clsneibex.d | . . . . . 6 ⊢ 𝐷 = (𝑃‘𝐵) | |
| 3 | 2 | coeq2i 5844 | . . . . 5 ⊢ (𝐹 ∘ 𝐷) = (𝐹 ∘ (𝑃‘𝐵)) |
| 4 | 1, 3 | eqtri 2785 | . . . 4 ⊢ 𝐻 = (𝐹 ∘ (𝑃‘𝐵)) |
| 5 | 4 | a1i 11 | . . 3 ⊢ (𝜑 → 𝐻 = (𝐹 ∘ (𝑃‘𝐵))) |
| 6 | clsneibex.r | . . 3 ⊢ (𝜑 → 𝐾𝐻𝑁) | |
| 7 | 5, 6 | breqdi 5122 | . 2 ⊢ (𝜑 → 𝐾(𝐹 ∘ (𝑃‘𝐵))𝑁) |
| 8 | brne0 5159 | . 2 ⊢ (𝐾(𝐹 ∘ (𝑃‘𝐵))𝑁 → (𝐹 ∘ (𝑃‘𝐵)) ≠ ∅) | |
| 9 | fvprc 6874 | . . . . . . . 8 ⊢ (¬ 𝐵 ∈ V → (𝑃‘𝐵) = ∅) | |
| 10 | 9 | rneqd 5926 | . . . . . . 7 ⊢ (¬ 𝐵 ∈ V → ran (𝑃‘𝐵) = ran ∅) |
| 11 | rn0 5914 | . . . . . . 7 ⊢ ran ∅ = ∅ | |
| 12 | 10, 11 | eqtrdi 2813 | . . . . . 6 ⊢ (¬ 𝐵 ∈ V → ran (𝑃‘𝐵) = ∅) |
| 13 | 12 | ineq2d 4169 | . . . . 5 ⊢ (¬ 𝐵 ∈ V → (dom 𝐹 ∩ ran (𝑃‘𝐵)) = (dom 𝐹 ∩ ∅)) |
| 14 | in0 4348 | . . . . 5 ⊢ (dom 𝐹 ∩ ∅) = ∅ | |
| 15 | 13, 14 | eqtrdi 2813 | . . . 4 ⊢ (¬ 𝐵 ∈ V → (dom 𝐹 ∩ ran (𝑃‘𝐵)) = ∅) |
| 16 | 15 | coemptyd 15056 | . . 3 ⊢ (¬ 𝐵 ∈ V → (𝐹 ∘ (𝑃‘𝐵)) = ∅) |
| 17 | 16 | necon1ai 2984 | . 2 ⊢ ((𝐹 ∘ (𝑃‘𝐵)) ≠ ∅ → 𝐵 ∈ V) |
| 18 | 7, 8, 17 | 3syl 19 | 1 ⊢ (𝜑 → 𝐵 ∈ V) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 = wceq 1570 ∈ wcel 2145 ≠ wne 2957 Vcvv 3453 ∩ cin 3901 ∅c0 4282 class class class wbr 5107 dom cdm 5659 ran crn 5660 ∘ ccom 5663 ‘cfv 6537 |
| 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-ext 2734 ax-sep 5255 ax-nul 5267 ax-pr 5402 |
| 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-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-iota 6493 df-fv 6545 |
| This theorem is used by: clsneircomplex 44951 clsneif1o 44952 clsneicnv 44953 clsneikex 44954 clsneinex 44955 clsneiel1 44956 |
| Copyright terms: Public domain | W3C validator |