Cantor's isomorphism theorem (countable dense linear orders)
ProvedFamousTheorems.cantor_isomorphism_theoremCantor's isomorphism theorem. Any two countable dense linear orders without endpoints are order-isomorphic. In particular every such order is isomorphic to .
Cantor's proof (in its back-and-forth form, due to Huntington and Hausdorff) is the prototype of the back-and-forth method of model theory. The theorem shows that the theory of dense linear orders without endpoints is -categorical and hence complete.
Formalization note. Mathlib's Order.iso_of_countable_dense. Density is DenselyOrdered, absence of endpoints is NoMinOrder/NoMaxOrder, and nonemptiness is required.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem cantor_isomorphism_theorem (α β : Type*) [LinearOrder α] [LinearOrder β] [Countable α] [DenselyOrdered α] [NoMinOrder α]
[NoMaxOrder α] [Nonempty α] [Countable β] [DenselyOrdered β] [NoMinOrder β] [NoMaxOrder β] [Nonempty β] :
Nonempty (α ≃o β) := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Order.iso_of_countable_dense`. Proof here reduces to that Mathlib result.