let X be set ; :: thesis: for g being SimpleGraph of X
for v being set
for vg being finite set st vg = the carrier of g & v in vg & 1 + (degree g,v) = card vg holds
for w being Element of vg st v <> w holds
ex e being set st
( e in the SEdges of g & e = {v,w} )
let g be SimpleGraph of X; :: thesis: for v being set
for vg being finite set st vg = the carrier of g & v in vg & 1 + (degree g,v) = card vg holds
for w being Element of vg st v <> w holds
ex e being set st
( e in the SEdges of g & e = {v,w} )
let v be set ; :: thesis: for vg being finite set st vg = the carrier of g & v in vg & 1 + (degree g,v) = card vg holds
for w being Element of vg st v <> w holds
ex e being set st
( e in the SEdges of g & e = {v,w} )
let vg be finite set ; :: thesis: ( vg = the carrier of g & v in vg & 1 + (degree g,v) = card vg implies for w being Element of vg st v <> w holds
ex e being set st
( e in the SEdges of g & e = {v,w} ) )
assume A1:
( vg = the carrier of g & v in vg & 1 + (degree g,v) = card vg )
; :: thesis: for w being Element of vg st v <> w holds
ex e being set st
( e in the SEdges of g & e = {v,w} )
then
vg is Subset of X
by Th27;
then reconsider X = X as non empty set by A1;
let w be Element of vg; :: thesis: ( v <> w implies ex e being set st
( e in the SEdges of g & e = {v,w} ) )
assume A2:
v <> w
; :: thesis: ex e being set st
( e in the SEdges of g & e = {v,w} )
take
{v,w}
; :: thesis: ( {v,w} in the SEdges of g & {v,w} = {v,w} )
thus
{v,w} = {v,w}
; :: thesis: verum