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

Theorem upgredg2vtx 16269
Description: For a vertex incident to an edge there is another vertex incident to the edge in a pseudograph. (Contributed by AV, 18-Oct-2020.) (Revised by AV, 5-Dec-2020.)
Hypotheses
Ref Expression
upgredg.v  |-  V  =  (Vtx `  G )
upgredg.e  |-  E  =  (Edg `  G )
Assertion
Ref Expression
upgredg2vtx  |-  ( ( G  e. UPGraph  /\  C  e.  E  /\  A  e.  C )  ->  E. b  e.  V  C  =  { A ,  b } )
Distinct variable groups:    C, b    G, b    V, b    A, b
Allowed substitution hint:    E( b)

Proof of Theorem upgredg2vtx
Dummy variables  a  c are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 upgredg.v . . . 4  |-  V  =  (Vtx `  G )
2 upgredg.e . . . 4  |-  E  =  (Edg `  G )
31, 2upgredg 16265 . . 3  |-  ( ( G  e. UPGraph  /\  C  e.  E )  ->  E. a  e.  V  E. c  e.  V  C  =  { a ,  c } )
433adant3 1044 . 2  |-  ( ( G  e. UPGraph  /\  C  e.  E  /\  A  e.  C )  ->  E. a  e.  V  E. c  e.  V  C  =  { a ,  c } )
5 elpr2elpr 3885 . . . . . . 7  |-  ( ( a  e.  V  /\  c  e.  V  /\  A  e.  { a ,  c } )  ->  E. b  e.  V  { a ,  c }  =  { A ,  b } )
653expia 1232 . . . . . 6  |-  ( ( a  e.  V  /\  c  e.  V )  ->  ( A  e.  {
a ,  c }  ->  E. b  e.  V  { a ,  c }  =  { A ,  b } ) )
7 eleq2 2298 . . . . . . 7  |-  ( C  =  { a ,  c }  ->  ( A  e.  C  <->  A  e.  { a ,  c } ) )
8 eqeq1 2241 . . . . . . . 8  |-  ( C  =  { a ,  c }  ->  ( C  =  { A ,  b }  <->  { a ,  c }  =  { A ,  b } ) )
98rexbidv 2545 . . . . . . 7  |-  ( C  =  { a ,  c }  ->  ( E. b  e.  V  C  =  { A ,  b }  <->  E. b  e.  V  { a ,  c }  =  { A ,  b } ) )
107, 9imbi12d 234 . . . . . 6  |-  ( C  =  { a ,  c }  ->  (
( A  e.  C  ->  E. b  e.  V  C  =  { A ,  b } )  <-> 
( A  e.  {
a ,  c }  ->  E. b  e.  V  { a ,  c }  =  { A ,  b } ) ) )
116, 10imbitrrid 156 . . . . 5  |-  ( C  =  { a ,  c }  ->  (
( a  e.  V  /\  c  e.  V
)  ->  ( A  e.  C  ->  E. b  e.  V  C  =  { A ,  b } ) ) )
1211com13 80 . . . 4  |-  ( A  e.  C  ->  (
( a  e.  V  /\  c  e.  V
)  ->  ( C  =  { a ,  c }  ->  E. b  e.  V  C  =  { A ,  b } ) ) )
13123ad2ant3 1047 . . 3  |-  ( ( G  e. UPGraph  /\  C  e.  E  /\  A  e.  C )  ->  (
( a  e.  V  /\  c  e.  V
)  ->  ( C  =  { a ,  c }  ->  E. b  e.  V  C  =  { A ,  b } ) ) )
1413rexlimdvv 2669 . 2  |-  ( ( G  e. UPGraph  /\  C  e.  E  /\  A  e.  C )  ->  ( E. a  e.  V  E. c  e.  V  C  =  { a ,  c }  ->  E. b  e.  V  C  =  { A ,  b } ) )
154, 14mpd 13 1  |-  ( ( G  e. UPGraph  /\  C  e.  E  /\  A  e.  C )  ->  E. b  e.  V  C  =  { A ,  b } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1005    = wceq 1398    e. wcel 2205   E.wrex 2523   {cpr 3695   ` cfv 5357  Vtxcvtx 16133  Edgcedg 16178  UPGraphcupgr 16212
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 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-mulcom 8244  ax-addass 8245  ax-mulass 8246  ax-distr 8247  ax-i2m1 8248  ax-1rid 8250  ax-0id 8251  ax-rnegex 8252  ax-cnre 8254
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 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-if 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-iord 4492  df-on 4494  df-suc 4497  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-1o 6660  df-2o 6661  df-en 6989  df-sub 8462  df-inn 9255  df-2 9313  df-3 9314  df-4 9315  df-5 9316  df-6 9317  df-7 9318  df-8 9319  df-9 9320  df-n0 9514  df-dec 9728  df-ndx 13299  df-slot 13300  df-base 13302  df-edgf 16126  df-vtx 16135  df-iedg 16136  df-edg 16179  df-upgren 16214
This theorem is referenced by:  usgredg2vtx  16338  uspgredg2vtxeu  16339
  Copyright terms: Public domain W3C validator