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

Theorem upgredg2vtx 15998
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 𝑉 = (Vtx‘𝐺)
upgredg.e 𝐸 = (Edg‘𝐺)
Assertion
Ref Expression
upgredg2vtx ((𝐺 ∈ UPGraph ∧ 𝐶𝐸𝐴𝐶) → ∃𝑏𝑉 𝐶 = {𝐴, 𝑏})
Distinct variable groups:   𝐶,𝑏   𝐺,𝑏   𝑉,𝑏   𝐴,𝑏
Allowed substitution hint:   𝐸(𝑏)

Proof of Theorem upgredg2vtx
Dummy variables 𝑎 𝑐 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 upgredg.v . . . 4 𝑉 = (Vtx‘𝐺)
2 upgredg.e . . . 4 𝐸 = (Edg‘𝐺)
31, 2upgredg 15994 . . 3 ((𝐺 ∈ UPGraph ∧ 𝐶𝐸) → ∃𝑎𝑉𝑐𝑉 𝐶 = {𝑎, 𝑐})
433adant3 1043 . 2 ((𝐺 ∈ UPGraph ∧ 𝐶𝐸𝐴𝐶) → ∃𝑎𝑉𝑐𝑉 𝐶 = {𝑎, 𝑐})
5 elpr2elpr 3859 . . . . . . 7 ((𝑎𝑉𝑐𝑉𝐴 ∈ {𝑎, 𝑐}) → ∃𝑏𝑉 {𝑎, 𝑐} = {𝐴, 𝑏})
653expia 1231 . . . . . 6 ((𝑎𝑉𝑐𝑉) → (𝐴 ∈ {𝑎, 𝑐} → ∃𝑏𝑉 {𝑎, 𝑐} = {𝐴, 𝑏}))
7 eleq2 2295 . . . . . . 7 (𝐶 = {𝑎, 𝑐} → (𝐴𝐶𝐴 ∈ {𝑎, 𝑐}))
8 eqeq1 2238 . . . . . . . 8 (𝐶 = {𝑎, 𝑐} → (𝐶 = {𝐴, 𝑏} ↔ {𝑎, 𝑐} = {𝐴, 𝑏}))
98rexbidv 2533 . . . . . . 7 (𝐶 = {𝑎, 𝑐} → (∃𝑏𝑉 𝐶 = {𝐴, 𝑏} ↔ ∃𝑏𝑉 {𝑎, 𝑐} = {𝐴, 𝑏}))
107, 9imbi12d 234 . . . . . 6 (𝐶 = {𝑎, 𝑐} → ((𝐴𝐶 → ∃𝑏𝑉 𝐶 = {𝐴, 𝑏}) ↔ (𝐴 ∈ {𝑎, 𝑐} → ∃𝑏𝑉 {𝑎, 𝑐} = {𝐴, 𝑏})))
116, 10imbitrrid 156 . . . . 5 (𝐶 = {𝑎, 𝑐} → ((𝑎𝑉𝑐𝑉) → (𝐴𝐶 → ∃𝑏𝑉 𝐶 = {𝐴, 𝑏})))
1211com13 80 . . . 4 (𝐴𝐶 → ((𝑎𝑉𝑐𝑉) → (𝐶 = {𝑎, 𝑐} → ∃𝑏𝑉 𝐶 = {𝐴, 𝑏})))
13123ad2ant3 1046 . . 3 ((𝐺 ∈ UPGraph ∧ 𝐶𝐸𝐴𝐶) → ((𝑎𝑉𝑐𝑉) → (𝐶 = {𝑎, 𝑐} → ∃𝑏𝑉 𝐶 = {𝐴, 𝑏})))
1413rexlimdvv 2657 . 2 ((𝐺 ∈ UPGraph ∧ 𝐶𝐸𝐴𝐶) → (∃𝑎𝑉𝑐𝑉 𝐶 = {𝑎, 𝑐} → ∃𝑏𝑉 𝐶 = {𝐴, 𝑏}))
154, 14mpd 13 1 ((𝐺 ∈ UPGraph ∧ 𝐶𝐸𝐴𝐶) → ∃𝑏𝑉 𝐶 = {𝐴, 𝑏})
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 1004   = wceq 1397  wcel 2202  wrex 2511  {cpr 3670  cfv 5326  Vtxcvtx 15862  Edgcedg 15907  UPGraphcupgr 15941
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 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-addcom 8131  ax-mulcom 8132  ax-addass 8133  ax-mulass 8134  ax-distr 8135  ax-i2m1 8136  ax-1rid 8138  ax-0id 8139  ax-rnegex 8140  ax-cnre 8142
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-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 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-1o 6581  df-2o 6582  df-en 6909  df-sub 8351  df-inn 9143  df-2 9201  df-3 9202  df-4 9203  df-5 9204  df-6 9205  df-7 9206  df-8 9207  df-9 9208  df-n0 9402  df-dec 9611  df-ndx 13084  df-slot 13085  df-base 13087  df-edgf 15855  df-vtx 15864  df-iedg 15865  df-edg 15908  df-upgren 15943
This theorem is referenced by:  usgredg2vtx  16067  uspgredg2vtxeu  16068
  Copyright terms: Public domain W3C validator