let G1 be _Graph; :: thesis:
let G2 be removeLoops of G1; :: thesis:

hereby :: thesis:

assume A1: G1 is chordal ; :: thesis:

let P2 be Walk of G2; :: thesis:
assume A2: ( P2 .length() > 3 & P2 is Cycle-like ) ; :: thesis:

reconsider P1 = P2 as Walk of G1 by GLIB_001:167;
( P1 .length() > 3 & P1 is Cycle-like ) by A2, GLIB_001:114, GLIB_006:24;
then consider m, n being odd Nat such that
A3: ( m + 2 < n & n <= len P1 & P1 . m <> P1 . n ) and
A4: ex e being object st e Joins P1 . m,P1 . n,G1 and
A5: for f being object st f in P1 .edges() holds
not f Joins P1 . m,P1 . n,G1 by A1, CHORD:def 11, CHORD:def 10;
take m = m; :: thesis:
take n = n; :: thesis:
thus ( m + 2 < n & n <= len P2 & P2 . m <> P2 . n ) by A3; :: thesis:

hereby :: thesis:

consider e being object such that
A6: e Joins P1 . m,P1 . n,G1 by A4;
take e = e; :: thesis:
A7: e in the_Edges_of G1 by A6, GLIB_000:def 13;
not e in G1 .loops() by A3, A6, Th46;
then e in (the_Edges_of G1) \ (G1 .loops()) by A7, XBOOLE_0:def 5;
then e in the_Edges_of G2 by GLIB_000:53;
hence e Joins P2 . m,P2 . n,G2 by A6, GLIB_000:73; :: thesis:

end;

let f be object ; :: thesis:
assume f in P2 .edges() ; :: thesis:
then f in P1 .edges() by GLIB_001:110;
hence not f Joins P2 . m,P2 . n,G2 by A5, GLIB_000:72; :: thesis:

end;

hence P2 is chordal by CHORD:def 10; :: thesis:

end;

hence G2 is chordal by CHORD:def 11; :: thesis:

end;

assume A8: G2 is chordal ; :: thesis:

let P1 be Walk of G1; :: thesis:
assume A9: ( P1 .length() > 3 & P1 is Cycle-like ) ; :: thesis:

P1 .edges() misses G1 .loops()

assume P1 .edges() meets G1 .loops() ; :: thesis:
then consider v, e being object such that
A10: ( e Joins v,v,G1 & P1 = G1 .walkOf (v,e,v) ) by A9, Th57;
(2 * (P1 .length())) + 1 = len P1 by GLIB_001:112
.= (2 * 1) + 1 by A10, GLIB_001:14 ;
hence contradiction by A9; :: thesis:

end;

then P1 .edges() c= (the_Edges_of G1) \ (G1 .loops()) by XBOOLE_1:86;
then A11: P1 .edges() c= the_Edges_of G2 by GLIB_000:53;
the_Vertices_of G1 = the_Vertices_of G2 by GLIB_000:53;
then P1 .vertices() c= the_Vertices_of G2 ;
then reconsider P2 = P1 as Walk of G2 by A11, GLIB_001:170;
( P2 .length() > 3 & P2 is Cycle-like ) by A9, GLIB_001:114, GLIB_006:24;
then consider m, n being odd Nat such that
A12: ( m + 2 < n & n <= len P2 & P2 . m <> P2 . n ) and
A13: ex e being object st e Joins P2 . m,P2 . n,G2 and
A14: for f being object st f in P2 .edges() holds
not f Joins P2 . m,P2 . n,G2 by A8, CHORD:def 11, CHORD:def 10;
take m = m; :: thesis:
take n = n; :: thesis:
thus ( m + 2 < n & n <= len P1 & P1 . m <> P1 . n ) by A12; :: thesis:
thus ex e being object st e Joins P1 . m,P1 . n,G1 by A13, GLIB_000:72; :: thesis:
let f be object ; :: thesis:
assume f in P1 .edges() ; :: thesis:
then A15: f in P2 .edges() by GLIB_001:110;
then not f Joins P2 . m,P2 . n,G2 by A14;
hence not f Joins P1 . m,P1 . n,G1 by A15, GLIB_000:73; :: thesis:

end;

hence P1 is chordal by CHORD:def 10; :: thesis:

end;

hence G1 is chordal by CHORD:def 11; :: thesis: