proposition: Lemma Fin_L_R_neq n m (p : Fin.t n) (q : Fin.t m) : Fin.L m p <> Fin.R n q.
proof: Proof. elim: n p m q. - by apply: Fin.case0. - move=> n IH /= p. move: n p IH. apply: Fin.caseS; [done|]. move=> > IH > /= /pos_nxt_inj. by apply: IH. Qed.
imports: Undecidability(MinskyMachines.MM MinskyMachines.MMA L.L) Undecidability.Shared.Libs.DLW(Vec.pos Vec.vec Code.sss Code.subcode) Undecidability(MinskyMachines.Util.MMA_pairing L.AbstractMachines.wCBV) PeanoNat List Lia Wf_nat ssreflect ssrbool ssrfun