Table of ContentsTable of Contents Mathbox for Jeff Hankins < Previous   Next >
Related theorems
Unicode version

Theorem ufilss 15567
Description: For any subset of the base set of an ultrafilter, either the set is in the ultrafilter or the complement is.
Hypothesis
Ref Expression
ufilss.1 |- X = U.F
Assertion
Ref Expression
ufilss |- ((F e. UFil /\ S C_ X) -> (S e. F \/ (X \ S) e. F))

Proof of Theorem ufilss
StepHypRef Expression
1 uniexg 3795 . . . . 5 |- (F e. UFil -> U.F e. _V)
2 ufilss.1 . . . . 5 |- X = U.F
31, 2syl5eqel 1975 . . . 4 |- (F e. UFil -> X e. _V)
4 elpw2g 3463 . . . 4 |- (X e. _V -> (S e. ~PX <-> S C_ X))
53, 4syl 12 . . 3 |- (F e. UFil -> (S e. ~PX <-> S C_ X))
62isufil 15564 . . . . 5 |- (F e. UFil <-> (F e. Fil /\ A.s e. ~P X(s e. F \/ (X \ s) e. F)))
76simprbi 353 . . . 4 |- (F e. UFil -> A.s e. ~P X(s e. F \/ (X \ s) e. F))
8 eleq1 1957 . . . . . 6 |- (s = S -> (s e. F <-> S e. F))
9 difeq2 2719 . . . . . . 7 |- (s = S -> (X \ s) = (X \ S))
109eleq1d 1963 . . . . . 6 |- (s = S -> ((X \ s) e. F <-> (X \ S) e. F))
118, 10orbi12d 689 . . . . 5 |- (s = S -> ((s e. F \/ (X \ s) e. F) <-> (S e. F \/ (X \ S) e. F)))
1211rcla4cv 2377 . . . 4 |- (A.s e. ~P X(s e. F \/ (X \ s) e. F) -> (S e. ~PX -> (S e. F \/ (X \ S) e. F)))
137, 12syl 12 . . 3 |- (F e. UFil -> (S e. ~PX -> (S e. F \/ (X \ S) e. F)))
145, 13sylbird 222 . 2 |- (F e. UFil -> (S C_ X -> (S e. F \/ (X \ S) e. F)))
1514imp 377 1 |- ((F e. UFil /\ S C_ X) -> (S e. F \/ (X \ S) e. F))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 163   \/ wo 239   /\ wa 240   = wceq 1298   e. wcel 1300  A.wral 2105  _Vcvv 2292   \ cdif 2590   C_ wss 2593  ~Pcpw 3032  U.cuni 3177  Filcfil 10264  UFilcufil 15562
This theorem is referenced by:  ufprim 15569  ufcondr 15581
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-13 1311  ax-14 1312  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865  ax-sep 3438  ax-un 3790
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-ex 1327  df-sb 1536  df-clab 1872  df-cleq 1877  df-clel 1880  df-ral 2109  df-rex 2110  df-rab 2112  df-v 2294  df-dif 2597  df-in 2603  df-ss 2605  df-pw 3035  df-uni 3178  df-ufil 15563
Copyright terms: Public domain