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

Theorem wspthnon 29931
Description: An element of the set of simple paths of a fixed length between two vertices as word. (Contributed by Alexander van der Vekens, 1-Mar-2018.) (Revised by AV, 12-May-2021.) (Revised by AV, 15-Mar-2022.)
Assertion
Ref Expression
wspthnon (𝑊 ∈ (𝐴(𝑁 WSPathsNOn 𝐺)𝐵) ↔ (𝑊 ∈ (𝐴(𝑁 WWalksNOn 𝐺)𝐵) ∧ ∃𝑓 𝑓(𝐴(SPathsOn‘𝐺)𝐵)𝑊))
Distinct variable groups:   𝐴,𝑓   𝐵,𝑓   𝑓,𝐺   𝑓,𝑁   𝑓,𝑊

Proof of Theorem wspthnon
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 breq2 5102 . . 3 (𝑤 = 𝑊 → (𝑓(𝐴(SPathsOn‘𝐺)𝐵)𝑤𝑓(𝐴(SPathsOn‘𝐺)𝐵)𝑊))
21exbidv 1922 . 2 (𝑤 = 𝑊 → (∃𝑓 𝑓(𝐴(SPathsOn‘𝐺)𝐵)𝑤 ↔ ∃𝑓 𝑓(𝐴(SPathsOn‘𝐺)𝐵)𝑊))
3 eqid 2736 . . 3 (Vtx‘𝐺) = (Vtx‘𝐺)
43iswspthsnon 29929 . 2 (𝐴(𝑁 WSPathsNOn 𝐺)𝐵) = {𝑤 ∈ (𝐴(𝑁 WWalksNOn 𝐺)𝐵) ∣ ∃𝑓 𝑓(𝐴(SPathsOn‘𝐺)𝐵)𝑤}
52, 4elrab2 3649 1 (𝑊 ∈ (𝐴(𝑁 WSPathsNOn 𝐺)𝐵) ↔ (𝑊 ∈ (𝐴(𝑁 WWalksNOn 𝐺)𝐵) ∧ ∃𝑓 𝑓(𝐴(SPathsOn‘𝐺)𝐵)𝑊))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1541  wex 1780  wcel 2113   class class class wbr 5098  cfv 6492  (class class class)co 7358  Vtxcvtx 29069  SPathsOncspthson 29786   WWalksNOn cwwlksnon 29900   WSPathsNOn cwwspthsnon 29902
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7361  df-oprab 7362  df-mpo 7363  df-1st 7933  df-2nd 7934  df-wwlksnon 29905  df-wspthsnon 29907
This theorem is referenced by:  wspthnonp  29932  wspthsnwspthsnon  29989  elwspths2on  30035  elwspths2onw  30036  elwspths2spth  30043
  Copyright terms: Public domain W3C validator