(**************************************************************)
(*   Copyright Dominique Larchey-Wendling [*]                 *)
(*                                                            *)
(*                             [*] Affiliation LORIA -- CNRS  *)
(**************************************************************)
(*      This file is distributed under the terms of the       *)
(*         CeCILL v2 FREE SOFTWARE LICENSE AGREEMENT          *)
(**************************************************************)
From Undecidability.MinskyMachines
From Undecidability.ILL
From Undecidability.Shared.Libs.DLW
From Undecidability.Synthetic
Set Implicit Arguments.
Local Infix "~p" := (@Permutation _) (at level 70).
Local Notation "X ⊆ Y" := (forall a, X a -> Y a : Prop) (at level 70).
Local Infix "∊" := In (at level 70).
Local Reserved Notation "'⟦' A '⟧'" (at level 1, format "⟦ A ⟧").
Local Fact pair_plus x1 y1 x2 y2 :
vec_plus (x1##y1##vec_nil) (x2##y2##vec_nil)
= (x1+x2)##(y1+y2)##vec_nil.
Notation "Γ ⊢ A" := (S_imsell bang_le U Γ A) (at level 70).

Theorem ndmm2_imsell_weak c Σ x y p :
In c Σ
->  ndmm2_imsell_ctx Σ x y ⊢ £p
<-> (![∞]⟬c⟭)::ndmm2_imsell_ctx Σ x y ++ nil ⊢ £p.