Section Code_PA.
Let codeTerm := codeTerm LNT codeLNTFunction.
Let codeFormula := codeFormula LNT codeLNTFunction codeLNTRelation.
Let codeFormulaInj :=
codeFormulaInj LNT codeLNTFunction codeLNTRelation codeLNTFunctionInj
codeLNTRelationInj.
Definition codeOpen : nat -> nat :=
evalStrongRec 0
(fun f recs : nat =>
switchPR (cPairPi1 f)
(switchPR (pred (cPairPi1 f))
(switchPR (pred (pred (cPairPi1 f)))
(switchPR (pred (pred (pred (cPairPi1 f)))) f
(codeNth (f - S (cPairPi2 (cPairPi2 f))) recs)) f) f) f).
Definition codeInductionSchema (f : nat) : bool :=
let n :=
cPairPi1
(cPairPi2 (cPairPi2 (cPairPi2 (cPairPi2 (cPairPi2 (codeOpen f)))))) in
let g :=
cPairPi2
(cPairPi2 (cPairPi2 (cPairPi2 (cPairPi2 (cPairPi2 (codeOpen f)))))) in
beq_nat
(codeClose
(codeImp (codeSubFormula g n (codeTerm Zero))
(codeImp
(codeForall n
(codeImp g (codeSubFormula g n (codeTerm (Succ (var n))))))
(codeForall n g)))) f.

Lemma codeInductionSchemaCorrect3 :
forall f : Formula,
~ InductionSchema f -> codeInductionSchema (codeFormula f) = false.