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

Theorem upgredg2vtx 15822
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 15818 . . 3  |-  ( ( G  e. UPGraph  /\  C  e.  E )  ->  E. a  e.  V  E. c  e.  V  C  =  { a ,  c } )
433adant3 1020 . 2  |-  ( ( G  e. UPGraph  /\  C  e.  E  /\  A  e.  C )  ->  E. a  e.  V  E. c  e.  V  C  =  { a ,  c } )
5 elpr2elpr 3825 . . . . . . 7  |-  ( ( a  e.  V  /\  c  e.  V  /\  A  e.  { a ,  c } )  ->  E. b  e.  V  { a ,  c }  =  { A ,  b } )
653expia 1208 . . . . . 6  |-  ( ( a  e.  V  /\  c  e.  V )  ->  ( A  e.  {
a ,  c }  ->  E. b  e.  V  { a ,  c }  =  { A ,  b } ) )
7 eleq2 2270 . . . . . . 7  |-  ( C  =  { a ,  c }  ->  ( A  e.  C  <->  A  e.  { a ,  c } ) )
8 eqeq1 2213 . . . . . . . 8  |-  ( C  =  { a ,  c }  ->  ( C  =  { A ,  b }  <->  { a ,  c }  =  { A ,  b } ) )
98rexbidv 2508 . . . . . . 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 1023 . . 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 2631 . 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 981    = wceq 1373    e. wcel 2177   E.wrex 2486   {cpr 3639   ` cfv 5285  Vtxcvtx 15696  Edgcedg 15739  UPGraphcupgr 15772
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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-sep 4173  ax-nul 4181  ax-pow 4229  ax-pr 4264  ax-un 4493  ax-setind 4598  ax-cnex 8046  ax-resscn 8047  ax-1cn 8048  ax-1re 8049  ax-icn 8050  ax-addcl 8051  ax-addrcl 8052  ax-mulcl 8053  ax-addcom 8055  ax-mulcom 8056  ax-addass 8057  ax-mulass 8058  ax-distr 8059  ax-i2m1 8060  ax-1rid 8062  ax-0id 8063  ax-rnegex 8064  ax-cnre 8066
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-ral 2490  df-rex 2491  df-reu 2492  df-rab 2494  df-v 2775  df-sbc 3003  df-csb 3098  df-dif 3172  df-un 3174  df-in 3176  df-ss 3183  df-nul 3465  df-if 3576  df-pw 3623  df-sn 3644  df-pr 3645  df-op 3647  df-uni 3860  df-int 3895  df-br 4055  df-opab 4117  df-mpt 4118  df-tr 4154  df-id 4353  df-iord 4426  df-on 4428  df-suc 4431  df-xp 4694  df-rel 4695  df-cnv 4696  df-co 4697  df-dm 4698  df-rn 4699  df-res 4700  df-ima 4701  df-iota 5246  df-fun 5287  df-fn 5288  df-f 5289  df-f1 5290  df-fo 5291  df-f1o 5292  df-fv 5293  df-riota 5917  df-ov 5965  df-oprab 5966  df-mpo 5967  df-1st 6244  df-2nd 6245  df-1o 6520  df-2o 6521  df-en 6846  df-sub 8275  df-inn 9067  df-2 9125  df-3 9126  df-4 9127  df-5 9128  df-6 9129  df-7 9130  df-8 9131  df-9 9132  df-n0 9326  df-dec 9535  df-ndx 12920  df-slot 12921  df-base 12923  df-edgf 15689  df-vtx 15698  df-iedg 15699  df-edg 15740  df-upgren 15774
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator