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

Theorem ufilss 23858
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 6933 . . . 4 (𝐹 ∈ (UFil‘𝑋) → 𝑋 ∈ dom UFil)
2 elpw2g 5347 . . . 4 (𝑋 ∈ dom UFil → (𝑆 ∈ 𝒫 𝑋𝑆𝑋))
31, 2syl 17 . . 3 (𝐹 ∈ (UFil‘𝑋) → (𝑆 ∈ 𝒫 𝑋𝑆𝑋))
4 isufil 23856 . . . 4 (𝐹 ∈ (UFil‘𝑋) ↔ (𝐹 ∈ (Fil‘𝑋) ∧ ∀𝑥 ∈ 𝒫 𝑋(𝑥𝐹 ∨ (𝑋𝑥) ∈ 𝐹)))
5 eleq1 2813 . . . . . 6 (𝑥 = 𝑆 → (𝑥𝐹𝑆𝐹))
6 difeq2 4112 . . . . . . 7 (𝑥 = 𝑆 → (𝑋𝑥) = (𝑋𝑆))
76eleq1d 2810 . . . . . 6 (𝑥 = 𝑆 → ((𝑋𝑥) ∈ 𝐹 ↔ (𝑋𝑆) ∈ 𝐹))
85, 7orbi12d 916 . . . . 5 (𝑥 = 𝑆 → ((𝑥𝐹 ∨ (𝑋𝑥) ∈ 𝐹) ↔ (𝑆𝐹 ∨ (𝑋𝑆) ∈ 𝐹)))
98rspccv 3603 . . . 4 (∀𝑥 ∈ 𝒫 𝑋(𝑥𝐹 ∨ (𝑋𝑥) ∈ 𝐹) → (𝑆 ∈ 𝒫 𝑋 → (𝑆𝐹 ∨ (𝑋𝑆) ∈ 𝐹)))
104, 9simplbiim 503 . . 3 (𝐹 ∈ (UFil‘𝑋) → (𝑆 ∈ 𝒫 𝑋 → (𝑆𝐹 ∨ (𝑋𝑆) ∈ 𝐹)))
113, 10sylbird 259 . 2 (𝐹 ∈ (UFil‘𝑋) → (𝑆𝑋 → (𝑆𝐹 ∨ (𝑋𝑆) ∈ 𝐹)))
1211imp 405 1 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑆𝑋) → (𝑆𝐹 ∨ (𝑋𝑆) ∈ 𝐹))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 394  wo 845   = wceq 1533  wcel 2098  wral 3050  cdif 3941  wss 3944  𝒫 cpw 4604  dom cdm 5678  cfv 6549  Filcfil 23798  UFilcufil 23852
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2696  ax-sep 5300  ax-nul 5307  ax-pr 5429
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2703  df-cleq 2717  df-clel 2802  df-nfc 2877  df-ne 2930  df-ral 3051  df-rex 3060  df-rab 3419  df-v 3463  df-sbc 3774  df-csb 3890  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-nul 4323  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4910  df-br 5150  df-opab 5212  df-mpt 5233  df-id 5576  df-xp 5684  df-rel 5685  df-cnv 5686  df-co 5687  df-dm 5688  df-rn 5689  df-res 5690  df-ima 5691  df-iota 6501  df-fun 6551  df-fv 6557  df-ufil 23854
This theorem is referenced by:  ufilb  23859  trufil  23863  ufildr  23884
  Copyright terms: Public domain W3C validator