fact: Hypothesis (HQ0 : out_code (fst se) P -> Q se) (HQ1 : forall i ρ v j w, (i,ρ::nil) <sc P -> ρ // (i,v) -1> (j,w) -> P // (j,w) ~~> se -> Q (j,w) -> Q (i,v)).
imports: List Arith Lia Undecidability.Shared.Libs.DLW(utils pos vec subcode sss)