let n be Element of NAT ; :: thesis: for x being Element of COMPLEX n
for A, B being Subset of (COMPLEX n) st A <> {} & B <> {} holds
(dist x,A) + (dist x,B) >= dist A,B
let x be Element of COMPLEX n; :: thesis: for A, B being Subset of (COMPLEX n) st A <> {} & B <> {} holds
(dist x,A) + (dist x,B) >= dist A,B
let A, B be Subset of (COMPLEX n); :: thesis: ( A <> {} & B <> {} implies (dist x,A) + (dist x,B) >= dist A,B )
assume A1:
( A <> {} & B <> {} )
; :: thesis: (dist x,A) + (dist x,B) >= dist A,B
defpred S1[ set , set ] means ( $1 in A & $2 in B );
defpred S2[ set ] means $1 in A;
defpred S3[ set ] means $1 in B;
deffunc H1( Element of COMPLEX n, Element of COMPLEX n) -> Real = |.($1 - $2).|;
deffunc H2( Element of COMPLEX n) -> Real = |.(x - $1).|;
reconsider X = { H2(z) where z is Element of COMPLEX n : S2[z] } as Subset of REAL from COMPLSP1:sch 1();
reconsider Y = { H2(z) where z is Element of COMPLEX n : S3[z] } as Subset of REAL from COMPLSP1:sch 1();
reconsider Z = { H1(z1,z) where z1, z is Element of COMPLEX n : S1[z1,z] } as Subset of REAL from COMPLSP1:sch 2();
consider z1 being Element of COMPLEX n such that
A2:
z1 in A
by A1, SUBSET_1:10;
consider z2 being Element of COMPLEX n such that
A3:
z2 in B
by A1, SUBSET_1:10;
( |.(x - z1).| in X & |.(x - z2).| in Y )
by A2, A3;
then A4:
|.(x - z1).| + |.(x - z2).| in X + Y
;
A5:
Z is bounded_below
A6:
( X <> {} & X is bounded_below )
A7:
( Y <> {} & Y is bounded_below )
then A13:
lower_bound (X + Y) >= lower_bound Z
by A4, A5, Th97;
( lower_bound X = dist x,A & lower_bound Y = dist x,B & lower_bound Z = dist A,B )
by Def18, Def20;
hence
(dist x,A) + (dist x,B) >= dist A,B
by A6, A7, A13, Th96; :: thesis: verum