let X be non empty set ; :: thesis: for F, G being Functional_Sequence of X,ExtREAL
for D being set st F is additive & ( for n being Nat holds G . n = (F . n) | D ) holds
G is additive
let F, G be Functional_Sequence of X,ExtREAL ; :: thesis: for D being set st F is additive & ( for n being Nat holds G . n = (F . n) | D ) holds
G is additive
let D be set ; :: thesis: ( F is additive & ( for n being Nat holds G . n = (F . n) | D ) implies G is additive )
assume that
A1: F is additive and
A2: for n being Nat holds G . n = (F . n) | D ; :: thesis: G is additive
let n, m be Nat; :: according to MESFUNC9:def 5 :: thesis: ( n <> m implies for x being set holds
( not x in (dom (G . n)) /\ (dom (G . m)) or (G . n) . x <> +infty or (G . m) . x <> -infty ) )
assume n <> m ; :: thesis: for x being set holds
( not x in (dom (G . n)) /\ (dom (G . m)) or (G . n) . x <> +infty or (G . m) . x <> -infty )
let x be set ; :: thesis: ( not x in (dom (G . n)) /\ (dom (G . m)) or (G . n) . x <> +infty or (G . m) . x <> -infty )
assume A4: x in (dom (G . n)) /\ (dom (G . m)) ; :: thesis: ( (G . n) . x <> +infty or (G . m) . x <> -infty )
A5: ( G . n = (F . n) | D & G . m = (F . m) | D ) by A2;
then ( dom (G . n) c= dom (F . n) & dom (G . m) c= dom (F . m) ) by RELAT_1:89;
then (dom (G . n)) /\ (dom (G . m)) c= (dom (F . n)) /\ (dom (F . m)) by XBOOLE_1:27;
then A6: ( (F . n) . x <> +infty or (F . m) . x <> -infty ) by A1, A4, Def1a;
( x in dom (G . n) & x in dom (G . m) ) by A4, XBOOLE_0:def 4;
hence ( (G . n) . x <> +infty or (G . m) . x <> -infty ) by A6, A5, FUNCT_1:70; :: thesis: verum