ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  upgruhgr Unicode version

Theorem upgruhgr 16237
Description: An undirected pseudograph is an undirected hypergraph. (Contributed by Alexander van der Vekens, 27-Dec-2017.) (Revised by AV, 10-Oct-2020.)
Assertion
Ref Expression
upgruhgr  |-  ( G  e. UPGraph  ->  G  e. UHGraph )

Proof of Theorem upgruhgr
Dummy variables  w  x are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2234 . . . 4  |-  (Vtx `  G )  =  (Vtx
`  G )
2 eqid 2234 . . . 4  |-  (iEdg `  G )  =  (iEdg `  G )
31, 2upgrfen 16223 . . 3  |-  ( G  e. UPGraph  ->  (iEdg `  G
) : dom  (iEdg `  G ) --> { x  e.  ~P (Vtx `  G
)  |  ( x 
~~  1o  \/  x  ~~  2o ) } )
4 en1m 7059 . . . . . . 7  |-  ( x 
~~  1o  ->  E. w  w  e.  x )
5 en2m 7080 . . . . . . 7  |-  ( x 
~~  2o  ->  E. w  w  e.  x )
64, 5jaoi 724 . . . . . 6  |-  ( ( x  ~~  1o  \/  x  ~~  2o )  ->  E. w  w  e.  x )
76a1i 9 . . . . 5  |-  ( x  e.  ~P (Vtx `  G )  ->  (
( x  ~~  1o  \/  x  ~~  2o )  ->  E. w  w  e.  x ) )
87ss2rabi 3324 . . . 4  |-  { x  e.  ~P (Vtx `  G
)  |  ( x 
~~  1o  \/  x  ~~  2o ) }  C_  { x  e.  ~P (Vtx `  G )  |  E. w  w  e.  x }
98a1i 9 . . 3  |-  ( G  e. UPGraph  ->  { x  e. 
~P (Vtx `  G
)  |  ( x 
~~  1o  \/  x  ~~  2o ) }  C_  { x  e.  ~P (Vtx `  G )  |  E. w  w  e.  x } )
103, 9fssd 5528 . 2  |-  ( G  e. UPGraph  ->  (iEdg `  G
) : dom  (iEdg `  G ) --> { x  e.  ~P (Vtx `  G
)  |  E. w  w  e.  x }
)
111, 2isuhgrm 16197 . 2  |-  ( G  e. UPGraph  ->  ( G  e. UHGraph  <->  (iEdg `  G ) : dom  (iEdg `  G ) --> { x  e.  ~P (Vtx `  G )  |  E. w  w  e.  x } ) )
1210, 11mpbird 167 1  |-  ( G  e. UPGraph  ->  G  e. UHGraph )
Colors of variables: wff set class
Syntax hints:    -> wi 4    \/ wo 716   E.wex 1541    e. wcel 2205   {crab 2526    C_ wss 3214   ~Pcpw 3675   class class class wbr 4115   dom cdm 4755   -->wf 5354   ` cfv 5358   1oc1o 6654   2oc2o 6655    ~~ cen 6987  Vtxcvtx 16138  iEdgciedg 16139  UHGraphcuhgr 16193  UPGraphcupgr 16217
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4234  ax-nul 4242  ax-pow 4293  ax-pr 4328  ax-un 4560  ax-setind 4665  ax-cnex 8235  ax-resscn 8236  ax-1cn 8237  ax-1re 8238  ax-icn 8239  ax-addcl 8240  ax-addrcl 8241  ax-mulcl 8242  ax-addcom 8244  ax-mulcom 8245  ax-addass 8246  ax-mulass 8247  ax-distr 8248  ax-i2m1 8249  ax-1rid 8251  ax-0id 8252  ax-rnegex 8253  ax-cnre 8255
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-if 3626  df-pw 3677  df-sn 3701  df-pr 3702  df-op 3704  df-uni 3921  df-int 3956  df-br 4116  df-opab 4178  df-mpt 4179  df-tr 4215  df-id 4420  df-iord 4493  df-on 4495  df-suc 4498  df-xp 4761  df-rel 4762  df-cnv 4763  df-co 4764  df-dm 4765  df-rn 4766  df-res 4767  df-ima 4768  df-iota 5318  df-fun 5360  df-fn 5361  df-f 5362  df-f1 5363  df-fo 5364  df-f1o 5365  df-fv 5366  df-riota 6012  df-ov 6062  df-oprab 6063  df-mpo 6064  df-1st 6348  df-2nd 6349  df-1o 6661  df-2o 6662  df-en 6990  df-sub 8464  df-inn 9259  df-2 9317  df-3 9318  df-4 9319  df-5 9320  df-6 9321  df-7 9322  df-8 9323  df-9 9324  df-n0 9518  df-dec 9732  df-ndx 13304  df-slot 13305  df-base 13307  df-edgf 16131  df-vtx 16140  df-iedg 16141  df-uhgrm 16195  df-upgren 16219
This theorem is referenced by:  umgruhgr  16239  uspgruhgr  16313  usgruhgr  16315  subupgr  16399  upgrspan  16405  upgredginwlk  16482
  Copyright terms: Public domain W3C validator