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

Theorem wspthnonOLDOLD 26991
 Description: Obsolete version of wspthnon 26988 as of 15-Mar-2022. (Contributed by Alexander van der Vekens, 1-Mar-2018.) (Revised by AV, 12-May-2021.) (New usage is discouraged.) (Proof modification is discouraged.)
Hypothesis
Ref Expression
wwlknon.v 𝑉 = (Vtx‘𝐺)
Assertion
Ref Expression
wspthnonOLDOLD ((𝐴𝑉𝐵𝑉) → (𝑊 ∈ (𝐴(𝑁 WSPathsNOn 𝐺)𝐵) ↔ (𝑊 ∈ (𝐴(𝑁 WWalksNOn 𝐺)𝐵) ∧ ∃𝑓 𝑓(𝐴(SPathsOn‘𝐺)𝐵)𝑊)))
Distinct variable groups:   𝐴,𝑓   𝐵,𝑓   𝑓,𝐺   𝑓,𝑁   𝑓,𝑉   𝑓,𝑊

Proof of Theorem wspthnonOLDOLD
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 wwlknon.v . . . 4 𝑉 = (Vtx‘𝐺)
21iswspthsnonOLD 26986 . . 3 ((𝐴𝑉𝐵𝑉) → (𝐴(𝑁 WSPathsNOn 𝐺)𝐵) = {𝑤 ∈ (𝐴(𝑁 WWalksNOn 𝐺)𝐵) ∣ ∃𝑓 𝑓(𝐴(SPathsOn‘𝐺)𝐵)𝑤})
32eleq2d 2835 . 2 ((𝐴𝑉𝐵𝑉) → (𝑊 ∈ (𝐴(𝑁 WSPathsNOn 𝐺)𝐵) ↔ 𝑊 ∈ {𝑤 ∈ (𝐴(𝑁 WWalksNOn 𝐺)𝐵) ∣ ∃𝑓 𝑓(𝐴(SPathsOn‘𝐺)𝐵)𝑤}))
4 breq2 4788 . . . 4 (𝑤 = 𝑊 → (𝑓(𝐴(SPathsOn‘𝐺)𝐵)𝑤𝑓(𝐴(SPathsOn‘𝐺)𝐵)𝑊))
54exbidv 2001 . . 3 (𝑤 = 𝑊 → (∃𝑓 𝑓(𝐴(SPathsOn‘𝐺)𝐵)𝑤 ↔ ∃𝑓 𝑓(𝐴(SPathsOn‘𝐺)𝐵)𝑊))
65elrab 3513 . 2 (𝑊 ∈ {𝑤 ∈ (𝐴(𝑁 WWalksNOn 𝐺)𝐵) ∣ ∃𝑓 𝑓(𝐴(SPathsOn‘𝐺)𝐵)𝑤} ↔ (𝑊 ∈ (𝐴(𝑁 WWalksNOn 𝐺)𝐵) ∧ ∃𝑓 𝑓(𝐴(SPathsOn‘𝐺)𝐵)𝑊))
73, 6syl6bb 276 1 ((𝐴𝑉𝐵𝑉) → (𝑊 ∈ (𝐴(𝑁 WSPathsNOn 𝐺)𝐵) ↔ (𝑊 ∈ (𝐴(𝑁 WWalksNOn 𝐺)𝐵) ∧ ∃𝑓 𝑓(𝐴(SPathsOn‘𝐺)𝐵)𝑊)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 382   = wceq 1630  ∃wex 1851   ∈ wcel 2144  {crab 3064   class class class wbr 4784  ‘cfv 6031  (class class class)co 6792  Vtxcvtx 26094  SPathsOncspthson 26845   WWalksNOn cwwlksnon 26954   WSPathsNOn cwwspthsnon 26956 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1869  ax-4 1884  ax-5 1990  ax-6 2056  ax-7 2092  ax-8 2146  ax-9 2153  ax-10 2173  ax-11 2189  ax-12 2202  ax-13 2407  ax-ext 2750  ax-rep 4902  ax-sep 4912  ax-nul 4920  ax-pow 4971  ax-pr 5034  ax-un 7095 This theorem depends on definitions:  df-bi 197  df-an 383  df-or 827  df-3an 1072  df-tru 1633  df-ex 1852  df-nf 1857  df-sb 2049  df-eu 2621  df-mo 2622  df-clab 2757  df-cleq 2763  df-clel 2766  df-nfc 2901  df-ne 2943  df-ral 3065  df-rex 3066  df-reu 3067  df-rab 3069  df-v 3351  df-sbc 3586  df-csb 3681  df-dif 3724  df-un 3726  df-in 3728  df-ss 3735  df-nul 4062  df-if 4224  df-pw 4297  df-sn 4315  df-pr 4317  df-op 4321  df-uni 4573  df-iun 4654  df-br 4785  df-opab 4845  df-mpt 4862  df-id 5157  df-xp 5255  df-rel 5256  df-cnv 5257  df-co 5258  df-dm 5259  df-rn 5260  df-res 5261  df-ima 5262  df-iota 5994  df-fun 6033  df-fn 6034  df-f 6035  df-f1 6036  df-fo 6037  df-f1o 6038  df-fv 6039  df-ov 6795  df-oprab 6796  df-mpt2 6797  df-1st 7314  df-2nd 7315  df-wwlksnon 26959  df-wspthsnon 26961 This theorem is referenced by:  wspthsnwspthsnonOLD  27060
 Copyright terms: Public domain W3C validator