fact: Fixpoint Fr {ff} (phi : @form Σ_funcs Σ_preds _ ff) : @form Σ_funcs extended_preds _ falsity_off := match phi with | falsity => Q | atom P v => dn Q (@atom _ _ _ falsity_off (old_preds P) v) | bin Impl phi psi => (Fr phi) → (Fr psi) | bin Conj phi psi => (Fr phi) ∧ (Fr psi) | bin Disj phi psi => dn Q ((Fr phi) ∨ (Fr psi)) | quant All phi => ∀ (Fr phi) | quant Ex phi => dn Q (∃ (Fr phi)) end.
imports: List Lia Undecidability(Shared.ListAutomation) Undecidability.FOL(FullSyntax) Undecidability.FOL.Arithmetics(Robinson NatModel)