let G, H be _Graph; ( 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)} )
hence
the_Vertices_of {G,H} = {(the_Vertices_of G),(the_Vertices_of H)}
by TARSKI:2; ( 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)} )
hence
the_Edges_of {G,H} = {(the_Edges_of G),(the_Edges_of H)}
by TARSKI:2; ( 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)} )
hence
the_Source_of {G,H} = {(the_Source_of G),(the_Source_of H)}
by TARSKI:2; the_Target_of {G,H} = {(the_Target_of G),(the_Target_of H)}
hence
the_Target_of {G,H} = {(the_Target_of G),(the_Target_of H)}
by TARSKI:2; verum