The Setting
Let be a set and a binary relation on ; for , the points with are the -predecessors of . When is well-founded, its Mostowski collapse is the map from to the sets defined by recursion along : is the set of the values for the -predecessors of . Two questions are asked of : when it is one-to-one, and how high in the von Neumann hierarchy its values lie when every point of carries an ordinal that drops along .
Extensional Relations and Ordinal Tags
A relation on a set is extensional when any two points of with the same -predecessors are equal: (1)
A system of ordinal tags for a relation on a set is a function from to the ordinals that strictly decreases along : The ordinal is the tag of .
The Claim
Theorem 1. Let be a relation on a set . If is a system of ordinal tags for , then is well-founded: $$\rho \text{ satisfies } \eqref{eq:tags} \implies R \text{ is well-founded}.$$(3)✦ Let be well-founded, and let be its Mostowski collapse. For every , (4)✦ If is extensional, then for all , (5)✦ If is a system of ordinal tags for , then for every , (6)✦ If is extensional and is a system of ordinal tags for whose values all lie below an ordinal , then (7)✦
In the paper, the result reads: for a set with an extensional relation and a function with , there is an injection with and .
What Is Checked
The claim is stated over the Mostowski collapse of a well-founded relation on a set , under the hypotheses that is extensional and that it has a system of ordinal tags , bounded by an ordinal for the injection into .