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

Theorem uspgredg2v 16065
Description: In a simple pseudograph, the mapping of edges having a fixed endpoint to the "other" vertex of the edge (which may be the fixed vertex itself in the case of a loop) is a one-to-one function into the set of vertices. (Contributed by Alexander van der Vekens, 4-Jan-2018.) (Revised by AV, 6-Dec-2020.)
Hypotheses
Ref Expression
uspgredg2v.v  |-  V  =  (Vtx `  G )
uspgredg2v.e  |-  E  =  (Edg `  G )
uspgredg2v.a  |-  A  =  { e  e.  E  |  N  e.  e }
uspgredg2v.f  |-  F  =  ( y  e.  A  |->  ( iota_ z  e.  V  y  =  { N ,  z } ) )
Assertion
Ref Expression
uspgredg2v  |-  ( ( G  e. USPGraph  /\  N  e.  V )  ->  F : A -1-1-> V )
Distinct variable groups:    e, E    z, G    e, N    z, N    z, V    y, A    y, G    y, N, z    y, V    y, e
Allowed substitution hints:    A( z, e)    E( y, z)    F( y, z, e)    G( e)    V( e)

Proof of Theorem uspgredg2v
Dummy variables  x  n are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 uspgredg2v.v . . . . 5  |-  V  =  (Vtx `  G )
2 uspgredg2v.e . . . . 5  |-  E  =  (Edg `  G )
3 uspgredg2v.a . . . . 5  |-  A  =  { e  e.  E  |  N  e.  e }
41, 2, 3uspgredg2vlem 16064 . . . 4  |-  ( ( G  e. USPGraph  /\  y  e.  A )  ->  ( iota_ z  e.  V  y  =  { N , 
z } )  e.  V )
54ralrimiva 2603 . . 3  |-  ( G  e. USPGraph  ->  A. y  e.  A  ( iota_ z  e.  V  y  =  { N ,  z } )  e.  V )
65adantr 276 . 2  |-  ( ( G  e. USPGraph  /\  N  e.  V )  ->  A. y  e.  A  ( iota_ z  e.  V  y  =  { N ,  z } )  e.  V
)
7 preq2 3747 . . . . . . 7  |-  ( z  =  n  ->  { N ,  z }  =  { N ,  n }
)
87eqeq2d 2241 . . . . . 6  |-  ( z  =  n  ->  (
y  =  { N ,  z }  <->  y  =  { N ,  n }
) )
98cbvriotavw 5977 . . . . 5  |-  ( iota_ z  e.  V  y  =  { N ,  z } )  =  (
iota_ n  e.  V  y  =  { N ,  n } )
107eqeq2d 2241 . . . . . 6  |-  ( z  =  n  ->  (
x  =  { N ,  z }  <->  x  =  { N ,  n }
) )
1110cbvriotavw 5977 . . . . 5  |-  ( iota_ z  e.  V  x  =  { N ,  z } )  =  (
iota_ n  e.  V  x  =  { N ,  n } )
12 simpl 109 . . . . . . . 8  |-  ( ( G  e. USPGraph  /\  N  e.  V )  ->  G  e. USPGraph )
13 eleq2w 2291 . . . . . . . . . . 11  |-  ( e  =  y  ->  ( N  e.  e  <->  N  e.  y ) )
1413, 3elrab2 2963 . . . . . . . . . 10  |-  ( y  e.  A  <->  ( y  e.  E  /\  N  e.  y ) )
152eleq2i 2296 . . . . . . . . . . . 12  |-  ( y  e.  E  <->  y  e.  (Edg `  G ) )
1615biimpi 120 . . . . . . . . . . 11  |-  ( y  e.  E  ->  y  e.  (Edg `  G )
)
1716anim1i 340 . . . . . . . . . 10  |-  ( ( y  e.  E  /\  N  e.  y )  ->  ( y  e.  (Edg
`  G )  /\  N  e.  y )
)
1814, 17sylbi 121 . . . . . . . . 9  |-  ( y  e.  A  ->  (
y  e.  (Edg `  G )  /\  N  e.  y ) )
1918adantr 276 . . . . . . . 8  |-  ( ( y  e.  A  /\  x  e.  A )  ->  ( y  e.  (Edg
`  G )  /\  N  e.  y )
)
2012, 19anim12i 338 . . . . . . 7  |-  ( ( ( G  e. USPGraph  /\  N  e.  V )  /\  (
y  e.  A  /\  x  e.  A )
)  ->  ( G  e. USPGraph 
/\  ( y  e.  (Edg `  G )  /\  N  e.  y
) ) )
21 3anass 1006 . . . . . . 7  |-  ( ( G  e. USPGraph  /\  y  e.  (Edg `  G )  /\  N  e.  y
)  <->  ( G  e. USPGraph  /\  ( y  e.  (Edg
`  G )  /\  N  e.  y )
) )
2220, 21sylibr 134 . . . . . 6  |-  ( ( ( G  e. USPGraph  /\  N  e.  V )  /\  (
y  e.  A  /\  x  e.  A )
)  ->  ( G  e. USPGraph 
/\  y  e.  (Edg
`  G )  /\  N  e.  y )
)
23 uspgredg2vtxeu 16062 . . . . . . 7  |-  ( ( G  e. USPGraph  /\  y  e.  (Edg `  G )  /\  N  e.  y
)  ->  E! n  e.  (Vtx `  G )
y  =  { N ,  n } )
24 reueq1 2730 . . . . . . . 8  |-  ( V  =  (Vtx `  G
)  ->  ( E! n  e.  V  y  =  { N ,  n } 
<->  E! n  e.  (Vtx
`  G ) y  =  { N ,  n } ) )
251, 24ax-mp 5 . . . . . . 7  |-  ( E! n  e.  V  y  =  { N ,  n }  <->  E! n  e.  (Vtx
`  G ) y  =  { N ,  n } )
2623, 25sylibr 134 . . . . . 6  |-  ( ( G  e. USPGraph  /\  y  e.  (Edg `  G )  /\  N  e.  y
)  ->  E! n  e.  V  y  =  { N ,  n }
)
2722, 26syl 14 . . . . 5  |-  ( ( ( G  e. USPGraph  /\  N  e.  V )  /\  (
y  e.  A  /\  x  e.  A )
)  ->  E! n  e.  V  y  =  { N ,  n }
)
28 eleq2w 2291 . . . . . . . . . . 11  |-  ( e  =  x  ->  ( N  e.  e  <->  N  e.  x ) )
2928, 3elrab2 2963 . . . . . . . . . 10  |-  ( x  e.  A  <->  ( x  e.  E  /\  N  e.  x ) )
302eleq2i 2296 . . . . . . . . . . . 12  |-  ( x  e.  E  <->  x  e.  (Edg `  G ) )
3130biimpi 120 . . . . . . . . . . 11  |-  ( x  e.  E  ->  x  e.  (Edg `  G )
)
3231anim1i 340 . . . . . . . . . 10  |-  ( ( x  e.  E  /\  N  e.  x )  ->  ( x  e.  (Edg
`  G )  /\  N  e.  x )
)
3329, 32sylbi 121 . . . . . . . . 9  |-  ( x  e.  A  ->  (
x  e.  (Edg `  G )  /\  N  e.  x ) )
3433adantl 277 . . . . . . . 8  |-  ( ( y  e.  A  /\  x  e.  A )  ->  ( x  e.  (Edg
`  G )  /\  N  e.  x )
)
3512, 34anim12i 338 . . . . . . 7  |-  ( ( ( G  e. USPGraph  /\  N  e.  V )  /\  (
y  e.  A  /\  x  e.  A )
)  ->  ( G  e. USPGraph 
/\  ( x  e.  (Edg `  G )  /\  N  e.  x
) ) )
36 3anass 1006 . . . . . . 7  |-  ( ( G  e. USPGraph  /\  x  e.  (Edg `  G )  /\  N  e.  x
)  <->  ( G  e. USPGraph  /\  ( x  e.  (Edg
`  G )  /\  N  e.  x )
) )
3735, 36sylibr 134 . . . . . 6  |-  ( ( ( G  e. USPGraph  /\  N  e.  V )  /\  (
y  e.  A  /\  x  e.  A )
)  ->  ( G  e. USPGraph 
/\  x  e.  (Edg
`  G )  /\  N  e.  x )
)
38 uspgredg2vtxeu 16062 . . . . . . 7  |-  ( ( G  e. USPGraph  /\  x  e.  (Edg `  G )  /\  N  e.  x
)  ->  E! n  e.  (Vtx `  G )
x  =  { N ,  n } )
39 reueq1 2730 . . . . . . . 8  |-  ( V  =  (Vtx `  G
)  ->  ( E! n  e.  V  x  =  { N ,  n } 
<->  E! n  e.  (Vtx
`  G ) x  =  { N ,  n } ) )
401, 39ax-mp 5 . . . . . . 7  |-  ( E! n  e.  V  x  =  { N ,  n }  <->  E! n  e.  (Vtx
`  G ) x  =  { N ,  n } )
4138, 40sylibr 134 . . . . . 6  |-  ( ( G  e. USPGraph  /\  x  e.  (Edg `  G )  /\  N  e.  x
)  ->  E! n  e.  V  x  =  { N ,  n }
)
4237, 41syl 14 . . . . 5  |-  ( ( ( G  e. USPGraph  /\  N  e.  V )  /\  (
y  e.  A  /\  x  e.  A )
)  ->  E! n  e.  V  x  =  { N ,  n }
)
439, 11, 27, 42riotaeqimp 5991 . . . 4  |-  ( ( ( ( G  e. USPGraph  /\  N  e.  V )  /\  ( y  e.  A  /\  x  e.  A ) )  /\  ( iota_ z  e.  V  y  =  { N ,  z } )  =  ( iota_ z  e.  V  x  =  { N ,  z }
) )  ->  y  =  x )
4443ex 115 . . 3  |-  ( ( ( G  e. USPGraph  /\  N  e.  V )  /\  (
y  e.  A  /\  x  e.  A )
)  ->  ( ( iota_ z  e.  V  y  =  { N , 
z } )  =  ( iota_ z  e.  V  x  =  { N ,  z } )  ->  y  =  x ) )
4544ralrimivva 2612 . 2  |-  ( ( G  e. USPGraph  /\  N  e.  V )  ->  A. y  e.  A  A. x  e.  A  ( ( iota_ z  e.  V  y  =  { N , 
z } )  =  ( iota_ z  e.  V  x  =  { N ,  z } )  ->  y  =  x ) )
46 uspgredg2v.f . . 3  |-  F  =  ( y  e.  A  |->  ( iota_ z  e.  V  y  =  { N ,  z } ) )
47 eqeq1 2236 . . . 4  |-  ( y  =  x  ->  (
y  =  { N ,  z }  <->  x  =  { N ,  z } ) )
4847riotabidv 5968 . . 3  |-  ( y  =  x  ->  ( iota_ z  e.  V  y  =  { N , 
z } )  =  ( iota_ z  e.  V  x  =  { N ,  z } ) )
4946, 48f1mpt 5907 . 2  |-  ( F : A -1-1-> V  <->  ( A. y  e.  A  ( iota_ z  e.  V  y  =  { N , 
z } )  e.  V  /\  A. y  e.  A  A. x  e.  A  ( ( iota_ z  e.  V  y  =  { N , 
z } )  =  ( iota_ z  e.  V  x  =  { N ,  z } )  ->  y  =  x ) ) )
506, 45, 49sylanbrc 417 1  |-  ( ( G  e. USPGraph  /\  N  e.  V )  ->  F : A -1-1-> V )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1002    = wceq 1395    e. wcel 2200   A.wral 2508   E!wreu 2510   {crab 2512   {cpr 3668    |-> cmpt 4148   -1-1->wf1 5321   ` cfv 5324   iota_crio 5965  Vtxcvtx 15856  Edgcedg 15901  USPGraphcuspgr 15997
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8116  ax-resscn 8117  ax-1cn 8118  ax-1re 8119  ax-icn 8120  ax-addcl 8121  ax-addrcl 8122  ax-mulcl 8123  ax-addcom 8125  ax-mulcom 8126  ax-addass 8127  ax-mulass 8128  ax-distr 8129  ax-i2m1 8130  ax-1rid 8132  ax-0id 8133  ax-rnegex 8134  ax-cnre 8136
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-if 3604  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-br 4087  df-opab 4149  df-mpt 4150  df-tr 4186  df-id 4388  df-iord 4461  df-on 4463  df-suc 4466  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-1o 6577  df-2o 6578  df-en 6905  df-sub 8345  df-inn 9137  df-2 9195  df-3 9196  df-4 9197  df-5 9198  df-6 9199  df-7 9200  df-8 9201  df-9 9202  df-n0 9396  df-dec 9605  df-ndx 13078  df-slot 13079  df-base 13081  df-edgf 15849  df-vtx 15858  df-iedg 15859  df-edg 15902  df-upgren 15937  df-uspgren 15999
This theorem is referenced by:  uspgredgdomord  16073
  Copyright terms: Public domain W3C validator