let AFS be AffinSpace; for a, b, c, d being Element of AFS holds
( not a,b // c,d or a,c // b,d or ex x being Element of AFS st
( LIN a,c,x & LIN b,d,x ) )
let a, b, c, d be Element of AFS; ( not a,b // c,d or a,c // b,d or ex x being Element of AFS st
( LIN a,c,x & LIN b,d,x ) )
assume A1:
a,b // c,d
; ( a,c // b,d or ex x being Element of AFS st
( LIN a,c,x & LIN b,d,x ) )
assume A2:
not a,c // b,d
; ex x being Element of AFS st
( LIN a,c,x & LIN b,d,x )
A3:
now consider z being
Element of
AFS such that A4:
a,
b // c,
z
and A5:
a,
c // b,
z
by DIRAF:47;
assume A6:
a <> b
;
ex x being Element of AFS st
( LIN a,c,x & LIN b,d,x )A7:
now
c,
d // c,
z
by A1, A6, A4, AFF_1:14;
then
LIN c,
d,
z
by AFF_1:def 1;
then
LIN d,
c,
z
by AFF_1:15;
then
d,
c // d,
z
by AFF_1:def 1;
then
z,
d // d,
c
by AFF_1:13;
then consider t being
Element of
AFS such that A8:
b,
d // d,
t
and A9:
b,
z // c,
t
by A2, A5, DIRAF:47;
assume
b <> z
;
ex x being Element of AFS st
( LIN a,c,x & LIN b,d,x )then
a,
c // c,
t
by A5, A9, AFF_1:14;
then
c,
a // c,
t
by AFF_1:13;
then
LIN c,
a,
t
by AFF_1:def 1;
then A10:
LIN a,
c,
t
by AFF_1:15;
d,
b // d,
t
by A8, AFF_1:13;
then
LIN d,
b,
t
by AFF_1:def 1;
then
LIN b,
d,
t
by AFF_1:15;
hence
ex
x being
Element of
AFS st
(
LIN a,
c,
x &
LIN b,
d,
x )
by A10;
verum end; now assume
b = z
;
ex x being Element of AFS st
( LIN a,c,x & LIN b,d,x )then
b,
a // b,
c
by A4, AFF_1:13;
then
LIN b,
a,
c
by AFF_1:def 1;
then A11:
LIN a,
c,
b
by AFF_1:15;
LIN b,
d,
b
by AFF_1:16;
hence
ex
x being
Element of
AFS st
(
LIN a,
c,
x &
LIN b,
d,
x )
by A11;
verum end; hence
ex
x being
Element of
AFS st
(
LIN a,
c,
x &
LIN b,
d,
x )
by A7;
verum end;
now assume
a = b
;
ex x being Element of AFS st
( LIN a,c,x & LIN b,d,x )then
(
LIN a,
c,
a &
LIN b,
d,
a )
by AFF_1:16;
hence
ex
x being
Element of
AFS st
(
LIN a,
c,
x &
LIN b,
d,
x )
;
verum end;
hence
ex x being Element of AFS st
( LIN a,c,x & LIN b,d,x )
by A3; verum