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 36516
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 36515 . . 3 (𝐴Fne𝐵𝐴 ⊆ (topGen‘𝐵))
21sselda 3917 . 2 ((𝐴Fne𝐵𝑆𝐴) → 𝑆 ∈ (topGen‘𝐵))
3 tg2 22918 . 2 ((𝑆 ∈ (topGen‘𝐵) ∧ 𝑃𝑆) → ∃𝑥𝐵 (𝑃𝑥𝑥𝑆))
42, 3stoic3 1778 1 ((𝐴Fne𝐵𝑆𝐴𝑃𝑆) → ∃𝑥𝐵 (𝑃𝑥𝑥𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087  wcel 2114  wrex 3059  wss 3885   class class class wbr 5074  cfv 6487  topGenctg 17389  Fnecfne 36506
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2184  ax-ext 2707  ax-sep 5220  ax-nul 5230  ax-pow 5296  ax-pr 5364  ax-un 7678
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2538  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2810  df-nfc 2884  df-ne 2931  df-ral 3050  df-rex 3060  df-rab 3388  df-v 3429  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-nul 4264  df-if 4457  df-pw 4533  df-sn 4558  df-pr 4560  df-op 4564  df-uni 4841  df-br 5075  df-opab 5137  df-mpt 5156  df-id 5515  df-xp 5626  df-rel 5627  df-cnv 5628  df-co 5629  df-dm 5630  df-iota 6443  df-fun 6489  df-fv 6495  df-topgen 17395  df-fne 36507
This theorem is referenced by:  fneint  36518  fnessref  36527
  Copyright terms: Public domain W3C validator