# Category:Well-Orderings

This category contains results about Well-Orderings.

Definitions specific to this category can be found in Definitions/Well-Orderings.

The ordering $\preceq$ is a **well-ordering** on $S$ if and only if *every* non-empty subset of $S$ has a smallest element under $\preceq$:

- $\forall T \subseteq S: \exists a \in T: \forall x \in T: a \preceq x$

## Subcategories

This category has only the following subcategory.

### C

## Pages in category "Well-Orderings"

The following 52 pages are in this category, out of 52 total.

### E

### F

### I

### L

### N

### O

### P

### R

### S

- Set of Integers Bounded Below by Integer has Smallest Element
- Set of Integers can be Well-Ordered
- Set of Integers is not Well-Ordered by Usual Ordering
- Set of Non-Negative Real Numbers is not Well-Ordered by Usual Ordering
- Strict Well-Ordering Isomorphic to Unique Ordinal under Unique Mapping
- Strictly Increasing Mapping Between Wosets Implies Order Isomorphism
- Subset of Well-Ordered Set is Well-Ordered

### T

### W

- Well-Ordered Induction
- Well-Ordered Transitive Subset is Equal or Equal to Initial Segment
- Well-Ordering Minimal Elements are Unique
- Well-Ordering Principle
- Well-Ordering Theorem implies Hausdorff Maximal Principle
- Woset is Isomorphic to Set of its Initial Segments
- Wosets are Isomorphic to Each Other or Initial Segments
- Wosets are Isomorphic to Each Other or Initial Segments/Proof Using Choice
- Wosets are Isomorphic to Each Other or Initial Segments/Proof Without Using Choice