let A be set ; for f being FinSequence of bool A st ( for i being Element of NAT st 1 <= i & i < len f holds
f /. i c= f /. (i + 1) ) holds
for i, j being Element of NAT st 1 <= i & j <= len f & f /. j c= f /. i holds
for k being Element of NAT st i <= k & k <= j holds
f /. j = f /. k
let f be FinSequence of bool A; ( ( for i being Element of NAT st 1 <= i & i < len f holds
f /. i c= f /. (i + 1) ) implies for i, j being Element of NAT st 1 <= i & j <= len f & f /. j c= f /. i holds
for k being Element of NAT st i <= k & k <= j holds
f /. j = f /. k )
assume A1:
for i being Element of NAT st 1 <= i & i < len f holds
f /. i c= f /. (i + 1)
; for i, j being Element of NAT st 1 <= i & j <= len f & f /. j c= f /. i holds
for k being Element of NAT st i <= k & k <= j holds
f /. j = f /. k
let i, j be Element of NAT ; ( 1 <= i & j <= len f & f /. j c= f /. i implies for k being Element of NAT st i <= k & k <= j holds
f /. j = f /. k )
assume that
A2:
1 <= i
and
A3:
j <= len f
and
A4:
f /. j c= f /. i
; for k being Element of NAT st i <= k & k <= j holds
f /. j = f /. k
let k be Element of NAT ; ( i <= k & k <= j implies f /. j = f /. k )
assume that
A5:
i <= k
and
A6:
k <= j
; f /. j = f /. k
1 <= k
by A2, A5, XXREAL_0:2;
then A7:
f /. k c= f /. j
by A1, A3, A6, Th1;
defpred S1[ Element of NAT ] means ( i + $1 <= j implies f /. j c= f /. (i + $1) );
A8:
now let k be
Element of
NAT ;
( S1[k] implies S1[k + 1] )assume A9:
S1[
k]
;
S1[k + 1]A10:
(i + k) + 1
= i + (k + 1)
;
thus
S1[
k + 1]
verum end;
A13:
S1[ 0 ]
by A4;
A14:
for k being Element of NAT holds S1[k]
from NAT_1:sch 1(A13, A8);
consider m being Nat such that
A15:
k = i + m
by A5, NAT_1:10;
reconsider m = m as Element of NAT by ORDINAL1:def 12;
k = i + m
by A15;
then
f /. j c= f /. k
by A14, A6;
hence
f /. j = f /. k
by A7, XBOOLE_0:def 10; verum