let D be non empty set ; :: thesis: for H being Functional_Sequence of D,REAL
for X being set st H is_unif_conv_on X holds
H is_point_conv_on X
let H be Functional_Sequence of D,REAL ; :: thesis: for X being set st H is_unif_conv_on X holds
H is_point_conv_on X
let X be set ; :: thesis: ( H is_unif_conv_on X implies H is_point_conv_on X )
assume A1: H is_unif_conv_on X ; :: thesis: H is_point_conv_on X

A2: now

consider f being PartFunc of D,REAL such that
A3: X = dom f and
A4: for p being Real st p > 0 holds
ex k being Element of NAT st
for n being Element of NAT
for x being Element of D st n >= k & x in X holds
abs (((H . n) . x) - (f . x)) < p by A1, Def13;
take f = f; :: thesis: ( X = dom f & ( for x being Element of D st x in X holds
for p being Real st p > 0 holds
ex k being Element of NAT st
for n being Element of NAT st n >= k holds
abs (((H . n) . x) - (f . x)) < p ) )
thus X = dom f by A3; :: thesis: for x being Element of D st x in X holds
for p being Real st p > 0 holds
ex k being Element of NAT st
for n being Element of NAT st n >= k holds
abs (((H . n) . x) - (f . x)) < p
let x be Element of D; :: thesis: ( x in X implies for p being Real st p > 0 holds
ex k being Element of NAT st
for n being Element of NAT st n >= k holds
abs (((H . n) . x) - (f . x)) < p )
assume A5: x in X ; :: thesis: for p being Real st p > 0 holds
ex k being Element of NAT st
for n being Element of NAT st n >= k holds
abs (((H . n) . x) - (f . x)) < p
let p be Real; :: thesis: ( p > 0 implies ex k being Element of NAT st
for n being Element of NAT st n >= k holds
abs (((H . n) . x) - (f . x)) < p )
assume p > 0 ; :: thesis: ex k being Element of NAT st
for n being Element of NAT st n >= k holds
abs (((H . n) . x) - (f . x)) < p
then consider k being Element of NAT such that
A6: for n being Element of NAT
for x being Element of D st n >= k & x in X holds
abs (((H . n) . x) - (f . x)) < p by A4;
take k = k; :: thesis: for n being Element of NAT st n >= k holds
abs (((H . n) . x) - (f . x)) < p
let n be Element of NAT ; :: thesis: ( n >= k implies abs (((H . n) . x) - (f . x)) < p )
assume n >= k ; :: thesis: abs (((H . n) . x) - (f . x)) < p
hence abs (((H . n) . x) - (f . x)) < p by A5, A6; :: thesis: verum

end;

X common_on_dom H by A1, Def13;
hence H is_point_conv_on X by A2, Def12; :: thesis: verum