Suslin trees
Definition\(\kappa\)-Suslin tree#✓fully proved
MetaMathlibExt.IsSuslinTreeAt
A κ-Suslin tree is a κ-Aronszajn tree with no antichains of size κ.
def IsSuslinTreeAt.{u} (κ : Cardinal.{u}) (α : Type u) [PartialOrder α] [WellFoundedLT α] : Prop :=
IsAronszajnTreeAt κ α ∧ ∀ A : Set α, IsAntichain (· ≤ ·) A → #A < κ
def IsAronszajnTreeAt.{u} (κ : Cardinal.{u}) (α : Type u) [PartialOrder α] [WellFoundedLT α] : Prop :=
IsTreeAt κ α ∧ ∀ C : Set α, IsChain (· ≤ ·) C → #C < κ
MathlibExt/SetTheory/Tree/Aronszajn.lean:37
Uses 1 · Used by 1
Statement uses\(\kappa\)-Aronszajn tree
Used bySuslin tree
DefinitionSuslin tree#✓fully proved
MetaMathlibExt.IsSuslinTree
A Suslin tree is a tree of height \(\aleph_1}\) with no uncountable branches and no uncountable antichains.
def IsSuslinTree.{u} (α : Type u) [PartialOrder α] [WellFoundedLT α] : Prop :=
IsSuslinTreeAt (aleph 1) α
def IsSuslinTreeAt.{u} (κ : Cardinal.{u}) (α : Type u) [PartialOrder α] [WellFoundedLT α] : Prop :=
IsAronszajnTreeAt κ α ∧ ∀ A : Set α, IsAntichain (· ≤ ·) A → #A < κ
MathlibExt/SetTheory/Tree/Suslin.lean:38
Uses 1
Statement uses\(\kappa\)-Suslin tree
2 fully proved
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.