2023-07-09

321: For Monotone Ordinal Numbers Operation, 2 Domain Elements Are in Membership Relation if Corresponding Images Are in Same Relation

<The previous article in this series | The table of contents of this series | The next article in this series>

A description/proof of that for monotone ordinal numbers operation, 2 domain elements are in membership relation if corresponding images are in same relation

Topics


About: set

The table of contents of this article


Starting Context



Target Context


  • The reader will have a description and a proof of the proposition that for any monotone operation from the ordinal numbers collection into the ordinal numbers collection, any 2 domain elements are in a membership relation if the corresponding images are in the same membership relation.

Orientation


There is a list of definitions discussed so far in this site.

There is a list of propositions discussed so far in this site.


Main Body


1: Description


For any monotone operation, f:OO where O is the ordinal numbers collection, and any 2 domain elements, o1,o2O, o1o2 if f(o1)f(o2); o1=o2 if f(o1)=f(o2).


2: Proof


Let us suppose that f(o1)f(o2). Let us suppose that ¬o1o2. By the trichotomy of the membership relation on the ordinal numbers collection, o1=o2 or o2o1. If o1=o2, f(o1)=f(o2), a contradiction against f(o1)f(o2), by the trichotomy of the membership relation on the ordinal numbers collection. If o2o1, f(o2)f(o1), a contradiction against f(o1)f(o2), by the trichotomy of the membership relation on the ordinal numbers collection. So, o1o2.

Let us suppose that f(o1)=f(o2). Let us suppose that o1o2. By the trichotomy of the membership relation on the ordinal numbers collection, o1o2 or o2o1. If o1o2, f(o1)f(o2), a contradiction against f(o1)=f(o2), by the trichotomy of the membership relation on the ordinal numbers collection. If o2o1, f(o2)f(o1), a contradiction against f(o1)=f(o2), by the trichotomy of the membership relation on the ordinal numbers collection. So, o1=o2.


References


<The previous article in this series | The table of contents of this series | The next article in this series>