let X be set ; :: thesis: for G being finite Graph
for v being Vertex of G holds
( Edges_In v,X = Edges_In v,(X /\ the carrier' of G) & Edges_Out v,X = Edges_Out v,(X /\ the carrier' of G) )
let G be finite Graph; :: thesis: for v being Vertex of G holds
( Edges_In v,X = Edges_In v,(X /\ the carrier' of G) & Edges_Out v,X = Edges_Out v,(X /\ the carrier' of G) )
let v be Vertex of G; :: thesis: ( Edges_In v,X = Edges_In v,(X /\ the carrier' of G) & Edges_Out v,X = Edges_Out v,(X /\ the carrier' of G) )
set E = the carrier' of G;
hence
Edges_In v,X = Edges_In v,(X /\ the carrier' of G)
by TARSKI:2; :: thesis: Edges_Out v,X = Edges_Out v,(X /\ the carrier' of G)
hence
Edges_Out v,X = Edges_Out v,(X /\ the carrier' of G)
by TARSKI:2; :: thesis: verum