fact: Variables (linker : nat -> nat) (P : nat * list X) (Q : nat * list Y) (HPQ : forall i ρ, (i,[ρ]) <sc P -> (linker i, icomp linker i ρ) <sc Q /\ linker (1+i) = ilen ρ + linker i).
imports: List Arith Lia Undecidability.Shared.Libs.DLW.Utils(utils) Undecidability.Shared.Libs.DLW.Code(subcode sss compiler)