proposition: Lemma binnat_toR_unique (h : binnat -> R) `{!IsSemiRingPreserving h} : forall x, toR x = h x.
proof: Proof. equiv_intro binary n. rewrite f_nat; unfold Compose. rewrite eissect. refine (toR_unique (h ∘ binary) n). Qed.
imports: HoTT.Spaces.Nat HoTT.Tactics HoTT.Classes.interfaces.abstract_algebra HoTT.Classes.interfaces.naturals HoTT.Classes.interfaces.orders HoTT.Classes.implementations.peano_naturals HoTT.Classes.theory.rings HoTT.Classes.orders.semirings HoTT.Classes.theory.apartness