The Rasiowa–Sikorski lemma
ProvedFamousTheorems.rasiowa_sikorski_lemmaThe Rasiowa–Sikorski lemma. Let be a preorder, , and let be a countable family of cofinal subsets of . Then there is an ideal of that contains and meets every .
In forcing terms, with the order reversed, it states that for countably many dense sets there is a generic filter through any given condition. It is the basic existence result behind forcing over countable transitive models, and a combinatorial form of the Baire category theorem.
Formalization note. Mathlib's Order.cofinal_meets_idealOfCofinals and Order.mem_idealOfCofinals, with witness Order.idealOfCofinals p 𝒟. A set is cofinal (Order.Cofinal P) if every element of lies below some element of it. Countability of the family is expressed by Encodable ι.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem rasiowa_sikorski_lemma {P : Type*} [Preorder P] (p : P) {ι : Type*} [Encodable ι] (𝒟 : ι → Order.Cofinal P) :
∃ I : Order.Ideal P, p ∈ I ∧ ∀ i, ∃ x ∈ 𝒟 i, x ∈ I := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Order.cofinal_meets_idealOfCofinals`. Proof here reduces to that Mathlib result.