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

Theorem ufilss 23934
Description: For any subset of the base set of an ultrafilter, either the set is in the ultrafilter or the complement is. (Contributed by Jeff Hankins, 1-Dec-2009.) (Revised by Mario Carneiro, 29-Jul-2015.)
Assertion
Ref Expression
ufilss ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑆𝑋) → (𝑆𝐹 ∨ (𝑋𝑆) ∈ 𝐹))

Proof of Theorem ufilss
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 elfvdm 6957 . . . 4 (𝐹 ∈ (UFil‘𝑋) → 𝑋 ∈ dom UFil)
2 elpw2g 5351 . . . 4 (𝑋 ∈ dom UFil → (𝑆 ∈ 𝒫 𝑋𝑆𝑋))
31, 2syl 17 . . 3 (𝐹 ∈ (UFil‘𝑋) → (𝑆 ∈ 𝒫 𝑋𝑆𝑋))
4 isufil 23932 . . . 4 (𝐹 ∈ (UFil‘𝑋) ↔ (𝐹 ∈ (Fil‘𝑋) ∧ ∀𝑥 ∈ 𝒫 𝑋(𝑥𝐹 ∨ (𝑋𝑥) ∈ 𝐹)))
5 eleq1 2832 . . . . . 6 (𝑥 = 𝑆 → (𝑥𝐹𝑆𝐹))
6 difeq2 4143 . . . . . . 7 (𝑥 = 𝑆 → (𝑋𝑥) = (𝑋𝑆))
76eleq1d 2829 . . . . . 6 (𝑥 = 𝑆 → ((𝑋𝑥) ∈ 𝐹 ↔ (𝑋𝑆) ∈ 𝐹))
85, 7orbi12d 917 . . . . 5 (𝑥 = 𝑆 → ((𝑥𝐹 ∨ (𝑋𝑥) ∈ 𝐹) ↔ (𝑆𝐹 ∨ (𝑋𝑆) ∈ 𝐹)))
98rspccv 3632 . . . 4 (∀𝑥 ∈ 𝒫 𝑋(𝑥𝐹 ∨ (𝑋𝑥) ∈ 𝐹) → (𝑆 ∈ 𝒫 𝑋 → (𝑆𝐹 ∨ (𝑋𝑆) ∈ 𝐹)))
104, 9simplbiim 504 . . 3 (𝐹 ∈ (UFil‘𝑋) → (𝑆 ∈ 𝒫 𝑋 → (𝑆𝐹 ∨ (𝑋𝑆) ∈ 𝐹)))
113, 10sylbird 260 . 2 (𝐹 ∈ (UFil‘𝑋) → (𝑆𝑋 → (𝑆𝐹 ∨ (𝑋𝑆) ∈ 𝐹)))
1211imp 406 1 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑆𝑋) → (𝑆𝐹 ∨ (𝑋𝑆) ∈ 𝐹))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wo 846   = wceq 1537  wcel 2108  wral 3067  cdif 3973  wss 3976  𝒫 cpw 4622  dom cdm 5700  cfv 6573  Filcfil 23874  UFilcufil 23928
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fv 6581  df-ufil 23930
This theorem is referenced by:  ufilb  23935  trufil  23939  ufildr  23960
  Copyright terms: Public domain W3C validator