Theorem upgrf 27484

Description: The edge function of an undirected pseudograph is a function into unordered pairs of vertices. Version of upgrfn 27485 without explicitly specified domain of the edge function. (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by AV, 10-Oct-2020.)

Hypotheses

Ref	Expression
isupgr.v	⊢ 𝑉 = (Vtx‘𝐺)
isupgr.e	⊢ 𝐸 = (iEdg‘𝐺)

Assertion

Ref	Expression
upgrf	⊢ (𝐺 ∈ UPGraph → 𝐸:dom 𝐸⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})

Distinct variable groups:   𝑥,𝐺   𝑥,𝑉

Allowed substitution hint:   𝐸(𝑥)

Proof of Theorem upgrf

Step	Hyp	Ref	Expression
1		isupgr.v	. . 3 ⊢ 𝑉 = (Vtx‘𝐺)
2		isupgr.e	. . 3 ⊢ 𝐸 = (iEdg‘𝐺)
3	1, 2	isupgr 27482	. 2 ⊢ (𝐺 ∈ UPGraph → (𝐺 ∈ UPGraph ↔ 𝐸:dom 𝐸⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}))
4	3	ibi 266	1 ⊢ (𝐺 ∈ UPGraph → 𝐸:dom 𝐸⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})

Syntax hints:   → wi 4   = wceq 1537   ∈ wcel 2101  {crab 3221   ∖ cdif 3886  ∅c0 4259  𝒫 cpw 4536  {csn 4564   class class class wbr 5077  dom cdm 5591  ⟶wf 6443  ‘cfv 6447   ≤ cle 11038  2c2 12056  ♯chash 14072  Vtxcvtx 27394  iEdgciedg 27395  UPGraphcupgr 27478

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2103  ax-9 2111  ax-ext 2704  ax-nul 5233

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1540  df-fal 1550  df-ex 1778  df-sb 2063  df-clab 2711  df-cleq 2725  df-clel 2811  df-ne 2939  df-rab 3224  df-v 3436  df-sbc 3719  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4260  df-if 4463  df-pw 4538  df-sn 4565  df-pr 4567  df-op 4571  df-uni 4842  df-br 5078  df-opab 5140  df-rel 5598  df-cnv 5599  df-co 5600  df-dm 5601  df-rn 5602  df-iota 6399  df-fun 6449  df-fn 6450  df-f 6451  df-fv 6455  df-upgr 27480

This theorem is referenced by:  upgrfn  27485  upgrss  27486  upgrop  27492  upgruhgr  27500  upgrun  27516  umgrislfupgr  27521  upgredgss  27530  edgupgr  27532  upgredg  27535  upgrreslem  27699  upgrres1  27708