Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  neicvgbex Structured version   Visualization version   GIF version

Theorem neicvgbex 45221
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
StepHypRef Expression
1 neicvgbex.h . . . . 5 𝐻 = (𝐹 ∘ (𝐷 ∘ 𝐺))
2 neicvgbex.d . . . . . . 7 𝐷 = (𝑃‘𝐵)
32coeq1i 5838 . . . . . 6 (𝐷 ∘ 𝐺) = ((𝑃‘𝐵) ∘ 𝐺)
43coeq2i 5839 . . . . 5 (𝐹 ∘ (𝐷 ∘ 𝐺)) = (𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺))
51, 4eqtri 2783 . . . 4 𝐻 = (𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺))
65a1i 11 . . 3 (𝜑 → 𝐻 = (𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺)))
7 neicvgbex.r . . 3 (𝜑 → 𝑁𝐻𝑀)
86, 7breqdi 5117 . 2 (𝜑 → 𝑁(𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺))𝑀)
9 brne0 5154 . 2 (𝑁(𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺))𝑀 → (𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺)) ≠ ∅)
10 fvprc 6882 . . . . . . . . . . . . 13 (¬ 𝐵 ∈ V → (𝑃‘𝐵) = ∅)
1110dmeqd 5888 . . . . . . . . . . . 12 (¬ 𝐵 ∈ V → dom (𝑃‘𝐵) = dom ∅)
12 dm0 5903 . . . . . . . . . . . 12 dom ∅ = ∅
1311, 12eqtrdi 2811 . . . . . . . . . . 11 (¬ 𝐵 ∈ V → dom (𝑃‘𝐵) = ∅)
1413ineq1d 4115 . . . . . . . . . 10 (¬ 𝐵 ∈ V → (dom (𝑃‘𝐵) ∩ ran 𝐺) = (∅ ∩ ran 𝐺))
15 0in 4346 . . . . . . . . . 10 (∅ ∩ ran 𝐺) = ∅
1614, 15eqtrdi 2811 . . . . . . . . 9 (¬ 𝐵 ∈ V → (dom (𝑃‘𝐵) ∩ ran 𝐺) = ∅)
1716coemptyd 15141 . . . . . . . 8 (¬ 𝐵 ∈ V → ((𝑃‘𝐵) ∘ 𝐺) = ∅)
1817rneqd 5921 . . . . . . 7 (¬ 𝐵 ∈ V → ran ((𝑃‘𝐵) ∘ 𝐺) = ran ∅)
19 rn0 5909 . . . . . . 7 ran ∅ = ∅
2018, 19eqtrdi 2811 . . . . . 6 (¬ 𝐵 ∈ V → ran ((𝑃‘𝐵) ∘ 𝐺) = ∅)
2120ineq2d 4116 . . . . 5 (¬ 𝐵 ∈ V → (dom 𝐹 ∩ ran ((𝑃‘𝐵) ∘ 𝐺)) = (dom 𝐹 ∩ ∅))
22 in0 4344 . . . . 5 (dom 𝐹 ∩ ∅) = ∅
2321, 22eqtrdi 2811 . . . 4 (¬ 𝐵 ∈ V → (dom 𝐹 ∩ ran ((𝑃‘𝐵) ∘ 𝐺)) = ∅)
2423coemptyd 15141 . . 3 (¬ 𝐵 ∈ V → (𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺)) = ∅)
2524necon1ai 2982 . 2 ((𝐹 ∘ ((𝑃‘𝐵) ∘ 𝐺)) ≠ ∅ → 𝐵 ∈ V)
268, 9, 253syl 19 1 (𝜑 → 𝐵 ∈ V)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1569   ∈ wcel 2144   ≠ wne 2955  Vcvv 3450   ∩ cin 4088  ∅c0 4277   class class class wbr 5102  dom cdm 5651  ran crn 5652   ∘ ccom 5655  ‘cfv 6543
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-iota 6497  df-fv 6551
This theorem is used by:  neicvgrcomplex  45222  neicvgf1o  45223  neicvgnvo  45224  neicvgmex  45226  neicvgel1  45228
  Copyright terms: Public domain W3C validator