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

Theorem cusgrasizeindslem1 24149
Description: Lemma 1 for cusgrasizeinds 24152. The domain of the edge function is the union of the arguments/indices of all edges containing a specific vertex and the arguments/indices of all edges not containing this vertex. (Contributed by Alexander van der Vekens, 4-Jan-2018.)
Hypothesis
Ref Expression
cusgrares.f  |-  F  =  ( E  |`  { x  e.  dom  E  |  N  e/  ( E `  x
) } )
Assertion
Ref Expression
cusgrasizeindslem1  |-  dom  E  =  ( dom  F  u.  { x  e.  dom  E  |  N  e.  ( E `  x ) } )
Distinct variable groups:    x, E    x, N
Allowed substitution hint:    F( x)

Proof of Theorem cusgrasizeindslem1
StepHypRef Expression
1 cusgrares.f . 2  |-  F  =  ( E  |`  { x  e.  dom  E  |  N  e/  ( E `  x
) } )
21usgrafilem1 24087 1  |-  dom  E  =  ( dom  F  u.  { x  e.  dom  E  |  N  e.  ( E `  x ) } )
Colors of variables: wff setvar class
Syntax hints:    = wceq 1379    e. wcel 1767    e/ wnel 2663   {crab 2818    u. cun 3474   dom cdm 4999    |` cres 5001   ` cfv 5586
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-9 1771  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445  ax-sep 4568  ax-nul 4576  ax-pr 4686
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ne 2664  df-nel 2665  df-ral 2819  df-rex 2820  df-rab 2823  df-v 3115  df-dif 3479  df-un 3481  df-in 3483  df-ss 3490  df-nul 3786  df-if 3940  df-sn 4028  df-pr 4030  df-op 4034  df-br 4448  df-opab 4506  df-xp 5005  df-dm 5009  df-res 5011
This theorem is referenced by:  cusgrasizeinds  24152
  Copyright terms: Public domain W3C validator