let G, H be _Graph; :: thesis: ( the_Vertices_of {G,H} = {(the_Vertices_of G),(the_Vertices_of H)} & the_Edges_of {G,H} = {(the_Edges_of G),(the_Edges_of H)} & the_Source_of {G,H} = {(the_Source_of G),(the_Source_of H)} & the_Target_of {G,H} = {(the_Target_of G),(the_Target_of H)} )
now :: thesis: for x being object holds
( ( x in the_Vertices_of {G,H} implies x in {(the_Vertices_of G),(the_Vertices_of H)} ) & ( x in {(the_Vertices_of G),(the_Vertices_of H)} implies x in the_Vertices_of {G,H} ) )
end;
hence the_Vertices_of {G,H} = {(the_Vertices_of G),(the_Vertices_of H)} by TARSKI:2; :: thesis: ( the_Edges_of {G,H} = {(the_Edges_of G),(the_Edges_of H)} & the_Source_of {G,H} = {(the_Source_of G),(the_Source_of H)} & the_Target_of {G,H} = {(the_Target_of G),(the_Target_of H)} )
now :: thesis: for x being object holds
( ( x in the_Edges_of {G,H} implies x in {(the_Edges_of G),(the_Edges_of H)} ) & ( x in {(the_Edges_of G),(the_Edges_of H)} implies x in the_Edges_of {G,H} ) )
end;
hence the_Edges_of {G,H} = {(the_Edges_of G),(the_Edges_of H)} by TARSKI:2; :: thesis: ( the_Source_of {G,H} = {(the_Source_of G),(the_Source_of H)} & the_Target_of {G,H} = {(the_Target_of G),(the_Target_of H)} )
now :: thesis: for x being object holds
( ( x in the_Source_of {G,H} implies x in {(the_Source_of G),(the_Source_of H)} ) & ( x in {(the_Source_of G),(the_Source_of H)} implies x in the_Source_of {G,H} ) )
end;
hence the_Source_of {G,H} = {(the_Source_of G),(the_Source_of H)} by TARSKI:2; :: thesis: the_Target_of {G,H} = {(the_Target_of G),(the_Target_of H)}
now :: thesis: for x being object holds
( ( x in the_Target_of {G,H} implies x in {(the_Target_of G),(the_Target_of H)} ) & ( x in {(the_Target_of G),(the_Target_of H)} implies x in the_Target_of {G,H} ) )
end;
hence the_Target_of {G,H} = {(the_Target_of G),(the_Target_of H)} by TARSKI:2; :: thesis: verum