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 5757 | . . . . . 6 ⊢ (𝐷 ∘ 𝐺) = ((𝑃‘𝐵) ∘ 𝐺) |
4 | 3 | coeq2i 5758 | . . . . 5 ⊢ (𝐹 ∘ (𝐷 ∘ 𝐺)) = (𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺)) |
5 | 1, 4 | eqtri 2766 | . . . 4 ⊢ 𝐻 = (𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺)) |
6 | 5 | a1i 11 | . . 3 ⊢ (𝜑 → 𝐻 = (𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺))) |
7 | neicvgbex.r | . . 3 ⊢ (𝜑 → 𝑁𝐻𝑀) | |
8 | 6, 7 | breqdi 5085 | . 2 ⊢ (𝜑 → 𝑁(𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺))𝑀) |
9 | brne0 5120 | . 2 ⊢ (𝑁(𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺))𝑀 → (𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺)) ≠ ∅) | |
10 | fvprc 6748 | . . . . . . . . . . . . 13 ⊢ (¬ 𝐵 ∈ V → (𝑃‘𝐵) = ∅) | |
11 | 10 | dmeqd 5803 | . . . . . . . . . . . 12 ⊢ (¬ 𝐵 ∈ V → dom (𝑃‘𝐵) = dom ∅) |
12 | dm0 5818 | . . . . . . . . . . . 12 ⊢ dom ∅ = ∅ | |
13 | 11, 12 | eqtrdi 2795 | . . . . . . . . . . 11 ⊢ (¬ 𝐵 ∈ V → dom (𝑃‘𝐵) = ∅) |
14 | 13 | ineq1d 4142 | . . . . . . . . . 10 ⊢ (¬ 𝐵 ∈ V → (dom (𝑃‘𝐵) ∩ ran 𝐺) = (∅ ∩ ran 𝐺)) |
15 | 0in 4324 | . . . . . . . . . 10 ⊢ (∅ ∩ ran 𝐺) = ∅ | |
16 | 14, 15 | eqtrdi 2795 | . . . . . . . . 9 ⊢ (¬ 𝐵 ∈ V → (dom (𝑃‘𝐵) ∩ ran 𝐺) = ∅) |
17 | 16 | coemptyd 14618 | . . . . . . . 8 ⊢ (¬ 𝐵 ∈ V → ((𝑃‘𝐵) ∘ 𝐺) = ∅) |
18 | 17 | rneqd 5836 | . . . . . . 7 ⊢ (¬ 𝐵 ∈ V → ran ((𝑃‘𝐵) ∘ 𝐺) = ran ∅) |
19 | rn0 5824 | . . . . . . 7 ⊢ ran ∅ = ∅ | |
20 | 18, 19 | eqtrdi 2795 | . . . . . 6 ⊢ (¬ 𝐵 ∈ V → ran ((𝑃‘𝐵) ∘ 𝐺) = ∅) |
21 | 20 | ineq2d 4143 | . . . . 5 ⊢ (¬ 𝐵 ∈ V → (dom 𝐹 ∩ ran ((𝑃‘𝐵) ∘ 𝐺)) = (dom 𝐹 ∩ ∅)) |
22 | in0 4322 | . . . . 5 ⊢ (dom 𝐹 ∩ ∅) = ∅ | |
23 | 21, 22 | eqtrdi 2795 | . . . 4 ⊢ (¬ 𝐵 ∈ V → (dom 𝐹 ∩ ran ((𝑃‘𝐵) ∘ 𝐺)) = ∅) |
24 | 23 | coemptyd 14618 | . . 3 ⊢ (¬ 𝐵 ∈ V → (𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺)) = ∅) |
25 | 24 | necon1ai 2970 | . 2 ⊢ ((𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺)) ≠ ∅ → 𝐵 ∈ V) |
26 | 8, 9, 25 | 3syl 18 | 1 ⊢ (𝜑 → 𝐵 ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 = wceq 1539 ∈ wcel 2108 ≠ wne 2942 Vcvv 3422 ∩ cin 3882 ∅c0 4253 class class class wbr 5070 dom cdm 5580 ran crn 5581 ∘ ccom 5584 ‘cfv 6418 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-ne 2943 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-iota 6376 df-fv 6426 |
This theorem is referenced by: neicvgrcomplex 41612 neicvgf1o 41613 neicvgnvo 41614 neicvgmex 41616 neicvgel1 41618 |
Copyright terms: Public domain | W3C validator |