defpred S₁[ Nat] means OddFibs ((2 * $1) + 3) = (OddFibs ((2 * $1) + 1)) ^ <*(Fib ((2 * $1) + 3))*>;
let n be Nat; :: thesis: OddFibs ((2 * n) + 3) = (OddFibs ((2 * n) + 1)) ^ <*(Fib ((2 * n) + 3))*>
A1: for k being Nat st S₁[k] holds
S₁[k + 1]

proof

let k be Nat; :: thesis: ( S₁[k] implies S₁[k + 1] )
reconsider ARR = {[1,(FIB . ((2 * k) + 5))]} as FinSubsequence by Th19;
assume S₁[k] ; :: thesis: S₁[k + 1]
set LEFTk = OddFibs ((2 * (k + 1)) + 3);
set RIGHTk = (OddFibs ((2 * (k + 1)) + 1)) ^ <*(Fib ((2 * (k + 1)) + 3))*>;
reconsider RS = FIB | (OddNAT /\ (Seg ((2 * k) + 3))) as FinSubsequence ;
set RR = ((2 * k) + 4) Shift ARR;
A2: (2 * k) + 4 > (2 * k) + 3 by XREAL_1:8;
( dom RS c= OddNAT /\ (Seg ((2 * k) + 3)) & OddNAT /\ (Seg ((2 * k) + 3)) c= Seg ((2 * k) + 3) ) by RELAT_1:87, XBOOLE_1:17;
then consider p1 being FinSequence such that
A3: RS c= p1 and
A4: dom p1 = Seg ((2 * k) + 4) by A2, Th21, XBOOLE_1:1;
A5: ex p2 being FinSequence st ARR c= p2 by Th22;
1 + ((2 * k) + 4) = (2 * k) + 5 ;
then A6: ((2 * k) + 4) Shift ARR = {[((2 * k) + 5),(FIB . ((2 * k) + 5))]} by Th20;
len p1 = (2 * k) + 4 by A4, FINSEQ_1:def 3;
then consider RSR being FinSubsequence such that
A7: RSR = RS \/ (((2 * k) + 4) Shift ARR) and
A8: (Seq RS) ^ (Seq ARR) = Seq RSR by A3, A5, PNPROC_1:82;
(OddFibs ((2 * (k + 1)) + 1)) ^ <*(Fib ((2 * (k + 1)) + 3))*> = (Seq (FIB | (OddNAT /\ (Seg ((2 * k) + 3))))) ^ <*(FIB . ((2 * k) + 5))*> by Def2
.= Seq RSR by A8, PNPROC_1:3
.= OddFibs ((2 * (k + 1)) + 3) by A7, A6, Th65 ;
hence S₁[k + 1] ; :: thesis: verum

end;

A9: S₁[ 0 ] by Th24, Th62, Th63;
for k being Nat holds S₁[k] from NAT_1:sch 2(A9, A1);
hence OddFibs ((2 * n) + 3) = (OddFibs ((2 * n) + 1)) ^ <*(Fib ((2 * n) + 3))*> ; :: thesis: verum