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

Theorem uspgredg2v 16075
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 16074 . . . 4  |-  ( ( G  e. USPGraph  /\  y  e.  A )  ->  ( iota_ z  e.  V  y  =  { N , 
z } )  e.  V )
54ralrimiva 2605 . . 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 3749 . . . . . . 7  |-  ( z  =  n  ->  { N ,  z }  =  { N ,  n }
)
87eqeq2d 2243 . . . . . 6  |-  ( z  =  n  ->  (
y  =  { N ,  z }  <->  y  =  { N ,  n }
) )
98cbvriotavw 5982 . . . . 5  |-  ( iota_ z  e.  V  y  =  { N ,  z } )  =  (
iota_ n  e.  V  y  =  { N ,  n } )
107eqeq2d 2243 . . . . . 6  |-  ( z  =  n  ->  (
x  =  { N ,  z }  <->  x  =  { N ,  n }
) )
1110cbvriotavw 5982 . . . . 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 2293 . . . . . . . . . . 11  |-  ( e  =  y  ->  ( N  e.  e  <->  N  e.  y ) )
1413, 3elrab2 2965 . . . . . . . . . 10  |-  ( y  e.  A  <->  ( y  e.  E  /\  N  e.  y ) )
152eleq2i 2298 . . . . . . . . . . . 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 1008 . . . . . . 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 16072 . . . . . . 7  |-  ( ( G  e. USPGraph  /\  y  e.  (Edg `  G )  /\  N  e.  y
)  ->  E! n  e.  (Vtx `  G )
y  =  { N ,  n } )
24 reueq1 2732 . . . . . . . 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 2293 . . . . . . . . . . 11  |-  ( e  =  x  ->  ( N  e.  e  <->  N  e.  x ) )
2928, 3elrab2 2965 . . . . . . . . . 10  |-  ( x  e.  A  <->  ( x  e.  E  /\  N  e.  x ) )
302eleq2i 2298 . . . . . . . . . . . 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 1008 . . . . . . 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 16072 . . . . . . 7  |-  ( ( G  e. USPGraph  /\  x  e.  (Edg `  G )  /\  N  e.  x
)  ->  E! n  e.  (Vtx `  G )
x  =  { N ,  n } )
39 reueq1 2732 . . . . . . . 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 5996 . . . 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 2614 . 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 2238 . . . 4  |-  ( y  =  x  ->  (
y  =  { N ,  z }  <->  x  =  { N ,  z } ) )
4847riotabidv 5973 . . 3  |-  ( y  =  x  ->  ( iota_ z  e.  V  y  =  { N , 
z } )  =  ( iota_ z  e.  V  x  =  { N ,  z } ) )
4946, 48f1mpt 5912 . 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 1004    = wceq 1397    e. wcel 2202   A.wral 2510   E!wreu 2512   {crab 2514   {cpr 3670    |-> cmpt 4150   -1-1->wf1 5323   ` cfv 5326   iota_crio 5970  Vtxcvtx 15866  Edgcedg 15911  USPGraphcuspgr 16007
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-addcom 8132  ax-mulcom 8133  ax-addass 8134  ax-mulass 8135  ax-distr 8136  ax-i2m1 8137  ax-1rid 8139  ax-0id 8140  ax-rnegex 8141  ax-cnre 8143
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-iord 4463  df-on 4465  df-suc 4468  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-1st 6303  df-2nd 6304  df-1o 6582  df-2o 6583  df-en 6910  df-sub 8352  df-inn 9144  df-2 9202  df-3 9203  df-4 9204  df-5 9205  df-6 9206  df-7 9207  df-8 9208  df-9 9209  df-n0 9403  df-dec 9612  df-ndx 13087  df-slot 13088  df-base 13090  df-edgf 15859  df-vtx 15868  df-iedg 15869  df-edg 15912  df-upgren 15947  df-uspgren 16009
This theorem is referenced by:  uspgredgdomord  16083
  Copyright terms: Public domain W3C validator