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

Theorem wspthnp 27934
Description: Properties of a set being a simple path of a fixed length as word. (Contributed by AV, 18-May-2021.)
Assertion
Ref Expression
wspthnp (𝑊 ∈ (𝑁 WSPathsN 𝐺) → ((𝑁 ∈ ℕ0𝐺 ∈ V) ∧ 𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ ∃𝑓 𝑓(SPaths‘𝐺)𝑊))
Distinct variable groups:   𝑓,𝐺   𝑓,𝑊
Allowed substitution hint:   𝑁(𝑓)

Proof of Theorem wspthnp
Dummy variables 𝑔 𝑛 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-wspthsn 27917 . . 3 WSPathsN = (𝑛 ∈ ℕ0, 𝑔 ∈ V ↦ {𝑤 ∈ (𝑛 WWalksN 𝑔) ∣ ∃𝑓 𝑓(SPaths‘𝑔)𝑤})
21elmpocl 7447 . 2 (𝑊 ∈ (𝑁 WSPathsN 𝐺) → (𝑁 ∈ ℕ0𝐺 ∈ V))
3 simpl 486 . . 3 (((𝑁 ∈ ℕ0𝐺 ∈ V) ∧ 𝑊 ∈ (𝑁 WSPathsN 𝐺)) → (𝑁 ∈ ℕ0𝐺 ∈ V))
4 iswspthn 27933 . . . . 5 (𝑊 ∈ (𝑁 WSPathsN 𝐺) ↔ (𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ ∃𝑓 𝑓(SPaths‘𝐺)𝑊))
54a1i 11 . . . 4 ((𝑁 ∈ ℕ0𝐺 ∈ V) → (𝑊 ∈ (𝑁 WSPathsN 𝐺) ↔ (𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ ∃𝑓 𝑓(SPaths‘𝐺)𝑊)))
65biimpa 480 . . 3 (((𝑁 ∈ ℕ0𝐺 ∈ V) ∧ 𝑊 ∈ (𝑁 WSPathsN 𝐺)) → (𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ ∃𝑓 𝑓(SPaths‘𝐺)𝑊))
7 3anass 1097 . . 3 (((𝑁 ∈ ℕ0𝐺 ∈ V) ∧ 𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ ∃𝑓 𝑓(SPaths‘𝐺)𝑊) ↔ ((𝑁 ∈ ℕ0𝐺 ∈ V) ∧ (𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ ∃𝑓 𝑓(SPaths‘𝐺)𝑊)))
83, 6, 7sylanbrc 586 . 2 (((𝑁 ∈ ℕ0𝐺 ∈ V) ∧ 𝑊 ∈ (𝑁 WSPathsN 𝐺)) → ((𝑁 ∈ ℕ0𝐺 ∈ V) ∧ 𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ ∃𝑓 𝑓(SPaths‘𝐺)𝑊))
92, 8mpancom 688 1 (𝑊 ∈ (𝑁 WSPathsN 𝐺) → ((𝑁 ∈ ℕ0𝐺 ∈ V) ∧ 𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ ∃𝑓 𝑓(SPaths‘𝐺)𝑊))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399  w3a 1089  wex 1787  wcel 2110  {crab 3065  Vcvv 3408   class class class wbr 5053  cfv 6380  (class class class)co 7213  0cn0 12090  SPathscspths 27800   WWalksN cwwlksn 27910   WSPathsN cwwspthsn 27912
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2158  ax-12 2175  ax-ext 2708  ax-sep 5192  ax-nul 5199  ax-pr 5322
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2071  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2886  df-ne 2941  df-ral 3066  df-rex 3067  df-rab 3070  df-v 3410  df-sbc 3695  df-dif 3869  df-un 3871  df-in 3873  df-ss 3883  df-nul 4238  df-if 4440  df-sn 4542  df-pr 4544  df-op 4548  df-uni 4820  df-br 5054  df-opab 5116  df-id 5455  df-xp 5557  df-rel 5558  df-cnv 5559  df-co 5560  df-dm 5561  df-iota 6338  df-fun 6382  df-fv 6388  df-ov 7216  df-oprab 7217  df-mpo 7218  df-wwlksn 27915  df-wspthsn 27917
This theorem is referenced by:  wspthsswwlkn  28002
  Copyright terms: Public domain W3C validator