MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  upgrfn Structured version   Visualization version   Unicode version

Theorem upgrfn 25982
Description: The edge function of an undirected pseudograph is a function into unordered pairs of vertices. (Contributed by Mario Carneiro, 11-Mar-2015.) (Revised by AV, 10-Oct-2020.)
Hypotheses
Ref Expression
isupgr.v  |-  V  =  (Vtx `  G )
isupgr.e  |-  E  =  (iEdg `  G )
Assertion
Ref Expression
upgrfn  |-  ( ( G  e. UPGraph  /\  E  Fn  A )  ->  E : A --> { x  e.  ( ~P V  \  { (/) } )  |  ( # `  x
)  <_  2 }
)
Distinct variable groups:    x, G    x, V
Allowed substitution hints:    A( x)    E( x)

Proof of Theorem upgrfn
StepHypRef Expression
1 isupgr.v . . . 4  |-  V  =  (Vtx `  G )
2 isupgr.e . . . 4  |-  E  =  (iEdg `  G )
31, 2upgrf 25981 . . 3  |-  ( G  e. UPGraph  ->  E : dom  E --> { x  e.  ( ~P V  \  { (/)
} )  |  (
# `  x )  <_  2 } )
4 fndm 5990 . . . 4  |-  ( E  Fn  A  ->  dom  E  =  A )
54feq2d 6031 . . 3  |-  ( E  Fn  A  ->  ( E : dom  E --> { x  e.  ( ~P V  \  { (/) } )  |  ( # `  x
)  <_  2 }  <->  E : A --> { x  e.  ( ~P V  \  { (/) } )  |  ( # `  x
)  <_  2 }
) )
63, 5syl5ibcom 235 . 2  |-  ( G  e. UPGraph  ->  ( E  Fn  A  ->  E : A --> { x  e.  ( ~P V  \  { (/) } )  |  ( # `  x )  <_  2 } ) )
76imp 445 1  |-  ( ( G  e. UPGraph  /\  E  Fn  A )  ->  E : A --> { x  e.  ( ~P V  \  { (/) } )  |  ( # `  x
)  <_  2 }
)
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 384    = wceq 1483    e. wcel 1990   {crab 2916    \ cdif 3571   (/)c0 3915   ~Pcpw 4158   {csn 4177   class class class wbr 4653   dom cdm 5114    Fn wfn 5883   -->wf 5884   ` cfv 5888    <_ cle 10075   2c2 11070   #chash 13117  Vtxcvtx 25874  iEdgciedg 25875   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-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-nul 4789
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-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-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-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-upgr 25977
This theorem is referenced by:  upgrn0  25984  upgrle  25985
  Copyright terms: Public domain W3C validator