let fp be FinSequence of NAT ; :: thesis: for a being Nat
for b being Element of NAT st a in dom fp & b in dom fp & a <> b & len fp >= 1 holds
fp . b divides Product (Del fp,a)

let a be Nat; :: thesis: for b being Element of NAT st a in dom fp & b in dom fp & a <> b & len fp >= 1 holds
fp . b divides Product (Del fp,a)

let b be Element of NAT ; :: thesis: ( a in dom fp & b in dom fp & a <> b & len fp >= 1 implies fp . b divides Product (Del fp,a) )
assume that
A1: a in dom fp and
A2: b in dom fp and
A3: a <> b and
A4: len fp >= 1 ; :: thesis: fp . b divides Product (Del fp,a)
consider n being Nat such that
A5: len fp = n + 1 by A4, NAT_1:6;
A6: a <= n + 1 by A1, A5, FINSEQ_3:27;
A7: a >= 1 by A1, FINSEQ_3:27;
A8: b >= 1 by A2, FINSEQ_3:27;
A9: (len (Del fp,a)) + 1 = n + 1 by A1, A5, WSIERP_1:def 1;
A10: b <= n + 1 by A2, A5, FINSEQ_3:27;
per cases ( a <= n or a = n + 1 ) by A6, NAT_1:8;
end;