| Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > neicvgbex | Structured version Visualization version GIF version | ||
| Description: If (pseudo-)neighborhood and (pseudo-)convergent functions are related by the composite operator, 𝐻, then the base set exists. (Contributed by RP, 4-Jun-2021.) |
| Ref | Expression |
|---|---|
| neicvgbex.d | ⊢ 𝐷 = (𝑃‘𝐵) |
| neicvgbex.h | ⊢ 𝐻 = (𝐹 ∘ (𝐷 ∘ 𝐺)) |
| neicvgbex.r | ⊢ (𝜑 → 𝑁𝐻𝑀) |
| Ref | Expression |
|---|---|
| neicvgbex | ⊢ (𝜑 → 𝐵 ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | neicvgbex.h | . . . . 5 ⊢ 𝐻 = (𝐹 ∘ (𝐷 ∘ 𝐺)) | |
| 2 | neicvgbex.d | . . . . . . 7 ⊢ 𝐷 = (𝑃‘𝐵) | |
| 3 | 2 | coeq1i 5848 | . . . . . 6 ⊢ (𝐷 ∘ 𝐺) = ((𝑃‘𝐵) ∘ 𝐺) |
| 4 | 3 | coeq2i 5849 | . . . . 5 ⊢ (𝐹 ∘ (𝐷 ∘ 𝐺)) = (𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺)) |
| 5 | 1, 4 | eqtri 2786 | . . . 4 ⊢ 𝐻 = (𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺)) |
| 6 | 5 | a1i 11 | . . 3 ⊢ (𝜑 → 𝐻 = (𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺))) |
| 7 | neicvgbex.r | . . 3 ⊢ (𝜑 → 𝑁𝐻𝑀) | |
| 8 | 6, 7 | breqdi 5123 | . 2 ⊢ (𝜑 → 𝑁(𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺))𝑀) |
| 9 | brne0 5161 | . 2 ⊢ (𝑁(𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺))𝑀 → (𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺)) ≠ ∅) | |
| 10 | fvprc 6908 | . . . . . . . . . . . . 13 ⊢ (¬ 𝐵 ∈ V → (𝑃‘𝐵) = ∅) | |
| 11 | 10 | dmeqd 5899 | . . . . . . . . . . . 12 ⊢ (¬ 𝐵 ∈ V → dom (𝑃‘𝐵) = dom ∅) |
| 12 | dm0 5914 | . . . . . . . . . . . 12 ⊢ dom ∅ = ∅ | |
| 13 | 11, 12 | eqtrdi 2814 | . . . . . . . . . . 11 ⊢ (¬ 𝐵 ∈ V → dom (𝑃‘𝐵) = ∅) |
| 14 | 13 | ineq1d 4119 | . . . . . . . . . 10 ⊢ (¬ 𝐵 ∈ V → (dom (𝑃‘𝐵) ∩ ran 𝐺) = (∅ ∩ ran 𝐺)) |
| 15 | 0in 4350 | . . . . . . . . . 10 ⊢ (∅ ∩ ran 𝐺) = ∅ | |
| 16 | 14, 15 | eqtrdi 2814 | . . . . . . . . 9 ⊢ (¬ 𝐵 ∈ V → (dom (𝑃‘𝐵) ∩ ran 𝐺) = ∅) |
| 17 | 16 | coemptyd 15175 | . . . . . . . 8 ⊢ (¬ 𝐵 ∈ V → ((𝑃‘𝐵) ∘ 𝐺) = ∅) |
| 18 | 17 | rneqd 5932 | . . . . . . 7 ⊢ (¬ 𝐵 ∈ V → ran ((𝑃‘𝐵) ∘ 𝐺) = ran ∅) |
| 19 | rn0 5920 | . . . . . . 7 ⊢ ran ∅ = ∅ | |
| 20 | 18, 19 | eqtrdi 2814 | . . . . . 6 ⊢ (¬ 𝐵 ∈ V → ran ((𝑃‘𝐵) ∘ 𝐺) = ∅) |
| 21 | 20 | ineq2d 4120 | . . . . 5 ⊢ (¬ 𝐵 ∈ V → (dom 𝐹 ∩ ran ((𝑃‘𝐵) ∘ 𝐺)) = (dom 𝐹 ∩ ∅)) |
| 22 | in0 4348 | . . . . 5 ⊢ (dom 𝐹 ∩ ∅) = ∅ | |
| 23 | 21, 22 | eqtrdi 2814 | . . . 4 ⊢ (¬ 𝐵 ∈ V → (dom 𝐹 ∩ ran ((𝑃‘𝐵) ∘ 𝐺)) = ∅) |
| 24 | 23 | coemptyd 15175 | . . 3 ⊢ (¬ 𝐵 ∈ V → (𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺)) = ∅) |
| 25 | 24 | necon1ai 2986 | . 2 ⊢ ((𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺)) ≠ ∅ → 𝐵 ∈ V) |
| 26 | 8, 9, 25 | 3syl 19 | 1 ⊢ (𝜑 → 𝐵 ∈ V) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 Vcvv 3454 ∩ cin 4092 ∅c0 4281 class class class wbr 5108 dom cdm 5658 ran crn 5659 ∘ ccom 5662 ‘cfv 6566 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pr 5398 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-iota 6520 df-fv 6574 |
| This theorem is used by: neicvgrcomplex 45374 neicvgf1o 45375 neicvgnvo 45376 neicvgmex 45378 neicvgel1 45380 |
| Copyright terms: Public domain | W3C validator |