proposition: Lemma prv_transport_to_class A phi : A ⊢ phi -> A ⊢C phi.
proof: Proof. induction 1. - now apply II. - eapply IE. 1: apply IHprv1. easy. - now apply AllI. - now apply AllE. - now apply Exp. - now apply Ctx. - apply Pc. Qed.
imports: Undecidability.Synthetic(Definitions DecidabilityFacts EnumerabilityFacts ListEnumerabilityFacts ReducibilityFacts) Undecidability.FOL(Syntax.Facts Syntax.Theories Syntax.Asimpl) Undecidability(Shared.ListAutomation) Lia EqdepFacts