Theorem usgrun 16071

Description: The union U of two simple graphs G and H with the same vertex set V is a multigraph (not necessarily a simple graph!) with the vertex V and the union ( E u. F ) of the (indexed) edges. (Contributed by AV, 29-Nov-2020.)

Hypotheses

Ref	Expression
usgrun.g	|- ( ph -> G e. USGraph )
usgrun.h	|- ( ph -> H e. USGraph )
usgrun.e	|- E = (iEdg ` G )
usgrun.f	|- F = (iEdg ` H )
usgrun.vg	|- V = (Vtx ` G )
usgrun.vh	|- ( ph -> (Vtx ` H ) = V )
usgrun.i	|- ( ph -> ( dom E i^i dom F ) = (/) )
usgrun.u	|- ( ph -> U e. W )
usgrun.v	|- ( ph -> (Vtx ` U ) = V )
usgrun.un	|- ( ph -> (iEdg ` U ) = ( E u. F ) )

Assertion

Ref	Expression
usgrun	|- ( ph -> U e. UMGraph )

Proof of Theorem usgrun

Step	Hyp	Ref	Expression
1		usgrun.g	. . 3 |- ( ph -> G e. USGraph )
2		usgrumgr 16062	. . 3 |- ( G e. USGraph -> G e. UMGraph )
3	1, 2	syl 14	. 2 |- ( ph -> G e. UMGraph )
4		usgrun.h	. . 3 |- ( ph -> H e. USGraph )
5		usgrumgr 16062	. . 3 |- ( H e. USGraph -> H e. UMGraph )
6	4, 5	syl 14	. 2 |- ( ph -> H e. UMGraph )
7		usgrun.e	. 2 |- E = (iEdg ` G )
8		usgrun.f	. 2 |- F = (iEdg ` H )
9		usgrun.vg	. 2 |- V = (Vtx ` G )
10		usgrun.vh	. 2 |- ( ph -> (Vtx ` H ) = V )
11		usgrun.i	. 2 |- ( ph -> ( dom E i^i dom F ) = (/) )
12		usgrun.u	. 2 |- ( ph -> U e. W )
13		usgrun.v	. 2 |- ( ph -> (Vtx ` U ) = V )
14		usgrun.un	. 2 |- ( ph -> (iEdg ` U ) = ( E u. F ) )
15	3, 6, 7, 8, 9, 10, 11, 12, 13, 14	umgrun 16006	1 |- ( ph -> U e. UMGraph )

Syntax hints:   -> wi 4   = wceq 1397   e. wcel 2202   u. cun 3198   i^i cin 3199   (/)c0 3494   dom cdm 4725   ` cfv 5326  Vtxcvtx 15890  iEdgciedg 15891  UMGraphcumgr 15970  USGraphcusgr 16032

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8126  ax-resscn 8127  ax-1cn 8128  ax-1re 8129  ax-icn 8130  ax-addcl 8131  ax-addrcl 8132  ax-mulcl 8133  ax-addcom 8135  ax-mulcom 8136  ax-addass 8137  ax-mulass 8138  ax-distr 8139  ax-i2m1 8140  ax-1rid 8142  ax-0id 8143  ax-rnegex 8144  ax-cnre 8146

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-fv 5334  df-riota 5974  df-ov 6024  df-oprab 6025  df-mpo 6026  df-1st 6306  df-2nd 6307  df-sub 8355  df-inn 9147  df-2 9205  df-3 9206  df-4 9207  df-5 9208  df-6 9209  df-7 9210  df-8 9211  df-9 9212  df-n0 9406  df-dec 9615  df-ndx 13106  df-slot 13107  df-base 13109  df-edgf 15883  df-vtx 15892  df-iedg 15893  df-umgren 15972  df-usgren 16034

This theorem is referenced by: (None)