let AP be AffinPlane; :: thesis: ( AP is Desarguesian implies AP is satisfying_DES1_2 )
assume A1: AP is Desarguesian ; :: thesis: AP is satisfying_DES1_2
then A2: AP is satisfying_DES_1 by AFF_2:16;
let A be Subset of ; :: according to AFF_3:def 3 :: thesis: for P, C being Subset of
for o, a, a', b, b', c, c', p, q being Element of st A is being_line & P is being_line & C is being_line & P <> A & P <> C & A <> C & o in A & a in A & a' in A & o in P & b in P & b' in P & c in C & c' in C & o <> a & o <> b & o <> c & p <> q & not LIN b,a,c & not LIN b',a',c' & c <> c' & LIN b,a,p & LIN b',a',p & LIN b,c,q & LIN b',c',q & a,c // a',c' & a,c // p,q holds
o in C

let P, C be Subset of ; :: thesis: for o, a, a', b, b', c, c', p, q being Element of st A is being_line & P is being_line & C is being_line & P <> A & P <> C & A <> C & o in A & a in A & a' in A & o in P & b in P & b' in P & c in C & c' in C & o <> a & o <> b & o <> c & p <> q & not LIN b,a,c & not LIN b',a',c' & c <> c' & LIN b,a,p & LIN b',a',p & LIN b,c,q & LIN b',c',q & a,c // a',c' & a,c // p,q holds
o in C

let o, a, a', b, b', c, c', p, q be Element of ; :: thesis: ( A is being_line & P is being_line & C is being_line & P <> A & P <> C & A <> C & o in A & a in A & a' in A & o in P & b in P & b' in P & c in C & c' in C & o <> a & o <> b & o <> c & p <> q & not LIN b,a,c & not LIN b',a',c' & c <> c' & LIN b,a,p & LIN b',a',p & LIN b,c,q & LIN b',c',q & a,c // a',c' & a,c // p,q implies o in C )
assume that
A3: A is being_line and
A4: P is being_line and
A5: C is being_line and
A6: P <> A and
A7: P <> C and
A <> C and
A8: o in A and
A9: ( a in A & a' in A ) and
A10: o in P and
A11: b in P and
A12: b' in P and
A13: c in C and
A14: c' in C and
A15: o <> a and
A16: o <> b and
o <> c and
A17: p <> q and
A18: not LIN b,a,c and
A19: not LIN b',a',c' and
A20: c <> c' and
A21: LIN b,a,p and
A22: LIN b',a',p and
A23: LIN b,c,q and
A24: LIN b',c',q and
A25: a,c // a',c' and
A26: a,c // p,q ; :: thesis: o in C
A27: b <> p by A17, A18, A23, A26, AFF_1:69;
set K = Line b',a';
A28: p in Line b',a' by A22, AFF_1:def 2;
a' <> b' by A19, AFF_1:16;
then A29: Line b',a' is being_line by AFF_1:def 3;
A30: b <> q
proof
assume A31: b = q ; :: thesis: contradiction
( not LIN b,c,a & c,a // q,p ) by A18, A26, AFF_1:13, AFF_1:15;
hence contradiction by A17, A21, A31, AFF_1:69; :: thesis: verum
end;
set M = Line b',c';
A32: q in Line b',c' by A24, AFF_1:def 2;
A33: c' in Line b',c' by AFF_1:26;
A34: a <> c by A18, AFF_1:16;
A35: b' <> p
proof end;
A37: b' <> q
proof end;
A40: b <> c by A18, AFF_1:16;
A41: a <> b by A18, AFF_1:16;
A42: ( b' <> a' & b' <> c' ) by A19, AFF_1:16;
A43: a' in Line b',a' by AFF_1:26;
A44: b' in Line b',c' by AFF_1:26;
A45: b' <> c' by A19, AFF_1:16;
then A46: Line b',c' is being_line by AFF_1:def 3;
A47: b' in Line b',a' by AFF_1:26;
then A48: Line b',a' <> Line b',c' by A19, A29, A43, A33, AFF_1:33;
now
A49: now
p,q // a',c' by A25, A26, A34, AFF_1:14;
then A50: c',a' // q,p by AFF_1:13;
A51: b,a // b,p by A21, AFF_1:def 1;
set D = Line b,c;
A52: b in Line b,c by AFF_1:26;
Line b,c is being_line by A40, AFF_1:def 3;
then consider D' being Subset of such that
A53: c' in D' and
A54: Line b,c // D' by AFF_1:63;
A55: D' is being_line by A54, AFF_1:50;
A56: q in Line b,c by A23, AFF_1:def 2;
assume A57: Line b',c' <> P ; :: thesis: o in C
not D' // P then consider d being Element of such that
A58: d in D' and
A59: d in P by A4, A55, AFF_1:72;
A60: c in Line b,c by AFF_1:26;
A61: d <> b'
proof
assume d = b' ; :: thesis: contradiction
then Line b',c' = D' by A45, A46, A44, A33, A53, A55, A58, AFF_1:30;
then A62: Line b,c = Line b',c' by A32, A56, A54, AFF_1:59;
then LIN c,c',b by A46, A33, A52, A60, AFF_1:33;
then A63: b in C by A5, A13, A14, A20, AFF_1:39;
set N = Line a,c;
set T = Line b,a;
A64: b in Line b,a by AFF_1:26;
A65: c in Line a,c by AFF_1:26;
A66: a in Line b,a by AFF_1:26;
A67: Line a,c is being_line by A34, AFF_1:def 3;
A68: a in Line a,c by AFF_1:26;
A69: a <> a'
proof
assume a = a' ; :: thesis: contradiction
then LIN a,c,c' by A25, AFF_1:def 1;
then c' in Line a,c by AFF_1:def 2;
then Line a,c = C by A5, A13, A14, A20, A67, A65, AFF_1:30;
hence contradiction by A13, A18, A63, A67, A68, AFF_1:33; :: thesis: verum
end;
A70: ( Line b,a is being_line & p in Line b,a ) by A21, A41, AFF_1:def 2, AFF_1:def 3;
A71: b <> b'
proof
A72: Line b',a' <> Line b,a
proof
assume Line b',a' = Line b,a ; :: thesis: contradiction
then Line b,a = A by A3, A9, A29, A43, A66, A69, AFF_1:30;
hence contradiction by A3, A4, A6, A8, A10, A11, A16, A64, AFF_1:30; :: thesis: verum
end;
assume b = b' ; :: thesis: contradiction
hence contradiction by A29, A47, A28, A35, A64, A70, A72, AFF_1:30; :: thesis: verum
end;
LIN c,c',b' by A46, A44, A33, A60, A62, AFF_1:33;
then b' in C by A5, A13, A14, A20, AFF_1:39;
hence contradiction by A4, A5, A7, A11, A12, A63, A71, AFF_1:30; :: thesis: verum
end;
c',d // q,b by A52, A56, A53, A54, A58, AFF_1:53;
then d,a' // b,p by A1, A4, A11, A12, A42, A29, A46, A47, A43, A28, A44, A33, A32, A48, A57, A59, A61, A50, AFF_2:def 4;
then A73: b,a // d,a' by A27, A51, AFF_1:14;
b,c // d,c' by A52, A60, A53, A54, A58, AFF_1:53;
hence o in C by A2, A3, A4, A5, A6, A8, A9, A10, A11, A13, A14, A15, A16, A18, A20, A25, A59, A73, AFF_2:def 5; :: thesis: verum
end;
now
assume A74: Line b',c' = P ; :: thesis: o in C
LIN b,q,c by A23, AFF_1:15;
then c in P by A11, A46, A32, A30, A74, AFF_1:39;
then P = Line c,c' by A20, A46, A33, A74, AFF_1:71;
hence o in C by A5, A10, A13, A14, A20, AFF_1:71; :: thesis: verum
end;
hence o in C by A49; :: thesis: verum
end;
hence o in C ; :: thesis: verum