fact: Definition codeInductionSchema (f : nat) : bool := let n := car (cdr (cddddr (codeOpen f))) in let g := cdr (cdr (cddddr (codeOpen f))) in Nat.eqb (codeClose (codeImp (codeSubFormula g n (codeTerm Zero)) (codeImp (codeForall n (codeImp g (codeSubFormula g n (codeTerm (Succ (var n)))))) (codeForall n g)))) f.
imports: Coq(Ensembles List Arith Lia) hydras(primRec cPair folProp code codeList codeFreeVar extEqualNat prLogic codeNatToTerm Compat815) hydras.Ackermann(PA codeSubFormula)