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

Theorem uhgraun 24125
 Description: The union of two (undirected) hypergraphs (with the same vertex set): If and are hypergraphs, then is a hypergraph (the vertex set stays the same, but the edges from both graphs are kept, possibly resulting in two edges between two vertices), analogous to umgraun 24142. (Contributed by Alexander van der Vekens, 27-Dec-2017.)
Hypotheses
Ref Expression
uhgraun.e
uhgraun.f
uhgraun.i
uhgraun.ge UHGrph
uhgraun.gf UHGrph
Assertion
Ref Expression
uhgraun UHGrph

Proof of Theorem uhgraun
StepHypRef Expression
1 uhgraun.ge . . . . . 6 UHGrph
2 uhgraf 24113 . . . . . 6 UHGrph
31, 2syl 16 . . . . 5
4 uhgraun.e . . . . 5
5 fndm 5686 . . . . . . 7
65feq2d 5724 . . . . . 6
76biimpac 486 . . . . 5
83, 4, 7syl2anc 661 . . . 4
9 uhgraun.gf . . . . . 6 UHGrph
10 uhgraf 24113 . . . . . 6 UHGrph
119, 10syl 16 . . . . 5
12 uhgraun.f . . . . 5
13 fndm 5686 . . . . . . 7
1413feq2d 5724 . . . . . 6
1514biimpac 486 . . . . 5
1611, 12, 15syl2anc 661 . . . 4
17 uhgraun.i . . . 4
18 fun2 5755 . . . 4
198, 16, 17, 18syl21anc 1227 . . 3
20 fdm 5741 . . . . 5
2119, 20syl 16 . . . 4
2221feq2d 5724 . . 3
2319, 22mpbird 232 . 2
24 reluhgra 24108 . . . 4 UHGrph
25 releldm 5241 . . . 4 UHGrph UHGrph UHGrph
2624, 1, 25sylancr 663 . . 3 UHGrph
27 uhgrav 24110 . . . . . 6 UHGrph
2827simprd 463 . . . . 5 UHGrph
291, 28syl 16 . . . 4
30 uhgrav 24110 . . . . . 6 UHGrph
3130simprd 463 . . . . 5 UHGrph
329, 31syl 16 . . . 4
33 unexg 6596 . . . 4
3429, 32, 33syl2anc 661 . . 3
35 isuhgra 24112 . . 3 UHGrph UHGrph
3626, 34, 35syl2anc 661 . 2 UHGrph
3723, 36mpbird 232 1 UHGrph
 Colors of variables: wff setvar class Syntax hints:   wi 4   wb 184   wceq 1379   wcel 1767  cvv 3118   cdif 3478   cun 3479   cin 3480  c0 3790  cpw 4016  csn 4033   class class class wbr 4453   cdm 5005   wrel 5010   wfn 5589  wf 5590   UHGrph cuhg 24104 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-8 1769  ax-9 1771  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445  ax-sep 4574  ax-nul 4582  ax-pr 4692  ax-un 6587 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-eu 2279  df-mo 2280  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ne 2664  df-ral 2822  df-rex 2823  df-rab 2826  df-v 3120  df-dif 3484  df-un 3486  df-in 3488  df-ss 3495  df-nul 3791  df-if 3946  df-pw 4018  df-sn 4034  df-pr 4036  df-op 4040  df-uni 4252  df-br 4454  df-opab 4512  df-id 4801  df-xp 5011  df-rel 5012  df-cnv 5013  df-co 5014  df-dm 5015  df-rn 5016  df-fun 5596  df-fn 5597  df-f 5598  df-uhgra 24106 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator