MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fbflim2 Structured version   Visualization version   GIF version

Theorem fbflim2 23864
Description: A condition for a filter base 𝐵 to converge to a point 𝐴. Use neighborhoods instead of open neighborhoods. Compare fbflim 23863. (Contributed by FL, 4-Jul-2011.) (Revised by Stefan O'Rear, 6-Aug-2015.)
Hypothesis
Ref Expression
fbflim.3 𝐹 = (𝑋filGen𝐵)
Assertion
Ref Expression
fbflim2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) → (𝐴 ∈ (𝐽 fLim 𝐹) ↔ (𝐴𝑋 ∧ ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∃𝑥𝐵 𝑥𝑛)))
Distinct variable groups:   𝑥,𝑛,𝐴   𝐵,𝑛,𝑥   𝑛,𝐽,𝑥   𝑛,𝑋,𝑥   𝑥,𝐹
Allowed substitution hint:   𝐹(𝑛)

Proof of Theorem fbflim2
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 fbflim.3 . . 3 𝐹 = (𝑋filGen𝐵)
21fbflim 23863 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) → (𝐴 ∈ (𝐽 fLim 𝐹) ↔ (𝐴𝑋 ∧ ∀𝑦𝐽 (𝐴𝑦 → ∃𝑥𝐵 𝑥𝑦))))
3 topontop 22800 . . . . . . . . 9 (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
43ad2antrr 726 . . . . . . . 8 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴𝑋) → 𝐽 ∈ Top)
5 simpr 484 . . . . . . . . 9 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴𝑋) → 𝐴𝑋)
6 toponuni 22801 . . . . . . . . . 10 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = 𝐽)
76ad2antrr 726 . . . . . . . . 9 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴𝑋) → 𝑋 = 𝐽)
85, 7eleqtrd 2830 . . . . . . . 8 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴𝑋) → 𝐴 𝐽)
9 eqid 2729 . . . . . . . . 9 𝐽 = 𝐽
109isneip 22992 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝐴 𝐽) → (𝑛 ∈ ((nei‘𝐽)‘{𝐴}) ↔ (𝑛 𝐽 ∧ ∃𝑦𝐽 (𝐴𝑦𝑦𝑛))))
114, 8, 10syl2anc 584 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴𝑋) → (𝑛 ∈ ((nei‘𝐽)‘{𝐴}) ↔ (𝑛 𝐽 ∧ ∃𝑦𝐽 (𝐴𝑦𝑦𝑛))))
12 simpr 484 . . . . . . 7 ((𝑛 𝐽 ∧ ∃𝑦𝐽 (𝐴𝑦𝑦𝑛)) → ∃𝑦𝐽 (𝐴𝑦𝑦𝑛))
1311, 12biimtrdi 253 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴𝑋) → (𝑛 ∈ ((nei‘𝐽)‘{𝐴}) → ∃𝑦𝐽 (𝐴𝑦𝑦𝑛)))
14 r19.29 3094 . . . . . . . 8 ((∀𝑦𝐽 (𝐴𝑦 → ∃𝑥𝐵 𝑥𝑦) ∧ ∃𝑦𝐽 (𝐴𝑦𝑦𝑛)) → ∃𝑦𝐽 ((𝐴𝑦 → ∃𝑥𝐵 𝑥𝑦) ∧ (𝐴𝑦𝑦𝑛)))
15 pm3.45 622 . . . . . . . . . . 11 ((𝐴𝑦 → ∃𝑥𝐵 𝑥𝑦) → ((𝐴𝑦𝑦𝑛) → (∃𝑥𝐵 𝑥𝑦𝑦𝑛)))
1615imp 406 . . . . . . . . . 10 (((𝐴𝑦 → ∃𝑥𝐵 𝑥𝑦) ∧ (𝐴𝑦𝑦𝑛)) → (∃𝑥𝐵 𝑥𝑦𝑦𝑛))
17 sstr2 3953 . . . . . . . . . . . . 13 (𝑥𝑦 → (𝑦𝑛𝑥𝑛))
1817com12 32 . . . . . . . . . . . 12 (𝑦𝑛 → (𝑥𝑦𝑥𝑛))
1918reximdv 3148 . . . . . . . . . . 11 (𝑦𝑛 → (∃𝑥𝐵 𝑥𝑦 → ∃𝑥𝐵 𝑥𝑛))
2019impcom 407 . . . . . . . . . 10 ((∃𝑥𝐵 𝑥𝑦𝑦𝑛) → ∃𝑥𝐵 𝑥𝑛)
2116, 20syl 17 . . . . . . . . 9 (((𝐴𝑦 → ∃𝑥𝐵 𝑥𝑦) ∧ (𝐴𝑦𝑦𝑛)) → ∃𝑥𝐵 𝑥𝑛)
2221rexlimivw 3130 . . . . . . . 8 (∃𝑦𝐽 ((𝐴𝑦 → ∃𝑥𝐵 𝑥𝑦) ∧ (𝐴𝑦𝑦𝑛)) → ∃𝑥𝐵 𝑥𝑛)
2314, 22syl 17 . . . . . . 7 ((∀𝑦𝐽 (𝐴𝑦 → ∃𝑥𝐵 𝑥𝑦) ∧ ∃𝑦𝐽 (𝐴𝑦𝑦𝑛)) → ∃𝑥𝐵 𝑥𝑛)
2423ex 412 . . . . . 6 (∀𝑦𝐽 (𝐴𝑦 → ∃𝑥𝐵 𝑥𝑦) → (∃𝑦𝐽 (𝐴𝑦𝑦𝑛) → ∃𝑥𝐵 𝑥𝑛))
2513, 24syl9 77 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴𝑋) → (∀𝑦𝐽 (𝐴𝑦 → ∃𝑥𝐵 𝑥𝑦) → (𝑛 ∈ ((nei‘𝐽)‘{𝐴}) → ∃𝑥𝐵 𝑥𝑛)))
2625ralrimdv 3131 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴𝑋) → (∀𝑦𝐽 (𝐴𝑦 → ∃𝑥𝐵 𝑥𝑦) → ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∃𝑥𝐵 𝑥𝑛))
274adantr 480 . . . . . . . . 9 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴𝑋) ∧ (𝑦𝐽𝐴𝑦)) → 𝐽 ∈ Top)
28 simprl 770 . . . . . . . . 9 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴𝑋) ∧ (𝑦𝐽𝐴𝑦)) → 𝑦𝐽)
29 simprr 772 . . . . . . . . 9 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴𝑋) ∧ (𝑦𝐽𝐴𝑦)) → 𝐴𝑦)
30 opnneip 23006 . . . . . . . . 9 ((𝐽 ∈ Top ∧ 𝑦𝐽𝐴𝑦) → 𝑦 ∈ ((nei‘𝐽)‘{𝐴}))
3127, 28, 29, 30syl3anc 1373 . . . . . . . 8 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴𝑋) ∧ (𝑦𝐽𝐴𝑦)) → 𝑦 ∈ ((nei‘𝐽)‘{𝐴}))
32 sseq2 3973 . . . . . . . . . 10 (𝑛 = 𝑦 → (𝑥𝑛𝑥𝑦))
3332rexbidv 3157 . . . . . . . . 9 (𝑛 = 𝑦 → (∃𝑥𝐵 𝑥𝑛 ↔ ∃𝑥𝐵 𝑥𝑦))
3433rspcv 3584 . . . . . . . 8 (𝑦 ∈ ((nei‘𝐽)‘{𝐴}) → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∃𝑥𝐵 𝑥𝑛 → ∃𝑥𝐵 𝑥𝑦))
3531, 34syl 17 . . . . . . 7 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴𝑋) ∧ (𝑦𝐽𝐴𝑦)) → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∃𝑥𝐵 𝑥𝑛 → ∃𝑥𝐵 𝑥𝑦))
3635expr 456 . . . . . 6 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴𝑋) ∧ 𝑦𝐽) → (𝐴𝑦 → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∃𝑥𝐵 𝑥𝑛 → ∃𝑥𝐵 𝑥𝑦)))
3736com23 86 . . . . 5 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴𝑋) ∧ 𝑦𝐽) → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∃𝑥𝐵 𝑥𝑛 → (𝐴𝑦 → ∃𝑥𝐵 𝑥𝑦)))
3837ralrimdva 3133 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴𝑋) → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∃𝑥𝐵 𝑥𝑛 → ∀𝑦𝐽 (𝐴𝑦 → ∃𝑥𝐵 𝑥𝑦)))
3926, 38impbid 212 . . 3 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴𝑋) → (∀𝑦𝐽 (𝐴𝑦 → ∃𝑥𝐵 𝑥𝑦) ↔ ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∃𝑥𝐵 𝑥𝑛))
4039pm5.32da 579 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) → ((𝐴𝑋 ∧ ∀𝑦𝐽 (𝐴𝑦 → ∃𝑥𝐵 𝑥𝑦)) ↔ (𝐴𝑋 ∧ ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∃𝑥𝐵 𝑥𝑛)))
412, 40bitrd 279 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) → (𝐴 ∈ (𝐽 fLim 𝐹) ↔ (𝐴𝑋 ∧ ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∃𝑥𝐵 𝑥𝑛)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1540  wcel 2109  wral 3044  wrex 3053  wss 3914  {csn 4589   cuni 4871  cfv 6511  (class class class)co 7387  fBascfbas 21252  filGencfg 21253  Topctop 22780  TopOnctopon 22797  neicnei 22984   fLim cflim 23821
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-ov 7390  df-oprab 7391  df-mpo 7392  df-fbas 21261  df-fg 21262  df-top 22781  df-topon 22798  df-ntr 22907  df-nei 22985  df-fil 23733  df-flim 23826
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator