Theorem upgredgss 26027

Description: The set of edges of a pseudograph is a subset of the set of unordered pairs of vertices. (Contributed by AV, 29-Nov-2020.)

Assertion

Ref	Expression
upgredgss	|- ( G e. UPGraph -> (Edg ` G ) C_ { x e. ( ~P (Vtx ` G ) \ { (/) } ) | ( # ` x ) <_ 2 } )

Distinct variable group:   x, G

Proof of Theorem upgredgss

Step	Hyp	Ref	Expression
1		edgval 25941	. 2 |- (Edg ` G ) = ran (iEdg ` G )
2		eqid 2622	. . . 4 |- (Vtx ` G ) = (Vtx ` G )
3		eqid 2622	. . . 4 |- (iEdg ` G ) = (iEdg ` G )
4	2, 3	upgrf 25981	. . 3 |- ( G e. UPGraph -> (iEdg ` G ) : dom (iEdg ` G ) --> { x e. ( ~P (Vtx ` G ) \ { (/) } ) | ( # ` x ) <_ 2 } )
5		frn 6053	. . 3 |- ( (iEdg ` G ) : dom (iEdg ` G ) --> { x e. ( ~P (Vtx ` G ) \ { (/) } ) | ( # ` x ) <_ 2 } -> ran (iEdg ` G ) C_ { x e. ( ~P (Vtx ` G ) \ { (/) } ) | ( # ` x ) <_ 2 } )
6	4, 5	syl 17	. 2 |- ( G e. UPGraph -> ran (iEdg ` G ) C_ { x e. ( ~P (Vtx ` G ) \ { (/) } ) | ( # ` x ) <_ 2 } )
7	1, 6	syl5eqss 3649	1 |- ( G e. UPGraph -> (Edg ` G ) C_ { x e. ( ~P (Vtx ` G ) \ { (/) } ) | ( # ` x ) <_ 2 } )

Syntax hints:   -> wi 4   e. wcel 1990   {crab 2916   \ cdif 3571   C_ wss 3574   (/)c0 3915   ~Pcpw 4158   {csn 4177   class class class wbr 4653   dom cdm 5114   ran crn 5115   -->wf 5884   ` cfv 5888   <_ cle 10075   2c2 11070   #chash 13117  Vtxcvtx 25874  iEdgciedg 25875  Edgcedg 25939   UPGraph cupgr 25975

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-fv 5896  df-edg 25940  df-upgr 25977

This theorem is referenced by:  uspgrupgrushgr  26072  upgredgssspr  41751