From Undecidability.TM Require Import TM Util.TM_facts HoareLogic HoareRegister.

Lemma RealiseIntroAll sig F n X (P : forall _ _ _ _, Prop) (M : pTM sig F n):
(forall x, M ⊨ (fun tin '(yout, tout) => P x tin yout tout)) ->
M ⊨ (fun tin '(yout, tout) => forall (x:X), P x tin yout tout).