Theorem edguhgr 26024

Description: An edge of a hypergraph is a subset of vertices. (Contributed by AV, 26-Oct-2020.) (Proof shortened by AV, 28-Nov-2020.)

Assertion

Ref	Expression
edguhgr	|- ( ( G e. UHGraph /\ E e. (Edg ` G ) ) -> E e. ~P (Vtx ` G ) )

Proof of Theorem edguhgr

Step	Hyp	Ref	Expression
1		uhgredgn0 26023	. 2 |- ( ( G e. UHGraph /\ E e. (Edg ` G ) ) -> E e. ( ~P (Vtx ` G ) \ { (/) } ) )
2	1	eldifad 3586	1 |- ( ( G e. UHGraph /\ E e. (Edg ` G ) ) -> E e. ~P (Vtx ` G ) )

Syntax hints:   -> wi 4   /\ wa 384   e. wcel 1990   (/)c0 3915   ~Pcpw 4158   {csn 4177   ` cfv 5888  Vtxcvtx 25874  Edgcedg 25939   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-8 1992  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-pow 4843  ax-pr 4906  ax-un 6949

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-csb 3534  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-mpt 4730  df-id 5024  df-xp 5120  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-edg 25940  df-uhgr 25953

This theorem is referenced by:  uhgredgrnv  26025  uhgrissubgr  26167  umgrres1lem  26202  nbuhgr  26239  nbuhgr2vtx1edgblem  26247