:: AFF_2 semantic presentation

definition
let c1 be AffinPlane;
attr a1 is satisfying_PPAP means :Def1: :: AFF_2:def 1
for b1, b2 being Subset of a1
for b3, b4, b5, b6, b7, b8 being Element of a1 holds
( b1 is_line & b2 is_line & b3 in b1 & b4 in b1 & b5 in b1 & b6 in b2 & b7 in b2 & b8 in b2 & b3,b7 // b4,b6 & b4,b8 // b5,b7 implies b3,b8 // b5,b6 );
end;

:: deftheorem Def1 defines satisfying_PPAP AFF_2:def 1 :
for b1 being AffinPlane holds
( b1 is satisfying_PPAP iff for b2, b3 being Subset of b1
for b4, b5, b6, b7, b8, b9 being Element of b1 holds
( b2 is_line & b3 is_line & b4 in b2 & b5 in b2 & b6 in b2 & b7 in b3 & b8 in b3 & b9 in b3 & b4,b8 // b5,b7 & b5,b9 // b6,b8 implies b4,b9 // b6,b7 ) );

notation
let c1 be AffinPlane;
synonym c1 satisfies_PPAP for satisfying_PPAP c1;
end;

definition
let c1 be AffinSpace;
attr a1 is Pappian means :Def2: :: AFF_2:def 2
for b1, b2 being Subset of a1
for b3, b4, b5, b6, b7, b8, b9 being Element of a1 holds
( b1 is_line & b2 is_line & b1 <> b2 & b3 in b1 & b3 in b2 & b3 <> b4 & b3 <> b7 & b3 <> b5 & b3 <> b8 & b3 <> b6 & b3 <> b9 & b4 in b1 & b5 in b1 & b6 in b1 & b7 in b2 & b8 in b2 & b9 in b2 & b4,b8 // b5,b7 & b5,b9 // b6,b8 implies b4,b9 // b6,b7 );
end;

:: deftheorem Def2 defines Pappian AFF_2:def 2 :
for b1 being AffinSpace holds
( b1 is Pappian iff for b2, b3 being Subset of b1
for b4, b5, b6, b7, b8, b9, b10 being Element of b1 holds
( b2 is_line & b3 is_line & b2 <> b3 & b4 in b2 & b4 in b3 & b4 <> b5 & b4 <> b8 & b4 <> b6 & b4 <> b9 & b4 <> b7 & b4 <> b10 & b5 in b2 & b6 in b2 & b7 in b2 & b8 in b3 & b9 in b3 & b10 in b3 & b5,b9 // b6,b8 & b6,b10 // b7,b9 implies b5,b10 // b7,b8 ) );

notation
let c1 be AffinSpace;
synonym c1 satisfies_PAP for Pappian c1;
end;

definition
let c1 be AffinPlane;
attr a1 is satisfying_PAP_1 means :Def3: :: AFF_2:def 3
for b1, b2 being Subset of a1
for b3, b4, b5, b6, b7, b8, b9 being Element of a1 holds
( b1 is_line & b2 is_line & b1 <> b2 & b3 in b1 & b3 in b2 & b3 <> b4 & b3 <> b7 & b3 <> b5 & b3 <> b8 & b3 <> b6 & b3 <> b9 & b4 in b1 & b5 in b1 & b6 in b1 & b8 in b2 & b9 in b2 & b4,b8 // b5,b7 & b5,b9 // b6,b8 & b4,b9 // b6,b7 & b5 <> b6 implies b7 in b2 );
end;

:: deftheorem Def3 defines satisfying_PAP_1 AFF_2:def 3 :
for b1 being AffinPlane holds
( b1 is satisfying_PAP_1 iff for b2, b3 being Subset of b1
for b4, b5, b6, b7, b8, b9, b10 being Element of b1 holds
( b2 is_line & b3 is_line & b2 <> b3 & b4 in b2 & b4 in b3 & b4 <> b5 & b4 <> b8 & b4 <> b6 & b4 <> b9 & b4 <> b7 & b4 <> b10 & b5 in b2 & b6 in b2 & b7 in b2 & b9 in b3 & b10 in b3 & b5,b9 // b6,b8 & b6,b10 // b7,b9 & b5,b10 // b7,b8 & b6 <> b7 implies b8 in b3 ) );

notation
let c1 be AffinPlane;
synonym c1 satisfies_PAP_1 for satisfying_PAP_1 c1;
end;

definition
let c1 be AffinSpace;
attr a1 is Desarguesian means :Def4: :: AFF_2:def 4
for b1, b2, b3 being Subset of a1
for b4, b5, b6, b7, b8, b9, b10 being Element of a1 holds
( b4 in b1 & b4 in b2 & b4 in b3 & b4 <> b5 & b4 <> b6 & b4 <> b7 & b5 in b1 & b8 in b1 & b6 in b2 & b9 in b2 & b7 in b3 & b10 in b3 & b1 is_line & b2 is_line & b3 is_line & b1 <> b2 & b1 <> b3 & b5,b6 // b8,b9 & b5,b7 // b8,b10 implies b6,b7 // b9,b10 );
end;

:: deftheorem Def4 defines Desarguesian AFF_2:def 4 :
for b1 being AffinSpace holds
( b1 is Desarguesian iff for b2, b3, b4 being Subset of b1
for b5, b6, b7, b8, b9, b10, b11 being Element of b1 holds
( b5 in b2 & b5 in b3 & b5 in b4 & b5 <> b6 & b5 <> b7 & b5 <> b8 & b6 in b2 & b9 in b2 & b7 in b3 & b10 in b3 & b8 in b4 & b11 in b4 & b2 is_line & b3 is_line & b4 is_line & b2 <> b3 & b2 <> b4 & b6,b7 // b9,b10 & b6,b8 // b9,b11 implies b7,b8 // b10,b11 ) );

notation
let c1 be AffinSpace;
synonym c1 satisfies_DES for Desarguesian c1;
end;

definition
let c1 be AffinPlane;
attr a1 is satisfying_DES_1 means :Def5: :: AFF_2:def 5
for b1, b2, b3 being Subset of a1
for b4, b5, b6, b7, b8, b9, b10 being Element of a1 holds
( b4 in b1 & b4 in b2 & b4 <> b5 & b4 <> b6 & b4 <> b7 & b5 in b1 & b8 in b1 & b6 in b2 & b9 in b2 & b7 in b3 & b10 in b3 & b1 is_line & b2 is_line & b3 is_line & b1 <> b2 & b1 <> b3 & b5,b6 // b8,b9 & b5,b7 // b8,b10 & b6,b7 // b9,b10 & not LIN b5,b6,b7 & b7 <> b10 implies b4 in b3 );
end;

:: deftheorem Def5 defines satisfying_DES_1 AFF_2:def 5 :
for b1 being AffinPlane holds
( b1 is satisfying_DES_1 iff for b2, b3, b4 being Subset of b1
for b5, b6, b7, b8, b9, b10, b11 being Element of b1 holds
( b5 in b2 & b5 in b3 & b5 <> b6 & b5 <> b7 & b5 <> b8 & b6 in b2 & b9 in b2 & b7 in b3 & b10 in b3 & b8 in b4 & b11 in b4 & b2 is_line & b3 is_line & b4 is_line & b2 <> b3 & b2 <> b4 & b6,b7 // b9,b10 & b6,b8 // b9,b11 & b7,b8 // b10,b11 & not LIN b6,b7,b8 & b8 <> b11 implies b5 in b4 ) );

notation
let c1 be AffinPlane;
synonym c1 satisfies_DES_1 for satisfying_DES_1 c1;
end;

definition
let c1 be AffinPlane;
attr a1 is satisfying_DES_2 means :: AFF_2:def 6
for b1, b2, b3 being Subset of a1
for b4, b5, b6, b7, b8, b9, b10 being Element of a1 holds
( b4 in b1 & b4 in b2 & b4 in b3 & b4 <> b5 & b4 <> b6 & b4 <> b7 & b5 in b1 & b8 in b1 & b6 in b2 & b9 in b2 & b7 in b3 & b1 is_line & b2 is_line & b3 is_line & b1 <> b2 & b1 <> b3 & b5,b6 // b8,b9 & b5,b7 // b8,b10 & b6,b7 // b9,b10 implies b10 in b3 );
end;

:: deftheorem Def6 defines satisfying_DES_2 AFF_2:def 6 :
for b1 being AffinPlane holds
( b1 is satisfying_DES_2 iff for b2, b3, b4 being Subset of b1
for b5, b6, b7, b8, b9, b10, b11 being Element of b1 holds
( b5 in b2 & b5 in b3 & b5 in b4 & b5 <> b6 & b5 <> b7 & b5 <> b8 & b6 in b2 & b9 in b2 & b7 in b3 & b10 in b3 & b8 in b4 & b2 is_line & b3 is_line & b4 is_line & b2 <> b3 & b2 <> b4 & b6,b7 // b9,b10 & b6,b8 // b9,b11 & b7,b8 // b10,b11 implies b11 in b4 ) );

notation
let c1 be AffinPlane;
synonym c1 satisfies_DES_2 for satisfying_DES_2 c1;
end;

definition
let c1 be AffinSpace;
attr a1 is Moufangian means :Def7: :: AFF_2:def 7
for b1 being Subset of a1
for b2, b3, b4, b5, b6, b7, b8 being Element of a1 holds
( b1 is_line & b2 in b1 & b5 in b1 & b8 in b1 & not b3 in b1 & b2 <> b5 & b3 <> b4 & LIN b2,b3,b6 & LIN b2,b4,b7 & b3,b4 // b6,b7 & b3,b5 // b6,b8 & b3,b4 // b1 implies b4,b5 // b7,b8 );
end;

:: deftheorem Def7 defines Moufangian AFF_2:def 7 :
for b1 being AffinSpace holds
( b1 is Moufangian iff for b2 being Subset of b1
for b3, b4, b5, b6, b7, b8, b9 being Element of b1 holds
( b2 is_line & b3 in b2 & b6 in b2 & b9 in b2 & not b4 in b2 & b3 <> b6 & b4 <> b5 & LIN b3,b4,b7 & LIN b3,b5,b8 & b4,b5 // b7,b8 & b4,b6 // b7,b9 & b4,b5 // b2 implies b5,b6 // b8,b9 ) );

notation
let c1 be AffinSpace;
synonym c1 satisfies_TDES for Moufangian c1;
end;

definition
let c1 be AffinPlane;
attr a1 is satisfying_TDES_1 means :Def8: :: AFF_2:def 8
for b1 being Subset of a1
for b2, b3, b4, b5, b6, b7, b8 being Element of a1 holds
( b1 is_line & b2 in b1 & b5 in b1 & b8 in b1 & not b3 in b1 & b2 <> b5 & b3 <> b4 & LIN b2,b3,b6 & b3,b4 // b6,b7 & b4,b5 // b7,b8 & b3,b5 // b6,b8 & b3,b4 // b1 implies LIN b2,b4,b7 );
end;

:: deftheorem Def8 defines satisfying_TDES_1 AFF_2:def 8 :
for b1 being AffinPlane holds
( b1 is satisfying_TDES_1 iff for b2 being Subset of b1
for b3, b4, b5, b6, b7, b8, b9 being Element of b1 holds
( b2 is_line & b3 in b2 & b6 in b2 & b9 in b2 & not b4 in b2 & b3 <> b6 & b4 <> b5 & LIN b3,b4,b7 & b4,b5 // b7,b8 & b5,b6 // b8,b9 & b4,b6 // b7,b9 & b4,b5 // b2 implies LIN b3,b5,b8 ) );

notation
let c1 be AffinPlane;
synonym c1 satisfies_TDES_1 for satisfying_TDES_1 c1;
end;

definition
let c1 be AffinPlane;
attr a1 is satisfying_TDES_2 means :Def9: :: AFF_2:def 9
for b1 being Subset of a1
for b2, b3, b4, b5, b6, b7, b8 being Element of a1 holds
( b1 is_line & b2 in b1 & b5 in b1 & b8 in b1 & not b3 in b1 & b2 <> b5 & b3 <> b4 & LIN b2,b3,b6 & LIN b2,b4,b7 & b4,b5 // b7,b8 & b3,b5 // b6,b8 & b3,b4 // b1 implies b3,b4 // b6,b7 );
end;

:: deftheorem Def9 defines satisfying_TDES_2 AFF_2:def 9 :
for b1 being AffinPlane holds
( b1 is satisfying_TDES_2 iff for b2 being Subset of b1
for b3, b4, b5, b6, b7, b8, b9 being Element of b1 holds
( b2 is_line & b3 in b2 & b6 in b2 & b9 in b2 & not b4 in b2 & b3 <> b6 & b4 <> b5 & LIN b3,b4,b7 & LIN b3,b5,b8 & b5,b6 // b8,b9 & b4,b6 // b7,b9 & b4,b5 // b2 implies b4,b5 // b7,b8 ) );

notation
let c1 be AffinPlane;
synonym c1 satisfies_TDES_2 for satisfying_TDES_2 c1;
end;

definition
let c1 be AffinPlane;
attr a1 is satisfying_TDES_3 means :Def10: :: AFF_2:def 10
for b1 being Subset of a1
for b2, b3, b4, b5, b6, b7, b8 being Element of a1 holds
( b1 is_line & b2 in b1 & b5 in b1 & not b3 in b1 & b2 <> b5 & b3 <> b4 & LIN b2,b3,b6 & LIN b2,b4,b7 & b3,b4 // b6,b7 & b3,b5 // b6,b8 & b4,b5 // b7,b8 & b3,b4 // b1 implies b8 in b1 );
end;

:: deftheorem Def10 defines satisfying_TDES_3 AFF_2:def 10 :
for b1 being AffinPlane holds
( b1 is satisfying_TDES_3 iff for b2 being Subset of b1
for b3, b4, b5, b6, b7, b8, b9 being Element of b1 holds
( b2 is_line & b3 in b2 & b6 in b2 & not b4 in b2 & b3 <> b6 & b4 <> b5 & LIN b3,b4,b7 & LIN b3,b5,b8 & b4,b5 // b7,b8 & b4,b6 // b7,b9 & b5,b6 // b8,b9 & b4,b5 // b2 implies b9 in b2 ) );

notation
let c1 be AffinPlane;
synonym c1 satisfies_TDES_3 for satisfying_TDES_3 c1;
end;

definition
let c1 be AffinSpace;
attr a1 is translational means :Def11: :: AFF_2:def 11
for b1, b2, b3 being Subset of a1
for b4, b5, b6, b7, b8, b9 being Element of a1 holds
( b1 // b2 & b1 // b3 & b4 in b1 & b7 in b1 & b5 in b2 & b8 in b2 & b6 in b3 & b9 in b3 & b1 is_line & b2 is_line & b3 is_line & b1 <> b2 & b1 <> b3 & b4,b5 // b7,b8 & b4,b6 // b7,b9 implies b5,b6 // b8,b9 );
end;

:: deftheorem Def11 defines translational AFF_2:def 11 :
for b1 being AffinSpace holds
( b1 is translational iff for b2, b3, b4 being Subset of b1
for b5, b6, b7, b8, b9, b10 being Element of b1 holds
( b2 // b3 & b2 // b4 & b5 in b2 & b8 in b2 & b6 in b3 & b9 in b3 & b7 in b4 & b10 in b4 & b2 is_line & b3 is_line & b4 is_line & b2 <> b3 & b2 <> b4 & b5,b6 // b8,b9 & b5,b7 // b8,b10 implies b6,b7 // b9,b10 ) );

notation
let c1 be AffinSpace;
synonym c1 satisfies_des for translational c1;
end;

definition
let c1 be AffinPlane;
attr a1 is satisfying_des_1 means :Def12: :: AFF_2:def 12
for b1, b2, b3 being Subset of a1
for b4, b5, b6, b7, b8, b9 being Element of a1 holds
( b1 // b2 & b4 in b1 & b7 in b1 & b5 in b2 & b8 in b2 & b6 in b3 & b9 in b3 & b1 is_line & b2 is_line & b3 is_line & b1 <> b2 & b1 <> b3 & b4,b5 // b7,b8 & b4,b6 // b7,b9 & b5,b6 // b8,b9 & not LIN b4,b5,b6 & b6 <> b9 implies b1 // b3 );
end;

:: deftheorem Def12 defines satisfying_des_1 AFF_2:def 12 :
for b1 being AffinPlane holds
( b1 is satisfying_des_1 iff for b2, b3, b4 being Subset of b1
for b5, b6, b7, b8, b9, b10 being Element of b1 holds
( b2 // b3 & b5 in b2 & b8 in b2 & b6 in b3 & b9 in b3 & b7 in b4 & b10 in b4 & b2 is_line & b3 is_line & b4 is_line & b2 <> b3 & b2 <> b4 & b5,b6 // b8,b9 & b5,b7 // b8,b10 & b6,b7 // b9,b10 & not LIN b5,b6,b7 & b7 <> b10 implies b2 // b4 ) );

notation
let c1 be AffinPlane;
synonym c1 satisfies_des_1 for satisfying_des_1 c1;
end;

definition
let c1 be AffinSpace;
attr a1 is satisfying_pap means :Def13: :: AFF_2:def 13
for b1, b2 being Subset of a1
for b3, b4, b5, b6, b7, b8 being Element of a1 holds
( b1 is_line & b2 is_line & b3 in b1 & b4 in b1 & b5 in b1 & b1 // b2 & b1 <> b2 & b6 in b2 & b7 in b2 & b8 in b2 & b3,b7 // b4,b6 & b4,b8 // b5,b7 implies b3,b8 // b5,b6 );
end;

:: deftheorem Def13 defines satisfying_pap AFF_2:def 13 :
for b1 being AffinSpace holds
( b1 is satisfying_pap iff for b2, b3 being Subset of b1
for b4, b5, b6, b7, b8, b9 being Element of b1 holds
( b2 is_line & b3 is_line & b4 in b2 & b5 in b2 & b6 in b2 & b2 // b3 & b2 <> b3 & b7 in b3 & b8 in b3 & b9 in b3 & b4,b8 // b5,b7 & b5,b9 // b6,b8 implies b4,b9 // b6,b7 ) );

notation
let c1 be AffinSpace;
synonym c1 satisfies_pap for satisfying_pap c1;
end;

definition
let c1 be AffinPlane;
attr a1 is satisfying_pap_1 means :Def14: :: AFF_2:def 14
for b1, b2 being Subset of a1
for b3, b4, b5, b6, b7, b8 being Element of a1 holds
( b1 is_line & b2 is_line & b3 in b1 & b4 in b1 & b5 in b1 & b1 // b2 & b1 <> b2 & b6 in b2 & b7 in b2 & b3,b7 // b4,b6 & b4,b8 // b5,b7 & b3,b8 // b5,b6 & b6 <> b7 implies b8 in b2 );
end;

:: deftheorem Def14 defines satisfying_pap_1 AFF_2:def 14 :
for b1 being AffinPlane holds
( b1 is satisfying_pap_1 iff for b2, b3 being Subset of b1
for b4, b5, b6, b7, b8, b9 being Element of b1 holds
( b2 is_line & b3 is_line & b4 in b2 & b5 in b2 & b6 in b2 & b2 // b3 & b2 <> b3 & b7 in b3 & b8 in b3 & b4,b8 // b5,b7 & b5,b9 // b6,b8 & b4,b9 // b6,b7 & b7 <> b8 implies b9 in b3 ) );

notation
let c1 be AffinPlane;
synonym c1 satisfies_pap_1 for satisfying_pap_1 c1;
end;

theorem Th1: :: AFF_2:1
canceled;

theorem Th2: :: AFF_2:2
canceled;

theorem Th3: :: AFF_2:3
canceled;

theorem Th4: :: AFF_2:4
canceled;

theorem Th5: :: AFF_2:5
canceled;

theorem Th6: :: AFF_2:6
canceled;

theorem Th7: :: AFF_2:7
canceled;

theorem Th8: :: AFF_2:8
canceled;

theorem Th9: :: AFF_2:9
canceled;

theorem Th10: :: AFF_2:10
canceled;

theorem Th11: :: AFF_2:11
canceled;

theorem Th12: :: AFF_2:12
canceled;

theorem Th13: :: AFF_2:13
canceled;

theorem Th14: :: AFF_2:14
canceled;

theorem Th15: :: AFF_2:15
for b1 being AffinPlane holds
( b1 satisfies_PAP iff b1 satisfies_PAP_1 )
proof
let c1 be AffinPlane;
E14: now
assume E15: c1 satisfies_PAP ;
thus c1 satisfies_PAP_1
proof
let c2 be Subset of c1; :: according to AFF_2:def 3
let c3 be Subset of c1;
let c4, c5, c6, c7, c8, c9, c10 be Element of c1;
assume E16: ( c2 is_line & c3 is_line & c2 <> c3 & c4 in c2 & c4 in c3 & c4 <> c5 & c4 <> c8 & c4 <> c6 & c4 <> c9 & c4 <> c7 & c4 <> c10 & c5 in c2 & c6 in c2 & c7 in c2 & c9 in c3 & c10 in c3 & c5,c9 // c6,c8 & c6,c10 // c7,c9 & c5,c10 // c7,c8 & c6 <> c7 ) ;
assume E17: not c8 in c3 ;
E18: ( c5 <> c9 & c5 <> c10 ) by E16, AFF_1:30;
E19: c6 <> c8
proof
assume c6 = c8 ;
then c7,c6 // c5,c10 by E16, AFF_1:13;
then c10 in c2 by E16, AFF_1:62;
hence not verum by E16, AFF_1:30;
end;
not c6,c8 // c3
proof
assume c6,c8 // c3 ;
then ( c6,c8 // c3 & c6,c8 // c5,c9 ) by E16, AFF_1:13;
then c5,c9 // c3 by E19, AFF_1:46;
then c9,c5 // c3 by AFF_1:48;
then c5 in c3 by E16, AFF_1:37;
hence not verum by E16, AFF_1:30;
end;
then consider c11 being Element of c1 such that
E20: ( c11 in c3 & LIN c6,c8,c11 ) by E16, AFF_1:73;
E21: c5,c9 // c6,c11
proof
c6,c8 // c6,c11 by E20, AFF_1:def 1;
hence c5,c9 // c6,c11 by E16, E19, AFF_1:14;
end;
E22: c4 <> c11
proof
assume c4 = c11 ;
then c6,c4 // c5,c9 by E21, AFF_1:13;
then c9 in c2 by E16, AFF_1:62;
hence not verum by E16, AFF_1:30;
end;
then c5,c10 // c7,c11 by E15, E16, E20, E21, Def2;
then c7,c8 // c7,c11 by E16, E18, AFF_1:14;
then LIN c7,c8,c11 by AFF_1:def 1;
then ( LIN c8,c11,c7 & LIN c8,c11,c6 & LIN c8,c11,c11 ) by E20, AFF_1:15, AFF_1:16;
then LIN c6,c7,c11 by E17, E20, AFF_1:17;
then c11 in c2 by E16, AFF_1:39;
hence not verum by E16, E20, E22, AFF_1:30;
end;
end;
now
assume E15: c1 satisfies_PAP_1 ;
thus c1 satisfies_PAP
proof
let c2 be Subset of c1; :: according to AFF_2:def 2
let c3 be Subset of c1;
let c4, c5, c6, c7, c8, c9, c10 be Element of c1;
assume E16: ( c2 is_line & c3 is_line & c2 <> c3 & c4 in c2 & c4 in c3 & c4 <> c5 & c4 <> c8 & c4 <> c6 & c4 <> c9 & c4 <> c7 & c4 <> c10 & c5 in c2 & c6 in c2 & c7 in c2 & c8 in c3 & c9 in c3 & c10 in c3 & c5,c9 // c6,c8 & c6,c10 // c7,c9 ) ;
assume E17: not c5,c10 // c7,c8 ;
then E18: ( c5 <> c10 & c7 <> c8 ) by AFF_1:12;
E19: ( c5 <> c9 & c6 <> c8 ) by E16, AFF_1:30;
E20: c6 <> c7
proof
assume E21: c6 = c7 ;
then LIN c6,c10,c9 by E16, AFF_1:def 1;
then LIN c9,c10,c6 by AFF_1:15;
then ( c9 = c10 or c6 in c3 ) by E16, AFF_1:39;
hence not verum by E16, E17, E21, AFF_1:30;
end;
E21: c9 <> c10
proof
assume c9 = c10 ;
then c9,c6 // c9,c7 by E16, AFF_1:13;
then LIN c9,c6,c7 by AFF_1:def 1;
then LIN c6,c7,c9 by AFF_1:15;
then c9 in c2 by E16, E20, AFF_1:39;
hence not verum by E16, AFF_1:30;
end;
set c11 = Line c5,c10;
set c12 = Line c6,c8;
E22: ( Line c5,c10 is_line & Line c6,c8 is_line & c5 in Line c5,c10 & c10 in Line c5,c10 & c6 in Line c6,c8 & c8 in Line c6,c8 ) by E18, E19, AFF_1:38;
then consider c13 being Subset of c1 such that
E23: ( c7 in c13 & Line c5,c10 // c13 ) by AFF_1:63;
E24: ( c13 is_line & c13 // Line c5,c10 ) by E23, AFF_1:50;
not Line c6,c8 // c13
proof
assume Line c6,c8 // c13 ;
then Line c6,c8 // Line c5,c10 by E23, AFF_1:58;
then c6,c8 // c5,c10 by E22, AFF_1:53;
then c5,c9 // c5,c10 by E16, E19, AFF_1:14;
then LIN c5,c9,c10 by AFF_1:def 1;
then LIN c9,c10,c5 by AFF_1:15;
then c5 in c3 by E16, E21, AFF_1:39;
hence not verum by E16, AFF_1:30;
end;
then consider c14 being Element of c1 such that
E25: ( c14 in Line c6,c8 & c14 in c13 ) by E22, E24, AFF_1:72;
E26: c5,c10 // c7,c14 by E22, E23, E25, AFF_1:53;
c5,c9 // c6,c14
proof
LIN c6,c14,c8 by E22, E25, AFF_1:33;
then c6,c14 // c6,c8 by AFF_1:def 1;
hence c5,c9 // c6,c14 by E16, E19, AFF_1:14;
end;
then c14 in c3 by E15, E16, E20, E26, Def3;
then c3 = Line c6,c8 by E16, E17, E22, E25, E26, AFF_1:30;
hence not verum by E16, E22, AFF_1:30;
end;
end;
hence ( c1 satisfies_PAP iff c1 satisfies_PAP_1 ) by E14;
end;

theorem Th16: :: AFF_2:16
for b1 being AffinPlane holds
( b1 satisfies_DES iff b1 satisfies_DES_1 )
proof
let c1 be AffinPlane;
E14: now
assume E15: c1 satisfies_DES ;
thus c1 satisfies_DES_1
proof
let c2 be Subset of c1; :: according to AFF_2:def 5
let c3, c4 be Subset of c1;
let c5, c6, c7, c8, c9, c10, c11 be Element of c1;
assume E16: ( c5 in c2 & c5 in c3 & c5 <> c6 & c5 <> c7 & c5 <> c8 & c6 in c2 & c9 in c2 & c7 in c3 & c10 in c3 & c8 in c4 & c11 in c4 & c2 is_line & c3 is_line & c4 is_line & c2 <> c3 & c2 <> c4 & c6,c7 // c9,c10 & c6,c8 // c9,c11 & c7,c8 // c10,c11 & not LIN c6,c7,c8 & c8 <> c11 ) ;
assume E17: not c5 in c4 ;
set c12 = Line c5,c11;
E18: ( Line c5,c11 is_line & c5 in Line c5,c11 & c11 in Line c5,c11 ) by E16, E17, AFF_1:38;
E19: ( c6 <> c7 & c6 <> c8 & c7 <> c8 ) by E16, AFF_1:16;
E20: c9 <> c11
proof
assume E21: c9 = c11 ;
then c7,c8 // c9,c10 by E16, AFF_1:13;
then ( c6,c7 // c7,c8 or c9 = c10 ) by E16, AFF_1:14;
then ( c7,c6 // c7,c8 or c9 = c10 ) by AFF_1:13;
then ( LIN c7,c6,c8 or c9 = c10 ) by AFF_1:def 1;
hence not verum by E16, E17, E21, AFF_1:15, AFF_1:30;
end;
E21: c10 <> c11
proof
assume c10 = c11 ;
then ( c9 = c10 or c6,c8 // c6,c7 ) by E16, AFF_1:14;
then ( c9 = c10 or LIN c6,c8,c7 ) by AFF_1:def 1;
then c7,c8 // c6,c8 by E16, E20, AFF_1:14, AFF_1:15;
then c8,c7 // c8,c6 by AFF_1:13;
then LIN c8,c7,c6 by AFF_1:def 1;
hence not verum by E16, AFF_1:15;
end;
E22: c2 <> Line c5,c11
proof
assume c2 = Line c5,c11 ;
then ( c11 in c2 & c9,c11 // c6,c8 ) by E16, AFF_1:13, AFF_1:38;
then ( c8 in c2 & c11 in c2 ) by E16, E20, AFF_1:62;
hence not verum by E16, AFF_1:30;
end;
not c6,c8 // Line c5,c11
proof
assume c6,c8 // Line c5,c11 ;
then c9,c11 // Line c5,c11 by E16, E19, AFF_1:46;
then c11,c9 // Line c5,c11 by AFF_1:48;
then c9 in Line c5,c11 by E18, AFF_1:37;
then E23: c9 in c3 by E16, E18, E22, AFF_1:30;
c9,c10 // c7,c6 by E16, AFF_1:13;
then ( c9 = c10 or c6 in c3 ) by E16, E23, AFF_1:62;
then c6,c8 // c7,c8 by E16, E20, AFF_1:14, AFF_1:30;
then c8,c6 // c8,c7 by AFF_1:13;
then LIN c8,c6,c7 by AFF_1:def 1;
hence not verum by E16, AFF_1:15;
end;
then consider c13 being Element of c1 such that
E23: ( c13 in Line c5,c11 & LIN c6,c8,c13 ) by E18, AFF_1:73;
E24: c6,c8 // c6,c13 by E23, AFF_1:def 1;
then E25: c6,c13 // c9,c11 by E16, E19, AFF_1:14;
E26: not LIN c6,c7,c13
proof
assume LIN c6,c7,c13 ;
then c6,c7 // c6,c13 by AFF_1:def 1;
then ( c6,c7 // c6,c8 or c6 = c13 ) by E24, AFF_1:14;
hence not verum by E16, E18, E22, E23, AFF_1:30, AFF_1:def 1;
end;
c5 <> c13
proof
assume c5 = c13 ;
then LIN c6,c5,c8 by E23, AFF_1:15;
then c8 in c2 by E16, AFF_1:39;
then ( c8 in c2 & c11 in c2 ) by E16, E19, AFF_1:62;
hence not verum by E16, AFF_1:30;
end;
then c7,c13 // c10,c11 by E15, E16, E18, E22, E23, E25, Def4;
then ( c7,c13 // c7,c8 & LIN c6,c13,c8 ) by E16, E21, E23, AFF_1:14, AFF_1:15;
then c8 in Line c5,c11 by E23, E26, AFF_1:23;
hence not verum by E16, E17, E18, AFF_1:30;
end;
end;
now
assume E15: c1 satisfies_DES_1 ;
thus c1 satisfies_DES
proof
let c2 be Subset of c1; :: according to AFF_2:def 4
let c3, c4 be Subset of c1;
let c5, c6, c7, c8, c9, c10, c11 be Element of c1;
assume E16: ( c5 in c2 & c5 in c3 & c5 in c4 & c5 <> c6 & c5 <> c7 & c5 <> c8 & c6 in c2 & c9 in c2 & c7 in c3 & c10 in c3 & c8 in c4 & c11 in c4 & c2 is_line & c3 is_line & c4 is_line & c2 <> c3 & c2 <> c4 & c6,c7 // c9,c10 & c6,c8 // c9,c11 ) ;
assume E17: not c7,c8 // c10,c11 ;
then E18: ( c7 <> c8 & c10 <> c11 ) by AFF_1:12;
E19: c6 <> c7 by E16, AFF_1:30;
E20: c6 <> c8 by E16, AFF_1:30;
E21: c9 <> c10
proof
assume E22: c9 = c10 ;
then ( c9 in c4 & c9,c11 // c8,c6 ) by E16, AFF_1:13, AFF_1:30;
then ( c6 in c4 or c9 = c11 ) by E16, AFF_1:62;
hence not verum by E16, E17, E22, AFF_1:12, AFF_1:30;
end;
E22: c9 <> c11
proof
assume c9 = c11 ;
then ( c9 in c3 & c9,c10 // c7,c6 ) by E16, AFF_1:13, AFF_1:30;
then ( c9 in c3 & c6 in c3 ) by E16, E21, AFF_1:62;
hence not verum by E16, AFF_1:30;
end;
E23: not LIN c9,c10,c11
proof
assume LIN c9,c10,c11 ;
then ( c9,c10 // c9,c11 & LIN c10,c11,c9 ) by AFF_1:15, AFF_1:def 1;
then E24: ( c9,c10 // c6,c8 & c10,c11 // c10,c9 ) by E16, E22, AFF_1:14, AFF_1:def 1;
then c6,c7 // c6,c8 by E16, E21, AFF_1:14;
then LIN c6,c7,c8 by AFF_1:def 1;
then LIN c7,c8,c6 by AFF_1:15;
then c7,c8 // c7,c6 by AFF_1:def 1;
then c7,c8 // c6,c7 by AFF_1:13;
then ( c7,c8 // c9,c10 & c10,c11 // c9,c10 ) by E16, E19, E24, AFF_1:13, AFF_1:14;
hence not verum by E17, E21, AFF_1:14;
end;
E24: c6 <> c9
proof
assume c6 = c9 ;
then ( LIN c6,c7,c10 & LIN c6,c8,c11 ) by E16, AFF_1:def 1;
then ( LIN c7,c10,c6 & LIN c8,c11,c6 ) by AFF_1:15;
then ( ( c7 = c10 or c6 in c3 ) & ( c8 = c11 or c6 in c4 ) ) by E16, AFF_1:39;
hence not verum by E16, E17, AFF_1:11, AFF_1:30;
end;
E25: c5 <> c11
proof
assume c5 = c11 ;
then ( c11 in c2 & c9,c11 // c6,c8 ) by E16, AFF_1:13;
then ( c8 in c2 & c11 in c2 ) by E16, E22, AFF_1:62;
hence not verum by E16, AFF_1:30;
end;
set c12 = Line c9,c11;
set c13 = Line c6,c8;
set c14 = Line c10,c11;
E26: ( Line c9,c11 is_line & Line c6,c8 is_line & Line c10,c11 is_line & c9 in Line c9,c11 & c11 in Line c9,c11 & c6 in Line c6,c8 & c8 in Line c6,c8 & c10 in Line c10,c11 & c11 in Line c10,c11 ) by E18, E20, E22, AFF_1:38;
then consider c15 being Subset of c1 such that
E27: ( c7 in c15 & Line c10,c11 // c15 ) by AFF_1:63;
E28: ( c15 is_line & c15 // Line c10,c11 ) by E27, AFF_1:50;
not Line c6,c8 // c15
proof
assume Line c6,c8 // c15 ;
then Line c6,c8 // Line c10,c11 by E27, AFF_1:58;
then c6,c8 // c10,c11 by E26, AFF_1:53;
then c9,c11 // c10,c11 by E16, E20, AFF_1:14;
then c11,c9 // c11,c10 by AFF_1:13;
then LIN c11,c9,c10 by AFF_1:def 1;
hence not verum by E23, AFF_1:15;
end;
then consider c16 being Element of c1 such that
E29: ( c16 in Line c6,c8 & c16 in c15 ) by E26, E28, AFF_1:72;
E30: c6,c16 // c9,c11
proof
LIN c6,c8,c16 by E26, E29, AFF_1:33;
then c6,c8 // c6,c16 by AFF_1:def 1;
hence c6,c16 // c9,c11 by E16, E20, AFF_1:14;
end;
E31: c7,c16 // c10,c11 by E26, E27, E29, AFF_1:53;
E32: c16 <> c11
proof
assume c16 = c11 ;
then c11,c6 // c11,c9 by E30, AFF_1:13;
then LIN c11,c6,c9 by AFF_1:def 1;
then LIN c6,c9,c11 by AFF_1:15;
then c11 in c2 by E16, E24, AFF_1:39;
hence not verum by E16, E25, AFF_1:30;
end;
E33: c6 <> c16
proof
assume c6 = c16 ;
then c6,c7 // c10,c11 by E26, E27, E29, AFF_1:53;
then c9,c10 // c10,c11 by E16, E19, AFF_1:14;
then c10,c9 // c10,c11 by AFF_1:13;
then LIN c10,c9,c11 by AFF_1:def 1;
hence not verum by E23, AFF_1:15;
end;
E34: not LIN c6,c7,c16
proof
assume LIN c6,c7,c16 ;
then c6,c7 // c6,c16 by AFF_1:def 1;
then c6,c7 // c9,c11 by E30, E33, AFF_1:14;
then c9,c10 // c9,c11 by E16, E19, AFF_1:14;
hence not verum by E23, AFF_1:def 1;
end;
set c17 = Line c11,c16;
E35: ( Line c11,c16 is_line & c11 in Line c11,c16 & c16 in Line c11,c16 ) by E32, AFF_1:38;
then c5 in Line c11,c16 by E15, E16, E30, E31, E32, E34, Def5;
then c16 in c4 by E16, E25, E35, AFF_1:30;
then c4 = Line c6,c8 by E16, E17, E26, E29,