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

Theorem isuspgren 16169
Description: The property of being a simple pseudograph. (Contributed by Alexander van der Vekens, 10-Aug-2017.) (Revised by AV, 13-Oct-2020.)
Hypotheses
Ref Expression
isuspgr.v  |-  V  =  (Vtx `  G )
isuspgr.e  |-  E  =  (iEdg `  G )
Assertion
Ref Expression
isuspgren  |-  ( G  e.  U  ->  ( G  e. USPGraph  <->  E : dom  E -1-1-> { x  e.  ~P V  |  ( x  ~~  1o  \/  x  ~~  2o ) } ) )
Distinct variable groups:    x, G    x, V
Allowed substitution hints:    U( x)    E( x)

Proof of Theorem isuspgren
Dummy variables  e  g  h  v are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-uspgren 16167 . . 3  |- USPGraph  =  {
g  |  [. (Vtx `  g )  /  v ]. [. (iEdg `  g
)  /  e ]. e : dom  e -1-1-> {
x  e.  ~P v  |  ( x  ~~  1o  \/  x  ~~  2o ) } }
21eleq2i 2301 . 2  |-  ( G  e. USPGraph 
<->  G  e.  { g  |  [. (Vtx `  g )  /  v ]. [. (iEdg `  g
)  /  e ]. e : dom  e -1-1-> {
x  e.  ~P v  |  ( x  ~~  1o  \/  x  ~~  2o ) } } )
3 fveq2 5672 . . . . 5  |-  ( h  =  G  ->  (iEdg `  h )  =  (iEdg `  G ) )
4 isuspgr.e . . . . 5  |-  E  =  (iEdg `  G )
53, 4eqtr4di 2285 . . . 4  |-  ( h  =  G  ->  (iEdg `  h )  =  E )
63dmeqd 4960 . . . . 5  |-  ( h  =  G  ->  dom  (iEdg `  h )  =  dom  (iEdg `  G
) )
74eqcomi 2238 . . . . . 6  |-  (iEdg `  G )  =  E
87dmeqi 4959 . . . . 5  |-  dom  (iEdg `  G )  =  dom  E
96, 8eqtrdi 2283 . . . 4  |-  ( h  =  G  ->  dom  (iEdg `  h )  =  dom  E )
10 fveq2 5672 . . . . . . 7  |-  ( h  =  G  ->  (Vtx `  h )  =  (Vtx
`  G ) )
11 isuspgr.v . . . . . . 7  |-  V  =  (Vtx `  G )
1210, 11eqtr4di 2285 . . . . . 6  |-  ( h  =  G  ->  (Vtx `  h )  =  V )
1312pweqd 3676 . . . . 5  |-  ( h  =  G  ->  ~P (Vtx `  h )  =  ~P V )
1413rabeqdv 2809 . . . 4  |-  ( h  =  G  ->  { x  e.  ~P (Vtx `  h
)  |  ( x 
~~  1o  \/  x  ~~  2o ) }  =  { x  e.  ~P V  |  ( x  ~~  1o  \/  x  ~~  2o ) } )
155, 9, 14f1eq123d 5608 . . 3  |-  ( h  =  G  ->  (
(iEdg `  h ) : dom  (iEdg `  h
) -1-1-> { x  e.  ~P (Vtx `  h )  |  ( x  ~~  1o  \/  x  ~~  2o ) }  <->  E : dom  E -1-1-> { x  e.  ~P V  |  ( x  ~~  1o  \/  x  ~~  2o ) } ) )
16 vtxex 16030 . . . . . . 7  |-  ( g  e.  _V  ->  (Vtx `  g )  e.  _V )
1716elv 2819 . . . . . 6  |-  (Vtx `  g )  e.  _V
1817a1i 9 . . . . 5  |-  ( g  =  h  ->  (Vtx `  g )  e.  _V )
19 fveq2 5672 . . . . 5  |-  ( g  =  h  ->  (Vtx `  g )  =  (Vtx
`  h ) )
20 iedgex 16031 . . . . . . . 8  |-  ( g  e.  _V  ->  (iEdg `  g )  e.  _V )
2120elv 2819 . . . . . . 7  |-  (iEdg `  g )  e.  _V
2221a1i 9 . . . . . 6  |-  ( ( g  =  h  /\  v  =  (Vtx `  h
) )  ->  (iEdg `  g )  e.  _V )
23 fveq2 5672 . . . . . . 7  |-  ( g  =  h  ->  (iEdg `  g )  =  (iEdg `  h ) )
2423adantr 276 . . . . . 6  |-  ( ( g  =  h  /\  v  =  (Vtx `  h
) )  ->  (iEdg `  g )  =  (iEdg `  h ) )
25 simpr 110 . . . . . . 7  |-  ( ( ( g  =  h  /\  v  =  (Vtx
`  h ) )  /\  e  =  (iEdg `  h ) )  -> 
e  =  (iEdg `  h ) )
2625dmeqd 4960 . . . . . . 7  |-  ( ( ( g  =  h  /\  v  =  (Vtx
`  h ) )  /\  e  =  (iEdg `  h ) )  ->  dom  e  =  dom  (iEdg `  h ) )
27 pweq 3674 . . . . . . . . 9  |-  ( v  =  (Vtx `  h
)  ->  ~P v  =  ~P (Vtx `  h
) )
2827ad2antlr 489 . . . . . . . 8  |-  ( ( ( g  =  h  /\  v  =  (Vtx
`  h ) )  /\  e  =  (iEdg `  h ) )  ->  ~P v  =  ~P (Vtx `  h ) )
2928rabeqdv 2809 . . . . . . 7  |-  ( ( ( g  =  h  /\  v  =  (Vtx
`  h ) )  /\  e  =  (iEdg `  h ) )  ->  { x  e.  ~P v  |  ( x  ~~  1o  \/  x  ~~  2o ) }  =  {
x  e.  ~P (Vtx `  h )  |  ( x  ~~  1o  \/  x  ~~  2o ) } )
3025, 26, 29f1eq123d 5608 . . . . . 6  |-  ( ( ( g  =  h  /\  v  =  (Vtx
`  h ) )  /\  e  =  (iEdg `  h ) )  -> 
( e : dom  e -1-1-> { x  e.  ~P v  |  ( x  ~~  1o  \/  x  ~~  2o ) }  <->  (iEdg `  h
) : dom  (iEdg `  h ) -1-1-> { x  e.  ~P (Vtx `  h
)  |  ( x 
~~  1o  \/  x  ~~  2o ) } ) )
3122, 24, 30sbcied2 3082 . . . . 5  |-  ( ( g  =  h  /\  v  =  (Vtx `  h
) )  ->  ( [. (iEdg `  g )  /  e ]. e : dom  e -1-1-> { x  e.  ~P v  |  ( x  ~~  1o  \/  x  ~~  2o ) }  <-> 
(iEdg `  h ) : dom  (iEdg `  h
) -1-1-> { x  e.  ~P (Vtx `  h )  |  ( x  ~~  1o  \/  x  ~~  2o ) } ) )
3218, 19, 31sbcied2 3082 . . . 4  |-  ( g  =  h  ->  ( [. (Vtx `  g )  /  v ]. [. (iEdg `  g )  /  e ]. e : dom  e -1-1-> { x  e.  ~P v  |  ( x  ~~  1o  \/  x  ~~  2o ) }  <->  (iEdg `  h
) : dom  (iEdg `  h ) -1-1-> { x  e.  ~P (Vtx `  h
)  |  ( x 
~~  1o  \/  x  ~~  2o ) } ) )
3332cbvabv 2361 . . 3  |-  { g  |  [. (Vtx `  g )  /  v ]. [. (iEdg `  g
)  /  e ]. e : dom  e -1-1-> {
x  e.  ~P v  |  ( x  ~~  1o  \/  x  ~~  2o ) } }  =  {
h  |  (iEdg `  h ) : dom  (iEdg `  h ) -1-1-> {
x  e.  ~P (Vtx `  h )  |  ( x  ~~  1o  \/  x  ~~  2o ) } }
3415, 33elab2g 2966 . 2  |-  ( G  e.  U  ->  ( G  e.  { g  |  [. (Vtx `  g
)  /  v ]. [. (iEdg `  g )  /  e ]. e : dom  e -1-1-> { x  e.  ~P v  |  ( x  ~~  1o  \/  x  ~~  2o ) } }  <->  E : dom  E -1-1-> { x  e.  ~P V  |  ( x  ~~  1o  \/  x  ~~  2o ) } ) )
352, 34bitrid 192 1  |-  ( G  e.  U  ->  ( G  e. USPGraph  <->  E : dom  E -1-1-> { x  e.  ~P V  |  ( x  ~~  1o  \/  x  ~~  2o ) } ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 716    = wceq 1398    e. wcel 2205   {cab 2220   {crab 2526   _Vcvv 2815   [.wsbc 3044   ~Pcpw 3671   class class class wbr 4111   dom cdm 4751   -1-1->wf1 5351   ` cfv 5354   1oc1o 6642   2oc2o 6643    ~~ cen 6975  Vtxcvtx 16024  iEdgciedg 16025  USPGraphcuspgr 16165
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 4230  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-cnex 8220  ax-resscn 8221  ax-1cn 8222  ax-1re 8223  ax-icn 8224  ax-addcl 8225  ax-addrcl 8226  ax-mulcl 8227  ax-addcom 8229  ax-mulcom 8230  ax-addass 8231  ax-mulass 8232  ax-distr 8233  ax-i2m1 8234  ax-1rid 8236  ax-0id 8237  ax-rnegex 8238  ax-cnre 8240
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 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-if 3623  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-br 4112  df-opab 4174  df-mpt 4175  df-id 4416  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-f1 5359  df-fo 5360  df-fv 5362  df-riota 6005  df-ov 6055  df-oprab 6056  df-mpo 6057  df-1st 6336  df-2nd 6337  df-sub 8448  df-inn 9240  df-2 9298  df-3 9299  df-4 9300  df-5 9301  df-6 9302  df-7 9303  df-8 9304  df-9 9305  df-n0 9499  df-dec 9713  df-ndx 13232  df-slot 13233  df-base 13235  df-edgf 16017  df-vtx 16026  df-iedg 16027  df-uspgren 16167
This theorem is referenced by:  uspgrfen  16171  isuspgropen  16176  uspgrushgr  16192  uspgrupgr  16193  uspgrupgrushgr  16194  usgruspgr  16195  uspgr1edc  16252
  Copyright terms: Public domain W3C validator