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

Theorem fbflim 21761
 Description: A condition for a filter to converge to a point involving one of its bases. (Contributed by Jeff Hankins, 4-Sep-2009.) (Revised by Stefan O'Rear, 6-Aug-2015.)
Hypothesis
Ref Expression
fbflim.3 𝐹 = (𝑋filGen𝐵)
Assertion
Ref Expression
fbflim ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) → (𝐴 ∈ (𝐽 fLim 𝐹) ↔ (𝐴𝑋 ∧ ∀𝑥𝐽 (𝐴𝑥 → ∃𝑦𝐵 𝑦𝑥))))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝐽,𝑦   𝑥,𝑋,𝑦   𝑥,𝐹,𝑦

Proof of Theorem fbflim
StepHypRef Expression
1 fbflim.3 . . . 4 𝐹 = (𝑋filGen𝐵)
2 fgcl 21663 . . . 4 (𝐵 ∈ (fBas‘𝑋) → (𝑋filGen𝐵) ∈ (Fil‘𝑋))
31, 2syl5eqel 2703 . . 3 (𝐵 ∈ (fBas‘𝑋) → 𝐹 ∈ (Fil‘𝑋))
4 flimopn 21760 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fLim 𝐹) ↔ (𝐴𝑋 ∧ ∀𝑥𝐽 (𝐴𝑥𝑥𝐹))))
53, 4sylan2 491 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) → (𝐴 ∈ (𝐽 fLim 𝐹) ↔ (𝐴𝑋 ∧ ∀𝑥𝐽 (𝐴𝑥𝑥𝐹))))
61eleq2i 2691 . . . . . . 7 (𝑥𝐹𝑥 ∈ (𝑋filGen𝐵))
7 elfg 21656 . . . . . . . 8 (𝐵 ∈ (fBas‘𝑋) → (𝑥 ∈ (𝑋filGen𝐵) ↔ (𝑥𝑋 ∧ ∃𝑦𝐵 𝑦𝑥)))
87ad3antlr 766 . . . . . . 7 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴𝑋) ∧ 𝑥𝐽) → (𝑥 ∈ (𝑋filGen𝐵) ↔ (𝑥𝑋 ∧ ∃𝑦𝐵 𝑦𝑥)))
96, 8syl5bb 272 . . . . . 6 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴𝑋) ∧ 𝑥𝐽) → (𝑥𝐹 ↔ (𝑥𝑋 ∧ ∃𝑦𝐵 𝑦𝑥)))
10 simpll 789 . . . . . . . 8 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴𝑋) → 𝐽 ∈ (TopOn‘𝑋))
11 toponss 20712 . . . . . . . 8 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑥𝐽) → 𝑥𝑋)
1210, 11sylan 488 . . . . . . 7 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴𝑋) ∧ 𝑥𝐽) → 𝑥𝑋)
1312biantrurd 529 . . . . . 6 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴𝑋) ∧ 𝑥𝐽) → (∃𝑦𝐵 𝑦𝑥 ↔ (𝑥𝑋 ∧ ∃𝑦𝐵 𝑦𝑥)))
149, 13bitr4d 271 . . . . 5 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴𝑋) ∧ 𝑥𝐽) → (𝑥𝐹 ↔ ∃𝑦𝐵 𝑦𝑥))
1514imbi2d 330 . . . 4 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴𝑋) ∧ 𝑥𝐽) → ((𝐴𝑥𝑥𝐹) ↔ (𝐴𝑥 → ∃𝑦𝐵 𝑦𝑥)))
1615ralbidva 2982 . . 3 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) ∧ 𝐴𝑋) → (∀𝑥𝐽 (𝐴𝑥𝑥𝐹) ↔ ∀𝑥𝐽 (𝐴𝑥 → ∃𝑦𝐵 𝑦𝑥)))
1716pm5.32da 672 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) → ((𝐴𝑋 ∧ ∀𝑥𝐽 (𝐴𝑥𝑥𝐹)) ↔ (𝐴𝑋 ∧ ∀𝑥𝐽 (𝐴𝑥 → ∃𝑦𝐵 𝑦𝑥))))
185, 17bitrd 268 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐵 ∈ (fBas‘𝑋)) → (𝐴 ∈ (𝐽 fLim 𝐹) ↔ (𝐴𝑋 ∧ ∀𝑥𝐽 (𝐴𝑥 → ∃𝑦𝐵 𝑦𝑥))))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384   = wceq 1481   ∈ wcel 1988  ∀wral 2909  ∃wrex 2910   ⊆ wss 3567  ‘cfv 5876  (class class class)co 6635  fBascfbas 19715  filGencfg 19716  TopOnctopon 20696  Filcfil 21630   fLim cflim 21719 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1720  ax-4 1735  ax-5 1837  ax-6 1886  ax-7 1933  ax-8 1990  ax-9 1997  ax-10 2017  ax-11 2032  ax-12 2045  ax-13 2244  ax-ext 2600  ax-rep 4762  ax-sep 4772  ax-nul 4780  ax-pow 4834  ax-pr 4897  ax-un 6934 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1484  df-ex 1703  df-nf 1708  df-sb 1879  df-eu 2472  df-mo 2473  df-clab 2607  df-cleq 2613  df-clel 2616  df-nfc 2751  df-ne 2792  df-nel 2895  df-ral 2914  df-rex 2915  df-reu 2916  df-rab 2918  df-v 3197  df-sbc 3430  df-csb 3527  df-dif 3570  df-un 3572  df-in 3574  df-ss 3581  df-nul 3908  df-if 4078  df-pw 4151  df-sn 4169  df-pr 4171  df-op 4175  df-uni 4428  df-iun 4513  df-br 4645  df-opab 4704  df-mpt 4721  df-id 5014  df-xp 5110  df-rel 5111  df-cnv 5112  df-co 5113  df-dm 5114  df-rn 5115  df-res 5116  df-ima 5117  df-iota 5839  df-fun 5878  df-fn 5879  df-f 5880  df-f1 5881  df-fo 5882  df-f1o 5883  df-fv 5884  df-ov 6638  df-oprab 6639  df-mpt2 6640  df-fbas 19724  df-fg 19725  df-top 20680  df-topon 20697  df-ntr 20805  df-nei 20883  df-fil 21631  df-flim 21724 This theorem is referenced by:  fbflim2  21762
 Copyright terms: Public domain W3C validator