Theorem neicvgbex 44896

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.)

Hypotheses

Ref	Expression
neicvgbex.d	⊢ 𝐷 = (𝑃‘𝐵)
neicvgbex.h	⊢ 𝐻 = (𝐹 ∘ (𝐷 ∘ 𝐺))
neicvgbex.r	⊢ (𝜑 → 𝑁𝐻𝑀)

Assertion

Ref	Expression
neicvgbex	⊢ (𝜑 → 𝐵 ∈ V)

Proof of Theorem neicvgbex

Step	Hyp	Ref	Expression
1		neicvgbex.h	. . . . 5 ⊢ 𝐻 = (𝐹 ∘ (𝐷 ∘ 𝐺))
2		neicvgbex.d	. . . . . . 7 ⊢ 𝐷 = (𝑃‘𝐵)
3	2	coeq1i 5847	. . . . . 6 ⊢ (𝐷 ∘ 𝐺) = ((𝑃‘𝐵) ∘ 𝐺)
4	3	coeq2i 5848	. . . . 5 ⊢ (𝐹 ∘ (𝐷 ∘ 𝐺)) = (𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺))
5	1, 4	eqtri 2788	. . . 4 ⊢ 𝐻 = (𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺))
6	5	a1i 11	. . 3 ⊢ (𝜑 → 𝐻 = (𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺)))
7		neicvgbex.r	. . 3 ⊢ (𝜑 → 𝑁𝐻𝑀)
8	6, 7	breqdi 5126	. 2 ⊢ (𝜑 → 𝑁(𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺))𝑀)
9		brne0 5163	. 2 ⊢ (𝑁(𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺))𝑀 → (𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺)) ≠ ∅)
10		fvprc 6877	. . . . . . . . . . . . 13 ⊢ (¬ 𝐵 ∈ V → (𝑃‘𝐵) = ∅)
11	10	dmeqd 5897	. . . . . . . . . . . 12 ⊢ (¬ 𝐵 ∈ V → dom (𝑃‘𝐵) = dom ∅)
12		dm0 5912	. . . . . . . . . . . 12 ⊢ dom ∅ = ∅
13	11, 12	eqtrdi 2816	. . . . . . . . . . 11 ⊢ (¬ 𝐵 ∈ V → dom (𝑃‘𝐵) = ∅)
14	13	ineq1d 4172	. . . . . . . . . 10 ⊢ (¬ 𝐵 ∈ V → (dom (𝑃‘𝐵) ∩ ran 𝐺) = (∅ ∩ ran 𝐺))
15		0in 4354	. . . . . . . . . 10 ⊢ (∅ ∩ ran 𝐺) = ∅
16	14, 15	eqtrdi 2816	. . . . . . . . 9 ⊢ (¬ 𝐵 ∈ V → (dom (𝑃‘𝐵) ∩ ran 𝐺) = ∅)
17	16	coemptyd 15040	. . . . . . . 8 ⊢ (¬ 𝐵 ∈ V → ((𝑃‘𝐵) ∘ 𝐺) = ∅)
18	17	rneqd 5930	. . . . . . 7 ⊢ (¬ 𝐵 ∈ V → ran ((𝑃‘𝐵) ∘ 𝐺) = ran ∅)
19		rn0 5918	. . . . . . 7 ⊢ ran ∅ = ∅
20	18, 19	eqtrdi 2816	. . . . . 6 ⊢ (¬ 𝐵 ∈ V → ran ((𝑃‘𝐵) ∘ 𝐺) = ∅)
21	20	ineq2d 4173	. . . . 5 ⊢ (¬ 𝐵 ∈ V → (dom 𝐹 ∩ ran ((𝑃‘𝐵) ∘ 𝐺)) = (dom 𝐹 ∩ ∅))
22		in0 4352	. . . . 5 ⊢ (dom 𝐹 ∩ ∅) = ∅
23	21, 22	eqtrdi 2816	. . . 4 ⊢ (¬ 𝐵 ∈ V → (dom 𝐹 ∩ ran ((𝑃‘𝐵) ∘ 𝐺)) = ∅)
24	23	coemptyd 15040	. . 3 ⊢ (¬ 𝐵 ∈ V → (𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺)) = ∅)
25	24	necon1ai 2987	. 2 ⊢ ((𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺)) ≠ ∅ → 𝐵 ∈ V)
26	8, 9, 25	3syl 19	1 ⊢ (𝜑 → 𝐵 ∈ V)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1570   ∈ wcel 2146   ≠ wne 2960  Vcvv 3457   ∩ cin 3905  ∅c0 4286   class class class wbr 5111  dom cdm 5663  ran crn 5664   ∘ ccom 5667  ‘cfv 6540

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 2148  ax-9 2156  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-iota 6496  df-fv 6548

This theorem is used by:  neicvgrcomplex  44897  neicvgf1o  44898  neicvgnvo  44899  neicvgmex  44901  neicvgel1  44903