Fortunately, the convertibility rule happens to be implemented quite efficiently in Coq [1,2], so it becomes possible to automatically prove some propositions on real numbers by simply evaluating programs.