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

Theorem wspthsswwlknon 30537
Description: The set of simple paths of a fixed length between two vertices is a subset of the set of walks of the fixed length between the two vertices. (Contributed by AV, 15-May-2021.)
Assertion
Ref Expression
wspthsswwlknon (𝐴(𝑁 WSPathsNOn 𝐺)𝐵) ⊆ (𝐴(𝑁 WWalksNOn 𝐺)𝐵)

Proof of Theorem wspthsswwlknon
Dummy variables 𝑓 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2763 . . . 4 (Vtx‘𝐺) = (Vtx‘𝐺)
21wspthnonp 30475 . . 3 (𝑤 ∈ (𝐴(𝑁 WSPathsNOn 𝐺)𝐵) → ((𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V) ∧ (𝐴 ∈ (Vtx‘𝐺) ∧ 𝐵 ∈ (Vtx‘𝐺)) ∧ (𝑤 ∈ (𝐴(𝑁 WWalksNOn 𝐺)𝐵) ∧ ∃𝑓 𝑓(𝐴(SPathsOn‘𝐺)𝐵)𝑤)))
3 simp3l 1220 . . 3 (((𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V) ∧ (𝐴 ∈ (Vtx‘𝐺) ∧ 𝐵 ∈ (Vtx‘𝐺)) ∧ (𝑤 ∈ (𝐴(𝑁 WWalksNOn 𝐺)𝐵) ∧ ∃𝑓 𝑓(𝐴(SPathsOn‘𝐺)𝐵)𝑤)) → 𝑤 ∈ (𝐴(𝑁 WWalksNOn 𝐺)𝐵))
42, 3syl 18 . 2 (𝑤 ∈ (𝐴(𝑁 WSPathsNOn 𝐺)𝐵) → 𝑤 ∈ (𝐴(𝑁 WWalksNOn 𝐺)𝐵))
54ssriv 3917 1 (𝐴(𝑁 WSPathsNOn 𝐺)𝐵) ⊆ (𝐴(𝑁 WWalksNOn 𝐺)𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∧ wa 401   ∧ w3a 1103  ∃wex 1812   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900   class class class wbr 5106  ‘cfv 6555  (class class class)co 7440  ℕ0cn0 12630  Vtxcvtx 29601  SPathsOncspthson 30325   WWalksNOn cwwlksnon 30443   WSPathsNOn cwwspthsnon 30445
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-1st 8022  df-2nd 8023  df-wwlksnon 30448  df-wspthsnon 30450
This theorem is used by:  wspthnonfi  30538
  Copyright terms: Public domain W3C validator