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

Theorem ufildom1 22531
Description: An ultrafilter is generated by at most one element (because free ultrafilters have no generators and fixed ultrafilters have exactly one). (Contributed by Mario Carneiro, 24-May-2015.) (Revised by Stefan O'Rear, 2-Aug-2015.)
Assertion
Ref Expression
ufildom1 (𝐹 ∈ (UFil‘𝑋) → 𝐹 ≼ 1o)

Proof of Theorem ufildom1
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 breq1 5033 . 2 ( 𝐹 = ∅ → ( 𝐹 ≼ 1o ↔ ∅ ≼ 1o))
2 uffixsn 22530 . . . . . . . . 9 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 𝐹) → {𝑥} ∈ 𝐹)
3 intss1 4853 . . . . . . . . 9 ({𝑥} ∈ 𝐹 𝐹 ⊆ {𝑥})
42, 3syl 17 . . . . . . . 8 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 𝐹) → 𝐹 ⊆ {𝑥})
5 simpr 488 . . . . . . . . 9 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 𝐹) → 𝑥 𝐹)
65snssd 4702 . . . . . . . 8 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 𝐹) → {𝑥} ⊆ 𝐹)
74, 6eqssd 3932 . . . . . . 7 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝑥 𝐹) → 𝐹 = {𝑥})
87ex 416 . . . . . 6 (𝐹 ∈ (UFil‘𝑋) → (𝑥 𝐹 𝐹 = {𝑥}))
98eximdv 1918 . . . . 5 (𝐹 ∈ (UFil‘𝑋) → (∃𝑥 𝑥 𝐹 → ∃𝑥 𝐹 = {𝑥}))
10 n0 4260 . . . . 5 ( 𝐹 ≠ ∅ ↔ ∃𝑥 𝑥 𝐹)
11 en1 8559 . . . . 5 ( 𝐹 ≈ 1o ↔ ∃𝑥 𝐹 = {𝑥})
129, 10, 113imtr4g 299 . . . 4 (𝐹 ∈ (UFil‘𝑋) → ( 𝐹 ≠ ∅ → 𝐹 ≈ 1o))
1312imp 410 . . 3 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐹 ≠ ∅) → 𝐹 ≈ 1o)
14 endom 8519 . . 3 ( 𝐹 ≈ 1o 𝐹 ≼ 1o)
1513, 14syl 17 . 2 ((𝐹 ∈ (UFil‘𝑋) ∧ 𝐹 ≠ ∅) → 𝐹 ≼ 1o)
16 1on 8092 . . 3 1o ∈ On
17 0domg 8628 . . 3 (1o ∈ On → ∅ ≼ 1o)
1816, 17mp1i 13 . 2 (𝐹 ∈ (UFil‘𝑋) → ∅ ≼ 1o)
191, 15, 18pm2.61ne 3072 1 (𝐹 ∈ (UFil‘𝑋) → 𝐹 ≼ 1o)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1538  wex 1781  wcel 2111  wne 2987  wss 3881  c0 4243  {csn 4525   cint 4838   class class class wbr 5030  Oncon0 6159  cfv 6324  1oc1o 8078  cen 8489  cdom 8490  UFilcufil 22504
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-nel 3092  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-ord 6162  df-on 6163  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-ov 7138  df-oprab 7139  df-mpo 7140  df-1o 8085  df-en 8493  df-dom 8494  df-fbas 20088  df-fg 20089  df-fil 22451  df-ufil 22506
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator