| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ufli | Structured version Visualization version GIF version | ||
| Description: Property of a set that satisfies the ultrafilter lemma. (Contributed by Mario Carneiro, 26-Aug-2015.) |
| Ref | Expression |
|---|---|
| ufli | ⊢ ((𝑋 ∈ UFL ∧ 𝐹 ∈ (Fil‘𝑋)) → ∃𝑓 ∈ (UFil‘𝑋)𝐹 ⊆ 𝑓) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | isufl 23851 | . . 3 ⊢ (𝑋 ∈ UFL → (𝑋 ∈ UFL ↔ ∀𝑔 ∈ (Fil‘𝑋)∃𝑓 ∈ (UFil‘𝑋)𝑔 ⊆ 𝑓)) | |
| 2 | 1 | ibi 267 | . 2 ⊢ (𝑋 ∈ UFL → ∀𝑔 ∈ (Fil‘𝑋)∃𝑓 ∈ (UFil‘𝑋)𝑔 ⊆ 𝑓) |
| 3 | sseq1 3984 | . . . 4 ⊢ (𝑔 = 𝐹 → (𝑔 ⊆ 𝑓 ↔ 𝐹 ⊆ 𝑓)) | |
| 4 | 3 | rexbidv 3164 | . . 3 ⊢ (𝑔 = 𝐹 → (∃𝑓 ∈ (UFil‘𝑋)𝑔 ⊆ 𝑓 ↔ ∃𝑓 ∈ (UFil‘𝑋)𝐹 ⊆ 𝑓)) |
| 5 | 4 | rspccva 3600 | . 2 ⊢ ((∀𝑔 ∈ (Fil‘𝑋)∃𝑓 ∈ (UFil‘𝑋)𝑔 ⊆ 𝑓 ∧ 𝐹 ∈ (Fil‘𝑋)) → ∃𝑓 ∈ (UFil‘𝑋)𝐹 ⊆ 𝑓) |
| 6 | 2, 5 | sylan 580 | 1 ⊢ ((𝑋 ∈ UFL ∧ 𝐹 ∈ (Fil‘𝑋)) → ∃𝑓 ∈ (UFil‘𝑋)𝐹 ⊆ 𝑓) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2108 ∀wral 3051 ∃wrex 3060 ⊆ wss 3926 ‘cfv 6531 Filcfil 23783 UFilcufil 23837 UFLcufl 23838 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2707 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2065 df-clab 2714 df-cleq 2727 df-clel 2809 df-ral 3052 df-rex 3061 df-rab 3416 df-v 3461 df-dif 3929 df-un 3931 df-ss 3943 df-nul 4309 df-if 4501 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-br 5120 df-iota 6484 df-fv 6539 df-ufl 23840 |
| This theorem is referenced by: ssufl 23856 ufldom 23900 ufilcmp 23970 |
| Copyright terms: Public domain | W3C validator |