Description: Lemma for cantnf . This part of the proof is showing uniqueness of the Cantor normal form. We already know that the relation T is a strict order, but we haven't shown it is a well-order yet. But being a strict order is enough to show that two distinct F , G are T -related as F < G or G < F , and WLOG assuming that F < G , we show that CNF respects this order and maps these two to different ordinals. (Contributed by Mario Carneiro, 28-May-2015) (Revised by AV, 2-Jul-2019)
Ref | Expression | ||
---|---|---|---|
Hypotheses | cantnfs.s | |
|
cantnfs.a | |
||
cantnfs.b | |
||
oemapval.t | |
||
oemapval.f | |
||
oemapval.g | |
||
oemapvali.r | |
||
oemapvali.x | |
||
cantnflem1.o | |
||
cantnflem1.h | |
||
Assertion | cantnflem1 | |