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

Theorem uhgrun 25969
Description: The union  U of two (undirected) hypergraphs  G and  H with the same vertex set  V is a hypergraph with the vertex  V and the union  ( E  u.  F ) of the (indexed) edges. (Contributed by AV, 11-Oct-2020.) (Revised by AV, 24-Oct-2021.)
Hypotheses
Ref Expression
uhgrun.g  |-  ( ph  ->  G  e. UHGraph  )
uhgrun.h  |-  ( ph  ->  H  e. UHGraph  )
uhgrun.e  |-  E  =  (iEdg `  G )
uhgrun.f  |-  F  =  (iEdg `  H )
uhgrun.vg  |-  V  =  (Vtx `  G )
uhgrun.vh  |-  ( ph  ->  (Vtx `  H )  =  V )
uhgrun.i  |-  ( ph  ->  ( dom  E  i^i  dom 
F )  =  (/) )
uhgrun.u  |-  ( ph  ->  U  e.  W )
uhgrun.v  |-  ( ph  ->  (Vtx `  U )  =  V )
uhgrun.un  |-  ( ph  ->  (iEdg `  U )  =  ( E  u.  F ) )
Assertion
Ref Expression
uhgrun  |-  ( ph  ->  U  e. UHGraph  )

Proof of Theorem uhgrun
StepHypRef Expression
1 uhgrun.g . . . . 5  |-  ( ph  ->  G  e. UHGraph  )
2 uhgrun.vg . . . . . 6  |-  V  =  (Vtx `  G )
3 uhgrun.e . . . . . 6  |-  E  =  (iEdg `  G )
42, 3uhgrf 25957 . . . . 5  |-  ( G  e. UHGraph  ->  E : dom  E --> ( ~P V  \  { (/) } ) )
51, 4syl 17 . . . 4  |-  ( ph  ->  E : dom  E --> ( ~P V  \  { (/)
} ) )
6 uhgrun.h . . . . . 6  |-  ( ph  ->  H  e. UHGraph  )
7 eqid 2622 . . . . . . 7  |-  (Vtx `  H )  =  (Vtx
`  H )
8 uhgrun.f . . . . . . 7  |-  F  =  (iEdg `  H )
97, 8uhgrf 25957 . . . . . 6  |-  ( H  e. UHGraph  ->  F : dom  F --> ( ~P (Vtx `  H )  \  { (/)
} ) )
106, 9syl 17 . . . . 5  |-  ( ph  ->  F : dom  F --> ( ~P (Vtx `  H
)  \  { (/) } ) )
11 uhgrun.vh . . . . . . . . 9  |-  ( ph  ->  (Vtx `  H )  =  V )
1211eqcomd 2628 . . . . . . . 8  |-  ( ph  ->  V  =  (Vtx `  H ) )
1312pweqd 4163 . . . . . . 7  |-  ( ph  ->  ~P V  =  ~P (Vtx `  H ) )
1413difeq1d 3727 . . . . . 6  |-  ( ph  ->  ( ~P V  \  { (/) } )  =  ( ~P (Vtx `  H )  \  { (/)
} ) )
1514feq3d 6032 . . . . 5  |-  ( ph  ->  ( F : dom  F --> ( ~P V  \  { (/) } )  <->  F : dom  F --> ( ~P (Vtx `  H )  \  { (/)
} ) ) )
1610, 15mpbird 247 . . . 4  |-  ( ph  ->  F : dom  F --> ( ~P V  \  { (/)
} ) )
17 uhgrun.i . . . 4  |-  ( ph  ->  ( dom  E  i^i  dom 
F )  =  (/) )
185, 16, 17fun2d 6068 . . 3  |-  ( ph  ->  ( E  u.  F
) : ( dom 
E  u.  dom  F
) --> ( ~P V  \  { (/) } ) )
19 uhgrun.un . . . 4  |-  ( ph  ->  (iEdg `  U )  =  ( E  u.  F ) )
2019dmeqd 5326 . . . . 5  |-  ( ph  ->  dom  (iEdg `  U
)  =  dom  ( E  u.  F )
)
21 dmun 5331 . . . . 5  |-  dom  ( E  u.  F )  =  ( dom  E  u.  dom  F )
2220, 21syl6eq 2672 . . . 4  |-  ( ph  ->  dom  (iEdg `  U
)  =  ( dom 
E  u.  dom  F
) )
23 uhgrun.v . . . . . 6  |-  ( ph  ->  (Vtx `  U )  =  V )
2423pweqd 4163 . . . . 5  |-  ( ph  ->  ~P (Vtx `  U
)  =  ~P V
)
2524difeq1d 3727 . . . 4  |-  ( ph  ->  ( ~P (Vtx `  U )  \  { (/)
} )  =  ( ~P V  \  { (/)
} ) )
2619, 22, 25feq123d 6034 . . 3  |-  ( ph  ->  ( (iEdg `  U
) : dom  (iEdg `  U ) --> ( ~P (Vtx `  U )  \  { (/) } )  <->  ( E  u.  F ) : ( dom  E  u.  dom  F ) --> ( ~P V  \  { (/) } ) ) )
2718, 26mpbird 247 . 2  |-  ( ph  ->  (iEdg `  U ) : dom  (iEdg `  U
) --> ( ~P (Vtx `  U )  \  { (/)
} ) )
28 uhgrun.u . . 3  |-  ( ph  ->  U  e.  W )
29 eqid 2622 . . . 4  |-  (Vtx `  U )  =  (Vtx
`  U )
30 eqid 2622 . . . 4  |-  (iEdg `  U )  =  (iEdg `  U )
3129, 30isuhgr 25955 . . 3  |-  ( U  e.  W  ->  ( U  e. UHGraph  <->  (iEdg `  U ) : dom  (iEdg `  U
) --> ( ~P (Vtx `  U )  \  { (/)
} ) ) )
3228, 31syl 17 . 2  |-  ( ph  ->  ( U  e. UHGraph  <->  (iEdg `  U
) : dom  (iEdg `  U ) --> ( ~P (Vtx `  U )  \  { (/) } ) ) )
3327, 32mpbird 247 1  |-  ( ph  ->  U  e. UHGraph  )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196    = wceq 1483    e. wcel 1990    \ cdif 3571    u. cun 3572    i^i cin 3573   (/)c0 3915   ~Pcpw 4158   {csn 4177   dom cdm 5114   -->wf 5884   ` cfv 5888  Vtxcvtx 25874  iEdgciedg 25875   UHGraph cuhgr 25951
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-sep 4781  ax-nul 4789  ax-pr 4906
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-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-id 5024  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-uhgr 25953
This theorem is referenced by:  uhgrunop  25970  ushgrun  25971
  Copyright terms: Public domain W3C validator