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

Theorem isuspgren 16398
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 16396 . . 3  |- USPGraph  =  {
g  |  [. (Vtx `  g )  /  v ]. [. (iEdg `  g
)  /  e ]. e : dom  e -1-1-> {
x  e.  ~P v  |  ( x  ~~  1o  \/  x  ~~  2o ) } }
21eleq2i 2305 . 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 5695 . . . . 5  |-  ( h  =  G  ->  (iEdg `  h )  =  (iEdg `  G ) )
4 isuspgr.e . . . . 5  |-  E  =  (iEdg `  G )
53, 4eqtr4di 2289 . . . 4  |-  ( h  =  G  ->  (iEdg `  h )  =  E )
63dmeqd 4983 . . . . 5  |-  ( h  =  G  ->  dom  (iEdg `  h )  =  dom  (iEdg `  G
) )
74eqcomi 2242 . . . . . 6  |-  (iEdg `  G )  =  E
87dmeqi 4982 . . . . 5  |-  dom  (iEdg `  G )  =  dom  E
96, 8eqtrdi 2287 . . . 4  |-  ( h  =  G  ->  dom  (iEdg `  h )  =  dom  E )
10 fveq2 5695 . . . . . . 7  |-  ( h  =  G  ->  (Vtx `  h )  =  (Vtx
`  G ) )
11 isuspgr.v . . . . . . 7  |-  V  =  (Vtx `  G )
1210, 11eqtr4di 2289 . . . . . 6  |-  ( h  =  G  ->  (Vtx `  h )  =  V )
1312pweqd 3693 . . . . 5  |-  ( h  =  G  ->  ~P (Vtx `  h )  =  ~P V )
1413rabeqdv 2815 . . . 4  |-  ( h  =  G  ->  { x  e.  ~P (Vtx `  h
)  |  ( x 
~~  1o  \/  x  ~~  2o ) }  =  { x  e.  ~P V  |  ( x  ~~  1o  \/  x  ~~  2o ) } )
155, 9, 14f1eq123d 5631 . . 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 16259 . . . . . . 7  |-  ( g  e.  _V  ->  (Vtx `  g )  e.  _V )
1716elv 2825 . . . . . 6  |-  (Vtx `  g )  e.  _V
1817a1i 9 . . . . 5  |-  ( g  =  h  ->  (Vtx `  g )  e.  _V )
19 fveq2 5695 . . . . 5  |-  ( g  =  h  ->  (Vtx `  g )  =  (Vtx
`  h ) )
20 iedgex 16260 . . . . . . . 8  |-  ( g  e.  _V  ->  (iEdg `  g )  e.  _V )
2120elv 2825 . . . . . . 7  |-  (iEdg `  g )  e.  _V
2221a1i 9 . . . . . 6  |-  ( ( g  =  h  /\  v  =  (Vtx `  h
) )  ->  (iEdg `  g )  e.  _V )
23 fveq2 5695 . . . . . . 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 4983 . . . . . . 7  |-  ( ( ( g  =  h  /\  v  =  (Vtx
`  h ) )  /\  e  =  (iEdg `  h ) )  ->  dom  e  =  dom  (iEdg `  h ) )
27 pweq 3691 . . . . . . . . 9  |-  ( v  =  (Vtx `  h
)  ->  ~P v  =  ~P (Vtx `  h
) )
2827ad2antlr 493 . . . . . . . 8  |-  ( ( ( g  =  h  /\  v  =  (Vtx
`  h ) )  /\  e  =  (iEdg `  h ) )  ->  ~P v  =  ~P (Vtx `  h ) )
2928rabeqdv 2815 . . . . . . 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 5631 . . . . . 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 3089 . . . . 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 3089 . . . 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 2365 . . 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 2973 . 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
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 720    = wceq 1402    e. wcel 2209   {cab 2224   {crab 2532   _Vcvv 2821   [.wsbc 3051   ~Pcpw 3688   class class class wbr 4130   dom cdm 4774   -1-1->wf1 5374   ` cfv 5377   1oc1o 6680   2oc2o 6681    ~~ cen 7020  Vtxcvtx 16253  iEdgciedg 16254  USPGraphcuspgr 16394
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-sub 8499  df-inn 9305  df-2 9363  df-3 9364  df-4 9365  df-5 9366  df-6 9367  df-7 9368  df-8 9369  df-9 9370  df-n0 9564  df-dec 9778  df-ndx 13355  df-slot 13356  df-base 13358  df-edgf 16246  df-vtx 16255  df-iedg 16256  df-uspgren 16396
This theorem is used by:  uspgrfen  16400  isuspgropen  16405  uspgrushgr  16421  uspgrupgr  16422  uspgrupgrushgr  16423  usgruspgr  16424  uspgr1edc  16481
  Copyright terms: Public domain W3C validator