fact: Definition Σ0 := LL_INC (q k) (q k) (q k) :: map (fun c => LL_DEC (rx (fst c)) (ry (snd c)) (ry (snd c))) (pos_not_diag n) ++ map (fun j => LL_INC (ry j) (ry j) (ry j)) (pos_list n).
imports: List Permutation Arith Lia Undecidability.Shared.Libs.DLW(utils pos vec subcode sss) Undecidability.MinskyMachines.MM(mm_defs mm_utils) Undecidability.ILL(ILL EILL ill eill)