#n #c1 #c2 #H1 #H2 >(plus_n_O n) /2 width=1 by isrt_plus/
qed.
-lemma isrt_succ: â\88\80n,c. ð\9d\90\91ð\9d\90\93â¦\83n, câ¦\84 â\86\92 ð\9d\90\91ð\9d\90\93â¦\83⫯n, c+𝟘𝟙⦄.
+lemma isrt_succ: â\88\80n,c. ð\9d\90\91ð\9d\90\93â¦\83n, câ¦\84 â\86\92 ð\9d\90\91ð\9d\90\93â¦\83â\86\91n, c+𝟘𝟙⦄.
/2 width=1 by isrt_plus/ qed.
(* Inversion properties with test for constrained rt-transition counter *****)
qed-.
lemma isrt_inv_plus_SO_dx: ∀n,c1,c2. 𝐑𝐓⦃n, c1 + c2⦄ → 𝐑𝐓⦃1, c2⦄ →
- â\88\83â\88\83m. ð\9d\90\91ð\9d\90\93â¦\83m, c1â¦\84 & n = ⫯m.
+ â\88\83â\88\83m. ð\9d\90\91ð\9d\90\93â¦\83m, c1â¦\84 & n = â\86\91m.
#n #c1 #c2 #H #H2
elim (isrt_inv_plus … H) -H #n1 #n2 #Hn1 #Hn2 #H destruct
lapply (isrt_inj … Hn2 H2) -c2 #H destruct