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

Theorem uhgrass 25835
 Description: An edge is a subset of vertices, analogous to umgrass 25848. (Contributed by Alexander van der Vekens, 26-Dec-2017.)
Assertion
Ref Expression
uhgrass ((𝑉 UHGrph 𝐸𝐹 ∈ dom 𝐸) → (𝐸𝐹) ⊆ 𝑉)

Proof of Theorem uhgrass
StepHypRef Expression
1 uhgraf 25828 . . . 4 (𝑉 UHGrph 𝐸𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅}))
21ffvelrnda 6267 . . 3 ((𝑉 UHGrph 𝐸𝐹 ∈ dom 𝐸) → (𝐸𝐹) ∈ (𝒫 𝑉 ∖ {∅}))
32eldifad 3552 . 2 ((𝑉 UHGrph 𝐸𝐹 ∈ dom 𝐸) → (𝐸𝐹) ∈ 𝒫 𝑉)
43elpwid 4118 1 ((𝑉 UHGrph 𝐸𝐹 ∈ dom 𝐸) → (𝐸𝐹) ⊆ 𝑉)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   ∈ wcel 1977   ∖ cdif 3537   ⊆ wss 3540  ∅c0 3874  𝒫 cpw 4108  {csn 4125   class class class wbr 4583  dom cdm 5038  ‘cfv 5804   UHGrph cuhg 25819 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-fv 5812  df-uhgra 25821 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator