proposition: Fact eill_no_bot c : ~ ill_has_bot ⦑ c ⦒.
proof: Proof. induction c; simpl; tauto. Qed.
imports: List Permutation Arith Undecidability.Shared.Libs.DLW(utils pos vec) Undecidability.ILL(ILL EILL ill) Undecidability.ILL(CLL ill_cll schellinx)