let X be set ; for V being Subset of
for E being Subset of
for v1, v2 being set st v1 in V & v2 in V & v1 <> v2 & SimpleGraphStruct(# V,E #) in SIMPLEGRAPHS X holds
ex v1v2 being finite Subset of st
( v1v2 = E \/ {{v1,v2}} & SimpleGraphStruct(# V,v1v2 #) in SIMPLEGRAPHS X )
let V be Subset of ; for E being Subset of
for v1, v2 being set st v1 in V & v2 in V & v1 <> v2 & SimpleGraphStruct(# V,E #) in SIMPLEGRAPHS X holds
ex v1v2 being finite Subset of st
( v1v2 = E \/ {{v1,v2}} & SimpleGraphStruct(# V,v1v2 #) in SIMPLEGRAPHS X )
let E be Subset of ; for v1, v2 being set st v1 in V & v2 in V & v1 <> v2 & SimpleGraphStruct(# V,E #) in SIMPLEGRAPHS X holds
ex v1v2 being finite Subset of st
( v1v2 = E \/ {{v1,v2}} & SimpleGraphStruct(# V,v1v2 #) in SIMPLEGRAPHS X )
let v1, v2 be set ; ( v1 in V & v2 in V & v1 <> v2 & SimpleGraphStruct(# V,E #) in SIMPLEGRAPHS X implies ex v1v2 being finite Subset of st
( v1v2 = E \/ {{v1,v2}} & SimpleGraphStruct(# V,v1v2 #) in SIMPLEGRAPHS X ) )
set g = SimpleGraphStruct(# V,E #);
assume that
A1:
( v1 in V & v2 in V )
and
A2:
not v1 = v2
and
A3:
SimpleGraphStruct(# V,E #) in SIMPLEGRAPHS X
; ex v1v2 being finite Subset of st
( v1v2 = E \/ {{v1,v2}} & SimpleGraphStruct(# V,v1v2 #) in SIMPLEGRAPHS X )
reconsider g = SimpleGraphStruct(# V,E #) as SimpleGraph of X by A3, Def7;
A4:
the SEdges of g is finite Subset of
by Th27;
the carrier of g is finite Subset of
by Th27;
then reconsider V = V as finite Subset of ;
( E \/ {{v1,v2}} c= TWOELEMENTSETS V & E \/ {{v1,v2}} is finite )
then reconsider E' = E \/ {{v1,v2}} as finite Subset of ;
SimpleGraphStruct(# V,E' #) in SIMPLEGRAPHS X
;
hence
ex v1v2 being finite Subset of st
( v1v2 = E \/ {{v1,v2}} & SimpleGraphStruct(# V,v1v2 #) in SIMPLEGRAPHS X )
; verum