let p, p1, q be Point of (TOP-REAL 2); for r being Real
for u being Point of (Euclid 2) st not p1 in Ball (u,r) & q in Ball (u,r) & p in Ball (u,r) & not p in LSeg (p1,q) & ( ( q `1 = p `1 & q `2 <> p `2 ) or ( q `1 <> p `1 & q `2 = p `2 ) ) & ( p1 `1 = q `1 or p1 `2 = q `2 ) holds
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}
let r be Real; for u being Point of (Euclid 2) st not p1 in Ball (u,r) & q in Ball (u,r) & p in Ball (u,r) & not p in LSeg (p1,q) & ( ( q `1 = p `1 & q `2 <> p `2 ) or ( q `1 <> p `1 & q `2 = p `2 ) ) & ( p1 `1 = q `1 or p1 `2 = q `2 ) holds
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}
let u be Point of (Euclid 2); ( not p1 in Ball (u,r) & q in Ball (u,r) & p in Ball (u,r) & not p in LSeg (p1,q) & ( ( q `1 = p `1 & q `2 <> p `2 ) or ( q `1 <> p `1 & q `2 = p `2 ) ) & ( p1 `1 = q `1 or p1 `2 = q `2 ) implies (LSeg (p1,q)) /\ (LSeg (q,p)) = {q} )
assume that
A1:
not p1 in Ball (u,r)
and
A2:
q in Ball (u,r)
and
A3:
p in Ball (u,r)
and
A4:
not p in LSeg (p1,q)
; ( ( not ( q `1 = p `1 & q `2 <> p `2 ) & not ( q `1 <> p `1 & q `2 = p `2 ) ) or ( not p1 `1 = q `1 & not p1 `2 = q `2 ) or (LSeg (p1,q)) /\ (LSeg (q,p)) = {q} )
assume A5:
( ( q `1 = p `1 & q `2 <> p `2 ) or ( q `1 <> p `1 & q `2 = p `2 ) )
; ( ( not p1 `1 = q `1 & not p1 `2 = q `2 ) or (LSeg (p1,q)) /\ (LSeg (q,p)) = {q} )
assume A6:
( p1 `1 = q `1 or p1 `2 = q `2 )
; (LSeg (p1,q)) /\ (LSeg (q,p)) = {q}
A8:
p = |[(p `1),(p `2)]|
by EUCLID:53;
A9:
p1 = |[(p1 `1),(p1 `2)]|
by EUCLID:53;
A10:
q = |[(q `1),(q `2)]|
by EUCLID:53;
A11:
LSeg (p,q) c= Ball (u,r)
by A2, A3, Th21;
now (LSeg (p1,q)) /\ (LSeg (q,p)) = {q}per cases
( ( q `1 = p `1 & q `2 <> p `2 ) or ( q `1 <> p `1 & q `2 = p `2 ) )
by A5;
suppose A12:
(
q `1 = p `1 &
q `2 <> p `2 )
;
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}set r =
p `1 ;
set pq =
{ p2 where p2 is Point of (TOP-REAL 2) : ( p2 `1 = p `1 & p `2 <= p2 `2 & p2 `2 <= q `2 ) } ;
set qp =
{ p3 where p3 is Point of (TOP-REAL 2) : ( p3 `1 = p `1 & q `2 <= p3 `2 & p3 `2 <= p `2 ) } ;
set pp1 =
{ p11 where p11 is Point of (TOP-REAL 2) : ( p11 `1 = p `1 & p `2 <= p11 `2 & p11 `2 <= p1 `2 ) } ;
set p1p =
{ p22 where p22 is Point of (TOP-REAL 2) : ( p22 `1 = p `1 & p1 `2 <= p22 `2 & p22 `2 <= p `2 ) } ;
set qp1 =
{ q1 where q1 is Point of (TOP-REAL 2) : ( q1 `1 = p `1 & q `2 <= q1 `2 & q1 `2 <= p1 `2 ) } ;
set p1q =
{ q2 where q2 is Point of (TOP-REAL 2) : ( q2 `1 = p `1 & p1 `2 <= q2 `2 & q2 `2 <= q `2 ) } ;
now (LSeg (p1,q)) /\ (LSeg (q,p)) = {q}per cases
( q `2 > p `2 or q `2 < p `2 )
by A12, XXREAL_0:1;
suppose A13:
q `2 > p `2
;
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}now (LSeg (p1,q)) /\ (LSeg (q,p)) = {q}per cases
( ( p1 `1 = q `1 & p1 `2 <> q `2 ) or ( p1 `1 <> q `1 & p1 `2 = q `2 ) )
by A7;
suppose A14:
(
p1 `1 = q `1 &
p1 `2 <> q `2 )
;
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}now ( ( p1 `2 > q `2 & (LSeg (p1,q)) /\ (LSeg (q,p)) = {q} ) or ( p1 `2 < q `2 & contradiction ) )per cases
( p1 `2 > q `2 or p1 `2 < q `2 )
by A14, XXREAL_0:1;
case A15:
p1 `2 > q `2
;
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}then
q in { p11 where p11 is Point of (TOP-REAL 2) : ( p11 `1 = p `1 & p `2 <= p11 `2 & p11 `2 <= p1 `2 ) }
by A12, A13;
then
q in LSeg (
p,
p1)
by A8, A9, A12, A13, A14, A15, Th9, XXREAL_0:2;
hence
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}
by TOPREAL1:8;
verum end; case A16:
p1 `2 < q `2
;
contradictionnow contradictionper cases
( p1 `2 > p `2 or p1 `2 = p `2 or p1 `2 < p `2 )
by XXREAL_0:1;
suppose A17:
p1 `2 > p `2
;
contradictionthen
p1 in { p2 where p2 is Point of (TOP-REAL 2) : ( p2 `1 = p `1 & p `2 <= p2 `2 & p2 `2 <= q `2 ) }
by A12, A14, A16;
then
p1 in LSeg (
p,
q)
by A8, A10, A12, A16, A17, Th9, XXREAL_0:2;
hence
contradiction
by A1, A11;
verum end; end; end; hence
contradiction
;
verum end; end; end; hence
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}
;
verum end; end; end; hence
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}
;
verum end; suppose A18:
q `2 < p `2
;
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}now (LSeg (p1,q)) /\ (LSeg (q,p)) = {q}per cases
( ( p1 `1 = q `1 & p1 `2 <> q `2 ) or ( p1 `1 <> q `1 & p1 `2 = q `2 ) )
by A7;
suppose A19:
(
p1 `1 = q `1 &
p1 `2 <> q `2 )
;
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}now ( ( p1 `2 > q `2 & contradiction ) or ( p1 `2 < q `2 & (LSeg (p1,q)) /\ (LSeg (q,p)) = {q} ) )per cases
( p1 `2 > q `2 or p1 `2 < q `2 )
by A19, XXREAL_0:1;
case A20:
p1 `2 > q `2
;
contradictionhence
contradiction
;
verum end; case A21:
p1 `2 < q `2
;
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}then
q in { p22 where p22 is Point of (TOP-REAL 2) : ( p22 `1 = p `1 & p1 `2 <= p22 `2 & p22 `2 <= p `2 ) }
by A12, A18;
then
q in LSeg (
p1,
p)
by A8, A9, A12, A18, A19, A21, Th9, XXREAL_0:2;
hence
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}
by TOPREAL1:8;
verum end; end; end; hence
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}
;
verum end; end; end; hence
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}
;
verum end; end; end; hence
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}
;
verum end; suppose A22:
(
q `1 <> p `1 &
q `2 = p `2 )
;
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}set r =
p `2 ;
set pq =
{ p2 where p2 is Point of (TOP-REAL 2) : ( p2 `2 = p `2 & p `1 <= p2 `1 & p2 `1 <= q `1 ) } ;
set qp =
{ p3 where p3 is Point of (TOP-REAL 2) : ( p3 `2 = p `2 & q `1 <= p3 `1 & p3 `1 <= p `1 ) } ;
set pp1 =
{ p11 where p11 is Point of (TOP-REAL 2) : ( p11 `2 = p `2 & p `1 <= p11 `1 & p11 `1 <= p1 `1 ) } ;
set p1p =
{ p22 where p22 is Point of (TOP-REAL 2) : ( p22 `2 = p `2 & p1 `1 <= p22 `1 & p22 `1 <= p `1 ) } ;
set qp1 =
{ q1 where q1 is Point of (TOP-REAL 2) : ( q1 `2 = p `2 & q `1 <= q1 `1 & q1 `1 <= p1 `1 ) } ;
set p1q =
{ q2 where q2 is Point of (TOP-REAL 2) : ( q2 `2 = p `2 & p1 `1 <= q2 `1 & q2 `1 <= q `1 ) } ;
now (LSeg (p1,q)) /\ (LSeg (q,p)) = {q}per cases
( q `1 > p `1 or q `1 < p `1 )
by A22, XXREAL_0:1;
suppose A23:
q `1 > p `1
;
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}now (LSeg (p1,q)) /\ (LSeg (q,p)) = {q}per cases
( ( p1 `1 = q `1 & p1 `2 <> q `2 ) or ( p1 `1 <> q `1 & p1 `2 = q `2 ) )
by A7;
suppose A24:
(
p1 `1 <> q `1 &
p1 `2 = q `2 )
;
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}now ( ( p1 `1 > q `1 & (LSeg (p1,q)) /\ (LSeg (q,p)) = {q} ) or ( p1 `1 < q `1 & contradiction ) )per cases
( p1 `1 > q `1 or p1 `1 < q `1 )
by A24, XXREAL_0:1;
case A25:
p1 `1 > q `1
;
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}then
q in { p11 where p11 is Point of (TOP-REAL 2) : ( p11 `2 = p `2 & p `1 <= p11 `1 & p11 `1 <= p1 `1 ) }
by A22, A23;
then
q in LSeg (
p,
p1)
by A8, A9, A22, A23, A24, A25, Th10, XXREAL_0:2;
hence
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}
by TOPREAL1:8;
verum end; case A26:
p1 `1 < q `1
;
contradictionnow contradictionper cases
( p1 `1 > p `1 or p1 `1 = p `1 or p1 `1 < p `1 )
by XXREAL_0:1;
suppose A27:
p1 `1 > p `1
;
contradictionthen
p1 in { p2 where p2 is Point of (TOP-REAL 2) : ( p2 `2 = p `2 & p `1 <= p2 `1 & p2 `1 <= q `1 ) }
by A22, A24, A26;
then
p1 in LSeg (
p,
q)
by A8, A10, A22, A26, A27, Th10, XXREAL_0:2;
hence
contradiction
by A1, A11;
verum end; end; end; hence
contradiction
;
verum end; end; end; hence
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}
;
verum end; end; end; hence
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}
;
verum end; suppose A28:
q `1 < p `1
;
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}now (LSeg (p1,q)) /\ (LSeg (q,p)) = {q}per cases
( ( p1 `1 = q `1 & p1 `2 <> q `2 ) or ( p1 `1 <> q `1 & p1 `2 = q `2 ) )
by A7;
suppose A29:
(
p1 `1 <> q `1 &
p1 `2 = q `2 )
;
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}now ( ( p1 `1 > q `1 & contradiction ) or ( p1 `1 < q `1 & (LSeg (p1,q)) /\ (LSeg (q,p)) = {q} ) )per cases
( p1 `1 > q `1 or p1 `1 < q `1 )
by A29, XXREAL_0:1;
case A30:
p1 `1 > q `1
;
contradictionhence
contradiction
;
verum end; case A31:
p1 `1 < q `1
;
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}then
q in { p22 where p22 is Point of (TOP-REAL 2) : ( p22 `2 = p `2 & p1 `1 <= p22 `1 & p22 `1 <= p `1 ) }
by A22, A28;
then
q in LSeg (
p1,
p)
by A8, A9, A22, A28, A29, A31, Th10, XXREAL_0:2;
hence
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}
by TOPREAL1:8;
verum end; end; end; hence
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}
;
verum end; end; end; hence
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}
;
verum end; end; end; hence
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}
;
verum end; end; end;
hence
(LSeg (p1,q)) /\ (LSeg (q,p)) = {q}
; verum