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

Theorem fbelss 22007
 Description: An element of the filter base is a subset of the base set. (Contributed by Stefan O'Rear, 28-Jul-2015.)
Assertion
Ref Expression
fbelss ((𝐹 ∈ (fBas‘𝐵) ∧ 𝑋𝐹) → 𝑋𝐵)

Proof of Theorem fbelss
StepHypRef Expression
1 fbsspw 22006 . . 3 (𝐹 ∈ (fBas‘𝐵) → 𝐹 ⊆ 𝒫 𝐵)
21sselda 3827 . 2 ((𝐹 ∈ (fBas‘𝐵) ∧ 𝑋𝐹) → 𝑋 ∈ 𝒫 𝐵)
32elpwid 4390 1 ((𝐹 ∈ (fBas‘𝐵) ∧ 𝑋𝐹) → 𝑋𝐵)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 386   ∈ wcel 2166   ⊆ wss 3798  𝒫 cpw 4378  ‘cfv 6123  fBascfbas 20094 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1896  ax-4 1910  ax-5 2011  ax-6 2077  ax-7 2114  ax-8 2168  ax-9 2175  ax-10 2194  ax-11 2209  ax-12 2222  ax-13 2391  ax-ext 2803  ax-sep 5005  ax-nul 5013  ax-pow 5065  ax-pr 5127 This theorem depends on definitions:  df-bi 199  df-an 387  df-or 881  df-3an 1115  df-tru 1662  df-ex 1881  df-nf 1885  df-sb 2070  df-mo 2605  df-eu 2640  df-clab 2812  df-cleq 2818  df-clel 2821  df-nfc 2958  df-ne 3000  df-nel 3103  df-ral 3122  df-rex 3123  df-rab 3126  df-v 3416  df-sbc 3663  df-csb 3758  df-dif 3801  df-un 3803  df-in 3805  df-ss 3812  df-nul 4145  df-if 4307  df-pw 4380  df-sn 4398  df-pr 4400  df-op 4404  df-uni 4659  df-br 4874  df-opab 4936  df-mpt 4953  df-id 5250  df-xp 5348  df-rel 5349  df-cnv 5350  df-co 5351  df-dm 5352  df-rn 5353  df-res 5354  df-ima 5355  df-iota 6086  df-fun 6125  df-fv 6131  df-fbas 20103 This theorem is referenced by:  fbdmn0  22008  filelss  22026  ssfg  22046  fgcl  22052  fbasrn  22058  fmfnfmlem4  22131  fmfnfm  22132  fmucnd  22466  cfilucfil  22734  fmcfil  23440
 Copyright terms: Public domain W3C validator