Users' Mathboxes Mathbox for Jeff Hankins < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  fnessex Structured version   Visualization version   GIF version

Theorem fnessex 31511
Description: If 𝐵 is finer than 𝐴 and 𝑆 is an element of 𝐴, every point in 𝑆 is an element of a subset of 𝑆 which is in 𝐵. (Contributed by Jeff Hankins, 28-Sep-2009.)
Assertion
Ref Expression
fnessex ((𝐴Fne𝐵𝑆𝐴𝑃𝑆) → ∃𝑥𝐵 (𝑃𝑥𝑥𝑆))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝑃   𝑥,𝑆

Proof of Theorem fnessex
StepHypRef Expression
1 fnetg 31510 . . 3 (𝐴Fne𝐵𝐴 ⊆ (topGen‘𝐵))
21sselda 3568 . 2 ((𝐴Fne𝐵𝑆𝐴) → 𝑆 ∈ (topGen‘𝐵))
3 tg2 20580 . 2 ((𝑆 ∈ (topGen‘𝐵) ∧ 𝑃𝑆) → ∃𝑥𝐵 (𝑃𝑥𝑥𝑆))
42, 3stoic3 1692 1 ((𝐴Fne𝐵𝑆𝐴𝑃𝑆) → ∃𝑥𝐵 (𝑃𝑥𝑥𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383  w3a 1031  wcel 1977  wrex 2897  wss 3540   class class class wbr 4583  cfv 5804  topGenctg 15921  Fnecfne 31501
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-iota 5768  df-fun 5806  df-fv 5812  df-topgen 15927  df-fne 31502
This theorem is referenced by:  fneint  31513  fnessref  31522
  Copyright terms: Public domain W3C validator