fact: Definition checkPrfFA2 (p recs : nat) := let A := car (cdr (cdr p)) in let v := cdr (cdr (cdr p)) in (1 - codeIn v (codeFreeVarFormula A)) * charFunction 2 Nat.eqb (cPair 1 (cPair A (cPair 3 (cPair v A)))) (car p).
imports: Coq(Arith Lia) hydras.Ackermann(primRec codeFreeVar codeSubFormula cPair code folProp extEqualNat wellFormed folProof prLogic) hydras(Compat815)