set V = {1,2};
set E = {1};
( 1 in {1,2} & 2 in {1,2} ) by TARSKI:def 2;
then reconsider S = {1} --> 1, T = {1} --> 2 as Function of {1},{1,2} by FUNCOP_1:45;
reconsider G = MultiGraphStruct(# {1,2},{1},S,T #) as Graph ;
take G ; :: thesis: ( G is finite & G is simple & G is connected & not G is void & G is strict )
thus G is finite ; :: thesis: ( G is simple & G is connected & not G is void & G is strict )
A1: 1 in {1} by TARSKI:def 1;
then A2: S . 1 = 1 by FUNCOP_1:7;
thus G is simple :: thesis: ( G is connected & not G is void & G is strict )
proof
given x being set such that A3: x in the carrier' of G and
A4: the Source of G . x = the Target of G . x ; :: according to GRAPH_1:def 9 :: thesis: contradiction
x = 1 by A3, TARSKI:def 1;
hence contradiction by A1, A2, A4, FUNCOP_1:7; :: thesis: verum
end;
A5: T . 1 = 2 by A1, FUNCOP_1:7;
thus G is connected :: thesis: ( not G is void & G is strict )
proof
set MSG = MultiGraphStruct(# the carrier of G, the carrier' of G, the Source of G, the Target of G #);
given G1, G2 being Graph such that A6: the carrier of G1 misses the carrier of G2 and
A7: G is_sum_of G1,G2 ; :: according to GRAPH_1:def 10 :: thesis: contradiction
A8: MultiGraphStruct(# the carrier of G, the carrier' of G, the Source of G, the Target of G #) = G1 \/ G2 by A7;
set V1 = the carrier of G1;
set V2 = the carrier of G2;
set T1 = the Target of G1;
set T2 = the Target of G2;
set S1 = the Source of G1;
set S2 = the Source of G2;
set E1 = the carrier' of G1;
set E2 = the carrier' of G2;
A9: (rng the Source of G1) \/ (rng the Target of G1) c= the carrier of G1 by Th2;
A10: (rng the Source of G2) \/ (rng the Target of G2) c= the carrier of G2 by Th2;
A11: ( the Target of G1 tolerates the Target of G2 & the Source of G1 tolerates the Source of G2 ) by A7;
then A12: the carrier of MultiGraphStruct(# the carrier of G, the carrier' of G, the Source of G, the Target of G #) = the carrier of G1 \/ the carrier of G2 by A8, GRAPH_1:def 5;
A13: the carrier' of MultiGraphStruct(# the carrier of G, the carrier' of G, the Source of G, the Target of G #) = the carrier' of G1 \/ the carrier' of G2 by A11, A8, GRAPH_1:def 5;
per cases ( ( the carrier' of G1 = {1} & the carrier' of G2 = {1} ) or ( the carrier' of G1 = {1} & the carrier' of G2 = {} ) or ( the carrier' of G1 = {} & the carrier' of G2 = {1} ) ) by A13, ZFMISC_1:37;
suppose A14: ( the carrier' of G1 = {1} & the carrier' of G2 = {1} ) ; :: thesis: contradiction
end;
suppose A16: ( the carrier' of G1 = {1} & the carrier' of G2 = {} ) ; :: thesis: contradiction
end;
suppose A19: ( the carrier' of G1 = {} & the carrier' of G2 = {1} ) ; :: thesis: contradiction
end;
end;
end;
thus not G is void ; :: thesis: G is strict
thus G is strict ; :: thesis: verum