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

Theorem upgruhgr 16032
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 2231 . . . 4  |-  (Vtx `  G )  =  (Vtx
`  G )
2 eqid 2231 . . . 4  |-  (iEdg `  G )  =  (iEdg `  G )
31, 2upgrfen 16018 . . 3  |-  ( G  e. UPGraph  ->  (iEdg `  G
) : dom  (iEdg `  G ) --> { x  e.  ~P (Vtx `  G
)  |  ( x 
~~  1o  \/  x  ~~  2o ) } )
4 en1m 7022 . . . . . . 7  |-  ( x 
~~  1o  ->  E. w  w  e.  x )
5 en2m 7042 . . . . . . 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 3310 . . . 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 5502 . 2  |-  ( G  e. UPGraph  ->  (iEdg `  G
) : dom  (iEdg `  G ) --> { x  e.  ~P (Vtx `  G
)  |  E. w  w  e.  x }
)
111, 2isuhgrm 15992 . 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 2202   {crab 2515    C_ wss 3201   ~Pcpw 3656   class class class wbr 4093   dom cdm 4731   -->wf 5329   ` cfv 5333   1oc1o 6618   2oc2o 6619    ~~ cen 6950  Vtxcvtx 15933  iEdgciedg 15934  UHGraphcuhgr 15988  UPGraphcupgr 16012
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 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8166  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-addcom 8175  ax-mulcom 8176  ax-addass 8177  ax-mulass 8178  ax-distr 8179  ax-i2m1 8180  ax-1rid 8182  ax-0id 8183  ax-rnegex 8184  ax-cnre 8186
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-if 3608  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-iord 4469  df-on 4471  df-suc 4474  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-1o 6625  df-2o 6626  df-en 6953  df-sub 8395  df-inn 9187  df-2 9245  df-3 9246  df-4 9247  df-5 9248  df-6 9249  df-7 9250  df-8 9251  df-9 9252  df-n0 9446  df-dec 9655  df-ndx 13146  df-slot 13147  df-base 13149  df-edgf 15926  df-vtx 15935  df-iedg 15936  df-uhgrm 15990  df-upgren 16014
This theorem is referenced by:  umgruhgr  16034  uspgruhgr  16108  usgruhgr  16110  subupgr  16194  upgrspan  16200  upgredginwlk  16277
  Copyright terms: Public domain W3C validator