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

Theorem uhgredgrnv 29162
Description: An edge of a hypergraph contains only vertices. (Contributed by Alexander van der Vekens, 18-Feb-2018.) (Revised by AV, 4-Jun-2021.)
Assertion
Ref Expression
uhgredgrnv ((𝐺 ∈ UHGraph ∧ 𝐸 ∈ (Edg‘𝐺) ∧ 𝑁𝐸) → 𝑁 ∈ (Vtx‘𝐺))

Proof of Theorem uhgredgrnv
StepHypRef Expression
1 edguhgr 29161 . . 3 ((𝐺 ∈ UHGraph ∧ 𝐸 ∈ (Edg‘𝐺)) → 𝐸 ∈ 𝒫 (Vtx‘𝐺))
2 elelpwi 4615 . . . 4 ((𝑁𝐸𝐸 ∈ 𝒫 (Vtx‘𝐺)) → 𝑁 ∈ (Vtx‘𝐺))
32expcom 413 . . 3 (𝐸 ∈ 𝒫 (Vtx‘𝐺) → (𝑁𝐸𝑁 ∈ (Vtx‘𝐺)))
41, 3syl 17 . 2 ((𝐺 ∈ UHGraph ∧ 𝐸 ∈ (Edg‘𝐺)) → (𝑁𝐸𝑁 ∈ (Vtx‘𝐺)))
543impia 1116 1 ((𝐺 ∈ UHGraph ∧ 𝐸 ∈ (Edg‘𝐺) ∧ 𝑁𝐸) → 𝑁 ∈ (Vtx‘𝐺))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086  wcel 2106  𝒫 cpw 4605  cfv 6563  Vtxcvtx 29028  Edgcedg 29079  UHGraphcuhgr 29088
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-sbc 3792  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-fv 6571  df-edg 29080  df-uhgr 29090
This theorem is referenced by:  clnbgredg  47764  usgrgrtrirex  47853
  Copyright terms: Public domain W3C validator