MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  elwspths2on Structured version   Visualization version   GIF version

Theorem elwspths2on 26926
Description: A simple path of length 2 between two vertices (in a graph) as length 3 string. (Contributed by Alexander van der Vekens, 9-Mar-2018.) (Revised by AV, 12-May-2021.) (Proof shortened by AV, 16-Mar-2022.)
Hypothesis
Ref Expression
elwwlks2on.v 𝑉 = (Vtx‘𝐺)
Assertion
Ref Expression
elwspths2on ((𝐺 ∈ UPGraph ∧ 𝐴𝑉𝐶𝑉) → (𝑊 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) ↔ ∃𝑏𝑉 (𝑊 = ⟨“𝐴𝑏𝐶”⟩ ∧ ⟨“𝐴𝑏𝐶”⟩ ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶))))
Distinct variable groups:   𝐴,𝑏   𝐶,𝑏   𝐺,𝑏   𝑉,𝑏   𝑊,𝑏

Proof of Theorem elwspths2on
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 wspthnon 26809 . . . 4 (𝑊 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) ↔ (𝑊 ∈ (𝐴(2 WWalksNOn 𝐺)𝐶) ∧ ∃𝑓 𝑓(𝐴(SPathsOn‘𝐺)𝐶)𝑊))
21biimpi 206 . . 3 (𝑊 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) → (𝑊 ∈ (𝐴(2 WWalksNOn 𝐺)𝐶) ∧ ∃𝑓 𝑓(𝐴(SPathsOn‘𝐺)𝐶)𝑊))
3 elwwlks2on.v . . . . . . 7 𝑉 = (Vtx‘𝐺)
43elwwlks2on 26925 . . . . . 6 ((𝐺 ∈ UPGraph ∧ 𝐴𝑉𝐶𝑉) → (𝑊 ∈ (𝐴(2 WWalksNOn 𝐺)𝐶) ↔ ∃𝑏𝑉 (𝑊 = ⟨“𝐴𝑏𝐶”⟩ ∧ ∃𝑓(𝑓(Walks‘𝐺)𝑊 ∧ (#‘𝑓) = 2))))
5 simpl 472 . . . . . . . . . . . . 13 ((𝑊 = ⟨“𝐴𝑏𝐶”⟩ ∧ 𝑊 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶)) → 𝑊 = ⟨“𝐴𝑏𝐶”⟩)
6 eleq1 2718 . . . . . . . . . . . . . 14 (𝑊 = ⟨“𝐴𝑏𝐶”⟩ → (𝑊 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) ↔ ⟨“𝐴𝑏𝐶”⟩ ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶)))
76biimpa 500 . . . . . . . . . . . . 13 ((𝑊 = ⟨“𝐴𝑏𝐶”⟩ ∧ 𝑊 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶)) → ⟨“𝐴𝑏𝐶”⟩ ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶))
85, 7jca 553 . . . . . . . . . . . 12 ((𝑊 = ⟨“𝐴𝑏𝐶”⟩ ∧ 𝑊 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶)) → (𝑊 = ⟨“𝐴𝑏𝐶”⟩ ∧ ⟨“𝐴𝑏𝐶”⟩ ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶)))
98ex 449 . . . . . . . . . . 11 (𝑊 = ⟨“𝐴𝑏𝐶”⟩ → (𝑊 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) → (𝑊 = ⟨“𝐴𝑏𝐶”⟩ ∧ ⟨“𝐴𝑏𝐶”⟩ ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶))))
109adantr 480 . . . . . . . . . 10 ((𝑊 = ⟨“𝐴𝑏𝐶”⟩ ∧ ∃𝑓(𝑓(Walks‘𝐺)𝑊 ∧ (#‘𝑓) = 2)) → (𝑊 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) → (𝑊 = ⟨“𝐴𝑏𝐶”⟩ ∧ ⟨“𝐴𝑏𝐶”⟩ ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶))))
1110com12 32 . . . . . . . . 9 (𝑊 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) → ((𝑊 = ⟨“𝐴𝑏𝐶”⟩ ∧ ∃𝑓(𝑓(Walks‘𝐺)𝑊 ∧ (#‘𝑓) = 2)) → (𝑊 = ⟨“𝐴𝑏𝐶”⟩ ∧ ⟨“𝐴𝑏𝐶”⟩ ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶))))
1211reximdv 3045 . . . . . . . 8 (𝑊 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) → (∃𝑏𝑉 (𝑊 = ⟨“𝐴𝑏𝐶”⟩ ∧ ∃𝑓(𝑓(Walks‘𝐺)𝑊 ∧ (#‘𝑓) = 2)) → ∃𝑏𝑉 (𝑊 = ⟨“𝐴𝑏𝐶”⟩ ∧ ⟨“𝐴𝑏𝐶”⟩ ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶))))
1312a1i13 27 . . . . . . 7 ((𝐺 ∈ UPGraph ∧ 𝐴𝑉𝐶𝑉) → (𝑊 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) → (∃𝑓 𝑓(𝐴(SPathsOn‘𝐺)𝐶)𝑊 → (∃𝑏𝑉 (𝑊 = ⟨“𝐴𝑏𝐶”⟩ ∧ ∃𝑓(𝑓(Walks‘𝐺)𝑊 ∧ (#‘𝑓) = 2)) → ∃𝑏𝑉 (𝑊 = ⟨“𝐴𝑏𝐶”⟩ ∧ ⟨“𝐴𝑏𝐶”⟩ ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶))))))
1413com24 95 . . . . . 6 ((𝐺 ∈ UPGraph ∧ 𝐴𝑉𝐶𝑉) → (∃𝑏𝑉 (𝑊 = ⟨“𝐴𝑏𝐶”⟩ ∧ ∃𝑓(𝑓(Walks‘𝐺)𝑊 ∧ (#‘𝑓) = 2)) → (∃𝑓 𝑓(𝐴(SPathsOn‘𝐺)𝐶)𝑊 → (𝑊 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) → ∃𝑏𝑉 (𝑊 = ⟨“𝐴𝑏𝐶”⟩ ∧ ⟨“𝐴𝑏𝐶”⟩ ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶))))))
154, 14sylbid 230 . . . . 5 ((𝐺 ∈ UPGraph ∧ 𝐴𝑉𝐶𝑉) → (𝑊 ∈ (𝐴(2 WWalksNOn 𝐺)𝐶) → (∃𝑓 𝑓(𝐴(SPathsOn‘𝐺)𝐶)𝑊 → (𝑊 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) → ∃𝑏𝑉 (𝑊 = ⟨“𝐴𝑏𝐶”⟩ ∧ ⟨“𝐴𝑏𝐶”⟩ ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶))))))
1615impd 446 . . . 4 ((𝐺 ∈ UPGraph ∧ 𝐴𝑉𝐶𝑉) → ((𝑊 ∈ (𝐴(2 WWalksNOn 𝐺)𝐶) ∧ ∃𝑓 𝑓(𝐴(SPathsOn‘𝐺)𝐶)𝑊) → (𝑊 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) → ∃𝑏𝑉 (𝑊 = ⟨“𝐴𝑏𝐶”⟩ ∧ ⟨“𝐴𝑏𝐶”⟩ ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶)))))
1716com23 86 . . 3 ((𝐺 ∈ UPGraph ∧ 𝐴𝑉𝐶𝑉) → (𝑊 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) → ((𝑊 ∈ (𝐴(2 WWalksNOn 𝐺)𝐶) ∧ ∃𝑓 𝑓(𝐴(SPathsOn‘𝐺)𝐶)𝑊) → ∃𝑏𝑉 (𝑊 = ⟨“𝐴𝑏𝐶”⟩ ∧ ⟨“𝐴𝑏𝐶”⟩ ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶)))))
182, 17mpdi 45 . 2 ((𝐺 ∈ UPGraph ∧ 𝐴𝑉𝐶𝑉) → (𝑊 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) → ∃𝑏𝑉 (𝑊 = ⟨“𝐴𝑏𝐶”⟩ ∧ ⟨“𝐴𝑏𝐶”⟩ ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶))))
196biimpar 501 . . . 4 ((𝑊 = ⟨“𝐴𝑏𝐶”⟩ ∧ ⟨“𝐴𝑏𝐶”⟩ ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶)) → 𝑊 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶))
2019a1i 11 . . 3 (((𝐺 ∈ UPGraph ∧ 𝐴𝑉𝐶𝑉) ∧ 𝑏𝑉) → ((𝑊 = ⟨“𝐴𝑏𝐶”⟩ ∧ ⟨“𝐴𝑏𝐶”⟩ ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶)) → 𝑊 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶)))
2120rexlimdva 3060 . 2 ((𝐺 ∈ UPGraph ∧ 𝐴𝑉𝐶𝑉) → (∃𝑏𝑉 (𝑊 = ⟨“𝐴𝑏𝐶”⟩ ∧ ⟨“𝐴𝑏𝐶”⟩ ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶)) → 𝑊 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶)))
2218, 21impbid 202 1 ((𝐺 ∈ UPGraph ∧ 𝐴𝑉𝐶𝑉) → (𝑊 ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶) ↔ ∃𝑏𝑉 (𝑊 = ⟨“𝐴𝑏𝐶”⟩ ∧ ⟨“𝐴𝑏𝐶”⟩ ∈ (𝐴(2 WSPathsNOn 𝐺)𝐶))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 383  w3a 1054   = wceq 1523  wex 1744  wcel 2030  wrex 2942   class class class wbr 4685  cfv 5926  (class class class)co 6690  2c2 11108  #chash 13157  ⟨“cs3 13633  Vtxcvtx 25919  UPGraphcupgr 26020  Walkscwlks 26548  SPathsOncspthson 26667   WWalksNOn cwwlksnon 26775   WSPathsNOn cwwspthsnon 26777
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-rep 4804  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991  ax-ac2 9323  ax-cnex 10030  ax-resscn 10031  ax-1cn 10032  ax-icn 10033  ax-addcl 10034  ax-addrcl 10035  ax-mulcl 10036  ax-mulrcl 10037  ax-mulcom 10038  ax-addass 10039  ax-mulass 10040  ax-distr 10041  ax-i2m1 10042  ax-1ne0 10043  ax-1rid 10044  ax-rnegex 10045  ax-rrecex 10046  ax-cnre 10047  ax-pre-lttri 10048  ax-pre-lttrn 10049  ax-pre-ltadd 10050  ax-pre-mulgt0 10051
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-ifp 1033  df-3or 1055  df-3an 1056  df-tru 1526  df-fal 1529  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-nel 2927  df-ral 2946  df-rex 2947  df-reu 2948  df-rmo 2949  df-rab 2950  df-v 3233  df-sbc 3469  df-csb 3567  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-pss 3623  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-tp 4215  df-op 4217  df-uni 4469  df-int 4508  df-iun 4554  df-br 4686  df-opab 4746  df-mpt 4763  df-tr 4786  df-id 5053  df-eprel 5058  df-po 5064  df-so 5065  df-fr 5102  df-se 5103  df-we 5104  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-pred 5718  df-ord 5764  df-on 5765  df-lim 5766  df-suc 5767  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-f1 5931  df-fo 5932  df-f1o 5933  df-fv 5934  df-isom 5935  df-riota 6651  df-ov 6693  df-oprab 6694  df-mpt2 6695  df-om 7108  df-1st 7210  df-2nd 7211  df-wrecs 7452  df-recs 7513  df-rdg 7551  df-1o 7605  df-2o 7606  df-oadd 7609  df-er 7787  df-map 7901  df-pm 7902  df-en 7998  df-dom 7999  df-sdom 8000  df-fin 8001  df-card 8803  df-ac 8977  df-cda 9028  df-pnf 10114  df-mnf 10115  df-xr 10116  df-ltxr 10117  df-le 10118  df-sub 10306  df-neg 10307  df-nn 11059  df-2 11117  df-3 11118  df-n0 11331  df-xnn0 11402  df-z 11416  df-uz 11726  df-fz 12365  df-fzo 12505  df-hash 13158  df-word 13331  df-concat 13333  df-s1 13334  df-s2 13639  df-s3 13640  df-edg 25985  df-uhgr 25998  df-upgr 26022  df-wlks 26551  df-wwlks 26778  df-wwlksn 26779  df-wwlksnon 26780  df-wspthsnon 26782
This theorem is referenced by:  usgr2wspthon  26932  elwspths2spth  26934
  Copyright terms: Public domain W3C validator