proposition: Fact ill_perm_tps Γ Δ : Γ ~p Δ -> forall x A, [< Γ |- A >] x -> [< Δ |- A >] x.
proof: Proof. intros H1 x B; unfold ill_sequent_tps. intros H2 a H3. apply H2; revert H3. apply ill_tps_perm, Permutation_sym; auto. Qed.
imports: List Permutation Arith Lia Undecidability.Shared.Libs.DLW(utils pos vec) Undecidability.ILL(ILL)