Theorem ausgrumgrien 16048

Description: If an alternatively defined simple graph has the vertices and edges of an arbitrary graph, the arbitrary graph is an undirected multigraph. (Contributed by AV, 18-Oct-2020.) (Revised by AV, 25-Nov-2020.)

Hypothesis

Ref	Expression
ausgr.1	|- G = { <. v , e >. | e C_ { x e. ~P v | x ~~ 2o } }

Assertion

Ref	Expression
ausgrumgrien	|- ( ( H e. W /\ (Vtx ` H ) G (Edg ` H ) /\ Fun (iEdg ` H ) ) -> H e. UMGraph )

Distinct variable group:   v, e, x, H

Allowed substitution hints:   G( x, v, e)   W( x, v, e)

Proof of Theorem ausgrumgrien

Step	Hyp	Ref	Expression
1		vtxex 15896	. . . . 5 |- ( H e. W -> (Vtx ` H ) e. _V )
2		edgvalg 15937	. . . . . 6 |- ( H e. W -> (Edg ` H ) = ran (iEdg ` H ) )
3		iedgex 15897	. . . . . . 7 |- ( H e. W -> (iEdg ` H ) e. _V )
4		rnexg 4997	. . . . . . 7 |- ( (iEdg ` H ) e. _V -> ran (iEdg ` H ) e. _V )
5	3, 4	syl 14	. . . . . 6 |- ( H e. W -> ran (iEdg ` H ) e. _V )
6	2, 5	eqeltrd 2308	. . . . 5 |- ( H e. W -> (Edg ` H ) e. _V )
7		ausgr.1	. . . . . 6 |- G = { <. v , e >. | e C_ { x e. ~P v | x ~~ 2o } }
8	7	isausgren 16045	. . . . 5 |- ( ( (Vtx ` H ) e. _V /\ (Edg ` H ) e. _V ) -> ( (Vtx ` H ) G (Edg ` H ) <-> (Edg ` H ) C_ { x e. ~P (Vtx ` H ) | x ~~ 2o } ) )
9	1, 6, 8	syl2anc 411	. . . 4 |- ( H e. W -> ( (Vtx ` H ) G (Edg ` H ) <-> (Edg ` H ) C_ { x e. ~P (Vtx ` H ) | x ~~ 2o } ) )
10	2	sseq1d 3256	. . . . 5 |- ( H e. W -> ( (Edg ` H ) C_ { x e. ~P (Vtx ` H ) | x ~~ 2o } <-> ran (iEdg ` H ) C_ { x e. ~P (Vtx ` H ) | x ~~ 2o } ) )
11		funfn 5356	. . . . . . . . 9 |- ( Fun (iEdg ` H ) <-> (iEdg ` H ) Fn dom (iEdg ` H ) )
12	11	biimpi 120	. . . . . . . 8 |- ( Fun (iEdg ` H ) -> (iEdg ` H ) Fn dom (iEdg ` H ) )
13	12	3ad2ant3 1046	. . . . . . 7 |- ( ( H e. W /\ ran (iEdg ` H ) C_ { x e. ~P (Vtx ` H ) | x ~~ 2o } /\ Fun (iEdg ` H ) ) -> (iEdg ` H ) Fn dom (iEdg ` H ) )
14		simp2 1024	. . . . . . 7 |- ( ( H e. W /\ ran (iEdg ` H ) C_ { x e. ~P (Vtx ` H ) | x ~~ 2o } /\ Fun (iEdg ` H ) ) -> ran (iEdg ` H ) C_ { x e. ~P (Vtx ` H ) | x ~~ 2o } )
15		df-f 5330	. . . . . . 7 |- ( (iEdg ` H ) : dom (iEdg ` H ) --> { x e. ~P (Vtx ` H ) | x ~~ 2o } <-> ( (iEdg ` H ) Fn dom (iEdg ` H ) /\ ran (iEdg ` H ) C_ { x e. ~P (Vtx ` H ) | x ~~ 2o } ) )
16	13, 14, 15	sylanbrc 417	. . . . . 6 |- ( ( H e. W /\ ran (iEdg ` H ) C_ { x e. ~P (Vtx ` H ) | x ~~ 2o } /\ Fun (iEdg ` H ) ) -> (iEdg ` H ) : dom (iEdg ` H ) --> { x e. ~P (Vtx ` H ) | x ~~ 2o } )
17	16	3exp 1228	. . . . 5 |- ( H e. W -> ( ran (iEdg ` H ) C_ { x e. ~P (Vtx ` H ) | x ~~ 2o } -> ( Fun (iEdg ` H ) -> (iEdg ` H ) : dom (iEdg ` H ) --> { x e. ~P (Vtx ` H ) | x ~~ 2o } ) ) )
18	10, 17	sylbid 150	. . . 4 |- ( H e. W -> ( (Edg ` H ) C_ { x e. ~P (Vtx ` H ) | x ~~ 2o } -> ( Fun (iEdg ` H ) -> (iEdg ` H ) : dom (iEdg ` H ) --> { x e. ~P (Vtx ` H ) | x ~~ 2o } ) ) )
19	9, 18	sylbid 150	. . 3 |- ( H e. W -> ( (Vtx ` H ) G (Edg ` H ) -> ( Fun (iEdg ` H ) -> (iEdg ` H ) : dom (iEdg ` H ) --> { x e. ~P (Vtx ` H ) | x ~~ 2o } ) ) )
20	19	3imp 1219	. 2 |- ( ( H e. W /\ (Vtx ` H ) G (Edg ` H ) /\ Fun (iEdg ` H ) ) -> (iEdg ` H ) : dom (iEdg ` H ) --> { x e. ~P (Vtx ` H ) | x ~~ 2o } )
21		eqid 2231	. . . 4 |- (Vtx ` H ) = (Vtx ` H )
22		eqid 2231	. . . 4 |- (iEdg ` H ) = (iEdg ` H )
23	21, 22	isumgren 15983	. . 3 |- ( H e. W -> ( H e. UMGraph <-> (iEdg ` H ) : dom (iEdg ` H ) --> { x e. ~P (Vtx ` H ) | x ~~ 2o } ) )
24	23	3ad2ant1 1044	. 2 |- ( ( H e. W /\ (Vtx ` H ) G (Edg ` H ) /\ Fun (iEdg ` H ) ) -> ( H e. UMGraph <-> (iEdg ` H ) : dom (iEdg ` H ) --> { x e. ~P (Vtx ` H ) | x ~~ 2o } ) )
25	20, 24	mpbird 167	1 |- ( ( H e. W /\ (Vtx ` H ) G (Edg ` H ) /\ Fun (iEdg ` H ) ) -> H e. UMGraph )

Syntax hints:   -> wi 4   <-> wb 105   /\ w3a 1004   = wceq 1397   e. wcel 2202   {crab 2514   _Vcvv 2802   C_ wss 3200   ~Pcpw 3652   class class class wbr 4088   {copab 4149   dom cdm 4725   ran crn 4726   Fun wfun 5320   Fn wfn 5321   -->wf 5322   ` cfv 5326   2oc2o 6579   ~~ cen 6910  Vtxcvtx 15890  iEdgciedg 15891  Edgcedg 15935  UMGraphcumgr 15970

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-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-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-edg 15936  df-umgren 15972

This theorem is referenced by: (None)