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

Theorem ufilss 23938
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 6890 . . . 4 (𝐹 ∈ (UFil‘𝑋) → 𝑋 ∈ dom UFil)
2 elpw2g 5283 . . . 4 (𝑋 ∈ dom UFil → (𝑆 ∈ 𝒫 𝑋𝑆𝑋))
31, 2syl 17 . . 3 (𝐹 ∈ (UFil‘𝑋) → (𝑆 ∈ 𝒫 𝑋𝑆𝑋))
4 isufil 23936 . . . 4 (𝐹 ∈ (UFil‘𝑋) ↔ (𝐹 ∈ (Fil‘𝑋) ∧ ∀𝑥 ∈ 𝒫 𝑋(𝑥𝐹 ∨ (𝑋𝑥) ∈ 𝐹)))
5 eleq1 2844 . . . . . 6 (𝑥 = 𝑆 → (𝑥𝐹𝑆𝐹))
6 difeq2 4069 . . . . . . 7 (𝑥 = 𝑆 → (𝑋𝑥) = (𝑋𝑆))
76eleq1d 2841 . . . . . 6 (𝑥 = 𝑆 → ((𝑋𝑥) ∈ 𝐹 ↔ (𝑋𝑆) ∈ 𝐹))
85, 7orbi12d 927 . . . . 5 (𝑥 = 𝑆 → ((𝑥𝐹 ∨ (𝑋𝑥) ∈ 𝐹) ↔ (𝑆𝐹 ∨ (𝑋𝑆) ∈ 𝐹)))
98rspccv 3573 . . . 4 (∀𝑥 ∈ 𝒫 𝑋(𝑥𝐹 ∨ (𝑋𝑥) ∈ 𝐹) → (𝑆 ∈ 𝒫 𝑋 → (𝑆𝐹 ∨ (𝑋𝑆) ∈ 𝐹)))
104, 9simplbiim 511 . . 3 (𝐹 ∈ (UFil‘𝑋) → (𝑆 ∈ 𝒫 𝑋 → (𝑆𝐹 ∨ (𝑋𝑆) ∈ 𝐹)))
113, 10sylbird 262 . 2 (𝐹 ∈ (UFil‘𝑋) → (𝑆𝑋 → (𝑆𝐹 ∨ (𝑋𝑆) ∈ 𝐹)))
1211imp 409 1 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑆𝑋) → (𝑆𝐹 ∨ (𝑋𝑆) ∈ 𝐹))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398  wo 856   = wceq 1554  wcel 2136  wral 3070  cdif 3896  wss 3899  𝒫 cpw 4549  dom cdm 5640  cfv 6510  Filcfil 23878  UFilcufil 23932
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1809  ax-4 1823  ax-5 1924  ax-6 1981  ax-7 2022  ax-8 2138  ax-9 2146  ax-10 2169  ax-11 2185  ax-12 2206  ax-ext 2728  ax-sep 5240  ax-nul 5250  ax-pr 5384
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3an 1097  df-tru 1557  df-fal 1567  df-ex 1794  df-nf 1798  df-sb 2085  df-mo 2560  df-eu 2590  df-clab 2735  df-cleq 2748  df-clel 2831  df-nfc 2905  df-ne 2952  df-ral 3071  df-rex 3081  df-rab 3409  df-v 3450  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4281  df-if 4475  df-pw 4551  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-br 5095  df-opab 5157  df-mpt 5176  df-id 5535  df-xp 5646  df-rel 5647  df-cnv 5648  df-co 5649  df-dm 5650  df-rn 5651  df-res 5652  df-ima 5653  df-iota 6466  df-fun 6512  df-fv 6518  df-ufil 23934
This theorem is referenced by:  ufilb  23939  trufil  23943  ufildr  23964
  Copyright terms: Public domain W3C validator