Hello, infinite-set readers. Set theory is back.
The previous post about set theory is on this link. If you visit this website for the first time, you should read the previous posts.
(x) Theorem :
Any poset has the largest well ordered subset.
Given any poset . Consider poset with is the set of all well ordered subset of poset and is a relation that defined as before. By Theorem in this post then all well ordered subset of poset has the smallest upper bound. By Theorem in this post Because of is a poset that every the well ordered subset has the smallest upper bound then has at least one maximum element. Suppose that the maximum element of is , then is also largest well ordered of poset .
Next will be discussed about the theorem that became the basic of Zorn’s Lemma.
(y) Theorem :
For non-empty poset that every the well ordered subset has upper bound then has at least one maximum element.
Proof : (more…)