Theorem upgredgss 29201

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	⊢ (𝐺 ∈ UPGraph → (Edg‘𝐺) ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})

Distinct variable group:   𝑥,𝐺

Proof of Theorem upgredgss

Step	Hyp	Ref	Expression
1		edgval 29118	. 2 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺)
2		eqid 2736	. . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
3		eqid 2736	. . . 4 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺)
4	2, 3	upgrf 29155	. . 3 ⊢ (𝐺 ∈ UPGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
5	4	frnd 6676	. 2 ⊢ (𝐺 ∈ UPGraph → ran (iEdg‘𝐺) ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
6	1, 5	eqsstrid 3960	1 ⊢ (𝐺 ∈ UPGraph → (Edg‘𝐺) ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})

Syntax hints:   → wi 4   ∈ wcel 2114  {crab 3389   ∖ cdif 3886   ⊆ wss 3889  ∅c0 4273  𝒫 cpw 4541  {csn 4567   class class class wbr 5085  dom cdm 5631  ran crn 5632  ‘cfv 6498   ≤ cle 11180  2c2 12236  ♯chash 14292  Vtxcvtx 29065  iEdgciedg 29066  Edgcedg 29116  UPGraphcupgr 29149

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pr 5375  ax-un 7689

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-sbc 3729  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-fv 6506  df-edg 29117  df-upgr 29151

This theorem is referenced by:  uspgrupgrushgr  29248  upgredgssspr  48619