proposition: Lemma enc_derivations_solutions B n rho a b : (a .: b .: M_enc_derivations B n .: numeral n .: rho) ⊨ solutions B $2 $3.
proof: Proof. Proof using VIEQ M_ZF. cbn. split. - rewrite eval_enc_stack. apply enc_derivations_base. - intros k x x' H1 H2 H3. destruct (enc_derivations_el H2) as [l[-> ->]]. specialize (enc_derivations_step B H1). replace (M_enc_stack (derivations B (S l))) with x'; trivial. apply (enc_stack_combinations H3); trivial. Qed.
imports: Undecidability.FOL.ZF Undecidability.FOL.Syntax.Facts Undecidability.FOL.Semantics.Tarski.FullFacts Undecidability.FOL.Sets.ZF Lia Undecidability.PCP(PCP Util.PCP_facts Reductions.PCPb_iff_dPCPb) Undecidability(Shared.ListAutomation)