HomeHome Metamath Proof Explorer
Theorem List (p. 412 of 425)
< Previous  Next >
Bad symbols? Try the
GIF version.

Mirrors  >  Metamath Home Page  >  MPE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

Color key:    Metamath Proof Explorer  Metamath Proof Explorer
(1-26947)
  Hilbert Space Explorer  Hilbert Space Explorer
(26948-28472)
  Users' Mathboxes  Users' Mathboxes
(28473-42426)
 

Theorem List for Metamath Proof Explorer - 41101-41200   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
TheoremisCrct 41101 Sufficient and necessary conditions for a pair of functions to be a circuit (in an undirected graph): A pair of function "is" (represents) a circuit iff it is a closed trail. (Contributed by Alexander van der Vekens, 30-Oct-2017.) (Revised by AV, 31-Jan-2021.)
((𝐺𝑊𝐹𝑈𝑃𝑍) → (𝐹(CircuitS‘𝐺)𝑃 ↔ (𝐹(TrailS‘𝐺)𝑃 ∧ (𝑃‘0) = (𝑃‘(#‘𝐹)))))
 
TheoremisCycl 41102 Sufficient and necessary conditions for a pair of functions to be a cycle (in an undirected graph): A pair of function "is" (represents) a cycle iff it is a closed path. (Contributed by Alexander van der Vekens, 30-Oct-2017.) (Revised by AV, 31-Jan-2021.)
((𝐺𝑊𝐹𝑈𝑃𝑍) → (𝐹(CycleS‘𝐺)𝑃 ↔ (𝐹(PathS‘𝐺)𝑃 ∧ (𝑃‘0) = (𝑃‘(#‘𝐹)))))
 
Theoremcrctprop 41103 The properties of a circuit: A circuit is a closed trail. (Contributed by AV, 31-Jan-2021.)
(𝐹(CircuitS‘𝐺)𝑃 → (𝐹(TrailS‘𝐺)𝑃 ∧ (𝑃‘0) = (𝑃‘(#‘𝐹))))
 
Theoremcyclprop 41104 The properties of a cycle: A cycle is a closed path. (Contributed by AV, 31-Jan-2021.)
(𝐹(CycleS‘𝐺)𝑃 → (𝐹(PathS‘𝐺)𝑃 ∧ (𝑃‘0) = (𝑃‘(#‘𝐹))))
 
Theoremcrctisclwlk 41105 A circuit is a closed walk. (Contributed by AV, 17-Feb-2021.)
(𝐹(CircuitS‘𝐺)𝑃𝐹(ClWalkS‘𝐺)𝑃)
 
TheoremcrctisTrl 41106 A circuit is a trail. (Contributed by Alexander van der Vekens, 30-Oct-2017.) (Revised by AV, 31-Jan-2021.)
(𝐹(CircuitS‘𝐺)𝑃𝐹(TrailS‘𝐺)𝑃)
 
Theoremcrctis1wlk 41107 A circuit is a walk. (Contributed by AV, 6-Apr-2021.)
(𝐹(CircuitS‘𝐺)𝑃𝐹(1Walks‘𝐺)𝑃)
 
TheoremcyclisPth 41108 A cycle is a path. (Contributed by Alexander van der Vekens, 30-Oct-2017.) (Revised by AV, 31-Jan-2021.)
(𝐹(CycleS‘𝐺)𝑃𝐹(PathS‘𝐺)𝑃)
 
TheoremcyclisWlk 41109 A cycle is a walk. (Contributed by Alexander van der Vekens, 7-Nov-2017.) (Revised by AV, 31-Jan-2021.)
(𝐹(CycleS‘𝐺)𝑃𝐹(1Walks‘𝐺)𝑃)
 
TheoremcyclisCrct 41110 A cycle is a circuit. (Contributed by Alexander van der Vekens, 30-Oct-2017.) (Revised by AV, 31-Jan-2021.)
(𝐹(CycleS‘𝐺)𝑃𝐹(CircuitS‘𝐺)𝑃)
 
TheoremcyclnsPth 41111 A (non trivial) cycle is not a simple path. (Contributed by Alexander van der Vekens, 30-Oct-2017.) (Revised by AV, 31-Jan-2021.)
(𝐹 ≠ ∅ → (𝐹(CycleS‘𝐺)𝑃 → ¬ 𝐹(SPathS‘𝐺)𝑃))
 
TheoremcyclisPthon 41112 A cycle is a path starting and ending at its first vertex. (Contributed by Alexander van der Vekens, 8-Nov-2017.) (Revised by AV, 31-Jan-2021.)
(𝐹(CycleS‘𝐺)𝑃𝐹((𝑃‘0)(PathsOn‘𝐺)(𝑃‘0))𝑃)
 
Theoremlfgrn1cycl 41113* In a loop-free graph there are no cycles with length 1 (consisting of one edge). (Contributed by Alexander van der Vekens, 7-Nov-2017.) (Revised by AV, 2-Feb-2021.)
𝑉 = (Vtx‘𝐺)    &   𝐼 = (iEdg‘𝐺)       (𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)} → (𝐹(CycleS‘𝐺)𝑃 → (#‘𝐹) ≠ 1))
 
Theoremusgr2trlncrct 41114 In a simple graph, any trail of length 2 is not a circuit. (Contributed by AV, 5-Jun-2021.)
((𝐺 ∈ USGraph ∧ (#‘𝐹) = 2) → (𝐹(TrailS‘𝐺)𝑃 → ¬ 𝐹(CircuitS‘𝐺)𝑃))
 
Theoremumgrn1cycl 41115 In a multigraph graph (with no loops!) there are no cycles with length 1 (consisting of one edge). (Contributed by Alexander van der Vekens, 7-Nov-2017.) (Revised by AV, 2-Feb-2021.)
((𝐺 ∈ UMGraph ∧ 𝐹(CycleS‘𝐺)𝑃) → (#‘𝐹) ≠ 1)
 
Theoremuspgrn2crct 41116 In a simple pseudograph there are no circuits with length 2 (consisting of two edges). (Contributed by Alexander van der Vekens, 9-Nov-2017.) (Revised by AV, 3-Feb-2021.)
((𝐺 ∈ USPGraph ∧ 𝐹(CircuitS‘𝐺)𝑃) → (#‘𝐹) ≠ 2)
 
Theoremusgrn2cycl 41117 In a simple graph there are no cycles with length 2 (consisting of two edges). (Contributed by Alexander van der Vekens, 9-Nov-2017.) (Revised by AV, 4-Feb-2021.)
((𝐺 ∈ USGraph ∧ 𝐹(CycleS‘𝐺)𝑃) → (#‘𝐹) ≠ 2)
 
Theoremcrctcsh1wlkn0lem1 41118 Lemma for crctcsh1wlkn0 41129. (Contributed by AV, 13-Mar-2021.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℕ) → ((𝐴𝐵) + 1) ≤ 𝐴)
 
Theoremcrctcsh1wlkn0lem2 41119* Lemma for crctcsh1wlkn0 41129. (Contributed by AV, 12-Mar-2021.)
(𝜑𝑆 ∈ (1..^𝑁))    &   𝑄 = (𝑥 ∈ (0...𝑁) ↦ if(𝑥 ≤ (𝑁𝑆), (𝑃‘(𝑥 + 𝑆)), (𝑃‘((𝑥 + 𝑆) − 𝑁))))       ((𝜑𝐽 ∈ (0...(𝑁𝑆))) → (𝑄𝐽) = (𝑃‘(𝐽 + 𝑆)))
 
Theoremcrctcsh1wlkn0lem3 41120* Lemma for crctcsh1wlkn0 41129. (Contributed by AV, 12-Mar-2021.)
(𝜑𝑆 ∈ (1..^𝑁))    &   𝑄 = (𝑥 ∈ (0...𝑁) ↦ if(𝑥 ≤ (𝑁𝑆), (𝑃‘(𝑥 + 𝑆)), (𝑃‘((𝑥 + 𝑆) − 𝑁))))       ((𝜑𝐽 ∈ (((𝑁𝑆) + 1)...𝑁)) → (𝑄𝐽) = (𝑃‘((𝐽 + 𝑆) − 𝑁)))
 
Theoremcrctcsh1wlkn0lem4 41121* Lemma for crctcsh1wlkn0 41129. (Contributed by AV, 12-Mar-2021.)
(𝜑𝑆 ∈ (1..^𝑁))    &   𝑄 = (𝑥 ∈ (0...𝑁) ↦ if(𝑥 ≤ (𝑁𝑆), (𝑃‘(𝑥 + 𝑆)), (𝑃‘((𝑥 + 𝑆) − 𝑁))))    &   𝐻 = (𝐹 cyclShift 𝑆)    &   𝑁 = (#‘𝐹)    &   (𝜑𝐹 ∈ Word 𝐴)    &   (𝜑 → ∀𝑖 ∈ (0..^𝑁)if-((𝑃𝑖) = (𝑃‘(𝑖 + 1)), (𝐼‘(𝐹𝑖)) = {(𝑃𝑖)}, {(𝑃𝑖), (𝑃‘(𝑖 + 1))} ⊆ (𝐼‘(𝐹𝑖))))       (𝜑 → ∀𝑗 ∈ (0..^(𝑁𝑆))if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗))))
 
Theoremcrctcsh1wlkn0lem5 41122* Lemma for crctcsh1wlkn0 41129. (Contributed by AV, 12-Mar-2021.)
(𝜑𝑆 ∈ (1..^𝑁))    &   𝑄 = (𝑥 ∈ (0...𝑁) ↦ if(𝑥 ≤ (𝑁𝑆), (𝑃‘(𝑥 + 𝑆)), (𝑃‘((𝑥 + 𝑆) − 𝑁))))    &   𝐻 = (𝐹 cyclShift 𝑆)    &   𝑁 = (#‘𝐹)    &   (𝜑𝐹 ∈ Word 𝐴)    &   (𝜑 → ∀𝑖 ∈ (0..^𝑁)if-((𝑃𝑖) = (𝑃‘(𝑖 + 1)), (𝐼‘(𝐹𝑖)) = {(𝑃𝑖)}, {(𝑃𝑖), (𝑃‘(𝑖 + 1))} ⊆ (𝐼‘(𝐹𝑖))))       (𝜑 → ∀𝑗 ∈ (((𝑁𝑆) + 1)..^𝑁)if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗))))
 
Theoremcrctcsh1wlkn0lem6 41123* Lemma for crctcsh1wlkn0 41129. (Contributed by AV, 12-Mar-2021.)
(𝜑𝑆 ∈ (1..^𝑁))    &   𝑄 = (𝑥 ∈ (0...𝑁) ↦ if(𝑥 ≤ (𝑁𝑆), (𝑃‘(𝑥 + 𝑆)), (𝑃‘((𝑥 + 𝑆) − 𝑁))))    &   𝐻 = (𝐹 cyclShift 𝑆)    &   𝑁 = (#‘𝐹)    &   (𝜑𝐹 ∈ Word 𝐴)    &   (𝜑 → ∀𝑖 ∈ (0..^𝑁)if-((𝑃𝑖) = (𝑃‘(𝑖 + 1)), (𝐼‘(𝐹𝑖)) = {(𝑃𝑖)}, {(𝑃𝑖), (𝑃‘(𝑖 + 1))} ⊆ (𝐼‘(𝐹𝑖))))    &   (𝜑 → (𝑃𝑁) = (𝑃‘0))       ((𝜑𝐽 = (𝑁𝑆)) → if-((𝑄𝐽) = (𝑄‘(𝐽 + 1)), (𝐼‘(𝐻𝐽)) = {(𝑄𝐽)}, {(𝑄𝐽), (𝑄‘(𝐽 + 1))} ⊆ (𝐼‘(𝐻𝐽))))
 
Theoremcrctcsh1wlkn0lem7 41124* Lemma for crctcsh1wlkn0 41129. (Contributed by AV, 12-Mar-2021.)
(𝜑𝑆 ∈ (1..^𝑁))    &   𝑄 = (𝑥 ∈ (0...𝑁) ↦ if(𝑥 ≤ (𝑁𝑆), (𝑃‘(𝑥 + 𝑆)), (𝑃‘((𝑥 + 𝑆) − 𝑁))))    &   𝐻 = (𝐹 cyclShift 𝑆)    &   𝑁 = (#‘𝐹)    &   (𝜑𝐹 ∈ Word 𝐴)    &   (𝜑 → ∀𝑖 ∈ (0..^𝑁)if-((𝑃𝑖) = (𝑃‘(𝑖 + 1)), (𝐼‘(𝐹𝑖)) = {(𝑃𝑖)}, {(𝑃𝑖), (𝑃‘(𝑖 + 1))} ⊆ (𝐼‘(𝐹𝑖))))    &   (𝜑 → (𝑃𝑁) = (𝑃‘0))       (𝜑 → ∀𝑗 ∈ (0..^𝑁)if-((𝑄𝑗) = (𝑄‘(𝑗 + 1)), (𝐼‘(𝐻𝑗)) = {(𝑄𝑗)}, {(𝑄𝑗), (𝑄‘(𝑗 + 1))} ⊆ (𝐼‘(𝐻𝑗))))
 
Theoremcrctcshlem1 41125 Lemma for crctcsh 41132. (Contributed by AV, 10-Mar-2021.)
𝑉 = (Vtx‘𝐺)    &   𝐼 = (iEdg‘𝐺)    &   (𝜑𝐹(CircuitS‘𝐺)𝑃)    &   𝑁 = (#‘𝐹)       (𝜑𝑁 ∈ ℕ0)
 
Theoremcrctcshlem2 41126 Lemma for crctcsh 41132. (Contributed by AV, 10-Mar-2021.)
𝑉 = (Vtx‘𝐺)    &   𝐼 = (iEdg‘𝐺)    &   (𝜑𝐹(CircuitS‘𝐺)𝑃)    &   𝑁 = (#‘𝐹)    &   (𝜑𝑆 ∈ (0..^𝑁))    &   𝐻 = (𝐹 cyclShift 𝑆)       (𝜑 → (#‘𝐻) = 𝑁)
 
Theoremcrctcshlem3 41127* Lemma for crctcsh 41132. (Contributed by AV, 10-Mar-2021.)
𝑉 = (Vtx‘𝐺)    &   𝐼 = (iEdg‘𝐺)    &   (𝜑𝐹(CircuitS‘𝐺)𝑃)    &   𝑁 = (#‘𝐹)    &   (𝜑𝑆 ∈ (0..^𝑁))    &   𝐻 = (𝐹 cyclShift 𝑆)    &   𝑄 = (𝑥 ∈ (0...𝑁) ↦ if(𝑥 ≤ (𝑁𝑆), (𝑃‘(𝑥 + 𝑆)), (𝑃‘((𝑥 + 𝑆) − 𝑁))))       (𝜑 → (𝐺 ∈ V ∧ 𝐻 ∈ V ∧ 𝑄 ∈ V))
 
Theoremcrctcshlem4 41128* Lemma for crctcsh 41132. (Contributed by AV, 10-Mar-2021.)
𝑉 = (Vtx‘𝐺)    &   𝐼 = (iEdg‘𝐺)    &   (𝜑𝐹(CircuitS‘𝐺)𝑃)    &   𝑁 = (#‘𝐹)    &   (𝜑𝑆 ∈ (0..^𝑁))    &   𝐻 = (𝐹 cyclShift 𝑆)    &   𝑄 = (𝑥 ∈ (0...𝑁) ↦ if(𝑥 ≤ (𝑁𝑆), (𝑃‘(𝑥 + 𝑆)), (𝑃‘((𝑥 + 𝑆) − 𝑁))))       ((𝜑𝑆 = 0) → (𝐻 = 𝐹𝑄 = 𝑃))
 
Theoremcrctcsh1wlkn0 41129* Cyclically shifting the indices of a circuit 𝐹, 𝑃 results in a 1-walk 𝐻, 𝑄. (Contributed by AV, 10-Mar-2021.)
𝑉 = (Vtx‘𝐺)    &   𝐼 = (iEdg‘𝐺)    &   (𝜑𝐹(CircuitS‘𝐺)𝑃)    &   𝑁 = (#‘𝐹)    &   (𝜑𝑆 ∈ (0..^𝑁))    &   𝐻 = (𝐹 cyclShift 𝑆)    &   𝑄 = (𝑥 ∈ (0...𝑁) ↦ if(𝑥 ≤ (𝑁𝑆), (𝑃‘(𝑥 + 𝑆)), (𝑃‘((𝑥 + 𝑆) − 𝑁))))       ((𝜑𝑆 ≠ 0) → 𝐻(1Walks‘𝐺)𝑄)
 
Theoremcrctcsh1wlk 41130* Cyclically shifting the indices of a circuit 𝐹, 𝑃 results in a 1-walk 𝐻, 𝑄. (Contributed by AV, 10-Mar-2021.)
𝑉 = (Vtx‘𝐺)    &   𝐼 = (iEdg‘𝐺)    &   (𝜑𝐹(CircuitS‘𝐺)𝑃)    &   𝑁 = (#‘𝐹)    &   (𝜑𝑆 ∈ (0..^𝑁))    &   𝐻 = (𝐹 cyclShift 𝑆)    &   𝑄 = (𝑥 ∈ (0...𝑁) ↦ if(𝑥 ≤ (𝑁𝑆), (𝑃‘(𝑥 + 𝑆)), (𝑃‘((𝑥 + 𝑆) − 𝑁))))       (𝜑𝐻(1Walks‘𝐺)𝑄)
 
Theoremcrctcshtrl 41131* Cyclically shifting the indices of a circuit 𝐹, 𝑃 results in a trail 𝐻, 𝑄. (Contributed by AV, 14-Mar-2021.)
𝑉 = (Vtx‘𝐺)    &   𝐼 = (iEdg‘𝐺)    &   (𝜑𝐹(CircuitS‘𝐺)𝑃)    &   𝑁 = (#‘𝐹)    &   (𝜑𝑆 ∈ (0..^𝑁))    &   𝐻 = (𝐹 cyclShift 𝑆)    &   𝑄 = (𝑥 ∈ (0...𝑁) ↦ if(𝑥 ≤ (𝑁𝑆), (𝑃‘(𝑥 + 𝑆)), (𝑃‘((𝑥 + 𝑆) − 𝑁))))       (𝜑𝐻(TrailS‘𝐺)𝑄)
 
Theoremcrctcsh 41132* Cyclically shifting the indices of a circuit 𝐹, 𝑃 results in a circuit 𝐻, 𝑄. (Contributed by AV, 10-Mar-2021.)
𝑉 = (Vtx‘𝐺)    &   𝐼 = (iEdg‘𝐺)    &   (𝜑𝐹(CircuitS‘𝐺)𝑃)    &   𝑁 = (#‘𝐹)    &   (𝜑𝑆 ∈ (0..^𝑁))    &   𝐻 = (𝐹 cyclShift 𝑆)    &   𝑄 = (𝑥 ∈ (0...𝑁) ↦ if(𝑥 ≤ (𝑁𝑆), (𝑃‘(𝑥 + 𝑆)), (𝑃‘((𝑥 + 𝑆) − 𝑁))))       (𝜑𝐻(CircuitS‘𝐺)𝑄)
 
20.34.8.20  Walks as words

In general, a walk is an alternating sequence of vertices and edges, as defined in df-1wlks 40905: p(0) e(f(1)) p(1) e(f(2)) ... p(n-1) e(f(n)) p(n). Often, it is sufficient to refer to a walk by the natural sequence of its vertices, i.e omitting its edges in its representation: p(0) p(1) ... p(n-1) p(n), see the corresponding remark in [Diestel] p. 6. The concept of a Word, see df-word 13013, is the appropriate way to define such a sequence (being finite and starting at index 0) of vertices. Therefore, it is used in definitions df-wwlks 41138 and df-wwlksn 41139, and the representation of a walk as sequence of its vertices is called "walk as word".

Only for simple pseudographs, however, the edges can be uniquely reconstructed from such a representation. In other cases, there could be more than one edge between two adjacent vertices in the walk (in a multigraph), or two adjacent vertices could be connected by two different hyperedges involving additional vertices (in a hypergraph).

 
Syntaxcwwlks 41133 Extend class notation with walks (in a graph) as word over the set of vertices.
class WWalkS
 
Syntaxcwwlksn 41134 Extend class notation with walks (in a graph) of a fixed length as word over the set of vertices.
class WWalkSN
 
Syntaxcwwlksnon 41135 Extend class notation with walks between two vertices (in a graph) of a fixed length as word over the set of vertices.
class WWalksNOn
 
Syntaxcwwspthsn 41136 Extend class notation with simple paths (in a graph) of a fixed length as word over the set of vertices.
class WSPathsN
 
Syntaxcwwspthsnon 41137 Extend class notation with simple paths between two vertices (in a graph) of a fixed length as word over the set of vertices.
class WSPathsNOn
 
Definitiondf-wwlks 41138* Define the set of all walks (in an undirected graph) as words over the set of vertices. Such a word corresponds to the sequence p(0) p(1) ... p(n-1) p(n) of the vertices in a walk p(0) e(f(1)) p(1) e(f(2)) ... p(n-1) e(f(n)) p(n) as defined in df-1wlks 40905. 𝑤 = ∅ has to be excluded because a walk always consists of at least one vertex, see wlkn0 25793. (Contributed by Alexander van der Vekens, 15-Jul-2018.) (Revised by AV, 8-Apr-2021.)
WWalkS = (𝑔 ∈ V ↦ {𝑤 ∈ Word (Vtx‘𝑔) ∣ (𝑤 ≠ ∅ ∧ ∀𝑖 ∈ (0..^((#‘𝑤) − 1)){(𝑤𝑖), (𝑤‘(𝑖 + 1))} ∈ (Edg‘𝑔))})
 
Definitiondf-wwlksn 41139* Define the set of all walks (in an undirected graph) of a fixed length n as words over the set of vertices. Such a word corresponds to the sequence p(0) p(1) ... p(n) of the vertices in a walk p(0) e(f(1)) p(1) e(f(2)) ... p(n-1) e(f(n)) p(n) as defined in df-1wlks 40905. (Contributed by Alexander van der Vekens, 15-Jul-2018.) (Revised by AV, 8-Apr-2021.)
WWalkSN = (𝑛 ∈ ℕ0, 𝑔 ∈ V ↦ {𝑤 ∈ (WWalkS‘𝑔) ∣ (#‘𝑤) = (𝑛 + 1)})
 
Definitiondf-wwlksnon 41140* Define the collection of walks of a fixed length with particular endpoints as word over the set of vertices. (Contributed by Alexander van der Vekens, 15-Feb-2018.) (Revised by AV, 11-May-2021.)
WWalksNOn = (𝑛 ∈ ℕ0, 𝑔 ∈ V ↦ (𝑎 ∈ (Vtx‘𝑔), 𝑏 ∈ (Vtx‘𝑔) ↦ {𝑤 ∈ (𝑛 WWalkSN 𝑔) ∣ ((𝑤‘0) = 𝑎 ∧ (𝑤𝑛) = 𝑏)}))
 
Definitiondf-wspthsn 41141* Define the collection of simple paths of a fixed length as word over the set of vertices. (Contributed by Alexander van der Vekens, 1-Mar-2018.) (Revised by AV, 11-May-2021.)
WSPathsN = (𝑛 ∈ ℕ0, 𝑔 ∈ V ↦ {𝑤 ∈ (𝑛 WWalkSN 𝑔) ∣ ∃𝑓 𝑓(SPathS‘𝑔)𝑤})
 
Definitiondf-wspthsnon 41142* Define the collection of simple paths of a fixed length with particular endpoints as word over the set of vertices. (Contributed by Alexander van der Vekens, 1-Mar-2018.) (Revised by AV, 11-May-2021.)
WSPathsNOn = (𝑛 ∈ ℕ0, 𝑔 ∈ V ↦ (𝑎 ∈ (Vtx‘𝑔), 𝑏 ∈ (Vtx‘𝑔) ↦ {𝑤 ∈ (𝑎(𝑛 WWalksNOn 𝑔)𝑏) ∣ ∃𝑓 𝑓(𝑎(SPathsOn‘𝑔)𝑏)𝑤}))
 
Theoremwwlks 41143* The set of walks (in an undirected graph) as words over the set of vertices. (Contributed by Alexander van der Vekens, 15-Jul-2018.) (Revised by AV, 8-Apr-2021.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)       (WWalkS‘𝐺) = {𝑤 ∈ Word 𝑉 ∣ (𝑤 ≠ ∅ ∧ ∀𝑖 ∈ (0..^((#‘𝑤) − 1)){(𝑤𝑖), (𝑤‘(𝑖 + 1))} ∈ 𝐸)}
 
Theoremiswwlks 41144* A word over the set of vertices representing a walk (in an undirected graph). (Contributed by Alexander van der Vekens, 15-Jul-2018.) (Revised by AV, 8-Apr-2021.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)       (𝑊 ∈ (WWalkS‘𝐺) ↔ (𝑊 ≠ ∅ ∧ 𝑊 ∈ Word 𝑉 ∧ ∀𝑖 ∈ (0..^((#‘𝑊) − 1)){(𝑊𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸))
 
Theoremwwlksn 41145* The set of walks (in an undirected graph) of a fixed length as words over the set of vertices. (Contributed by Alexander van der Vekens, 15-Jul-2018.) (Revised by AV, 8-Apr-2021.)
(𝑁 ∈ ℕ0 → (𝑁 WWalkSN 𝐺) = {𝑤 ∈ (WWalkS‘𝐺) ∣ (#‘𝑤) = (𝑁 + 1)})
 
Theoremiswwlksn 41146 A word over the set of vertices representing a walk of a fixed length (in an undirected graph). (Contributed by Alexander van der Vekens, 15-Jul-2018.) (Revised by AV, 8-Apr-2021.)
(𝑁 ∈ ℕ0 → (𝑊 ∈ (𝑁 WWalkSN 𝐺) ↔ (𝑊 ∈ (WWalkS‘𝐺) ∧ (#‘𝑊) = (𝑁 + 1))))
 
Theoremiswwlksnx 41147* Properties of a word to represent a walk of a fixed length, definition of WWalkS expanded. (Contributed by AV, 28-Apr-2021.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)       (𝑁 ∈ ℕ0 → (𝑊 ∈ (𝑁 WWalkSN 𝐺) ↔ (𝑊 ∈ Word 𝑉 ∧ ∀𝑖 ∈ (0..^((#‘𝑊) − 1)){(𝑊𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸 ∧ (#‘𝑊) = (𝑁 + 1))))
 
Theoremwwlkbp 41148 Basic properties of a walk (in an undirected graph) as word. (Contributed by Alexander van der Vekens, 15-Jul-2018.) (Revised by AV, 9-Apr-2021.)
𝑉 = (Vtx‘𝐺)       (𝑊 ∈ (WWalkS‘𝐺) → (𝐺 ∈ V ∧ 𝑊 ∈ Word 𝑉))
 
Theoremwwlknbp 41149 Basic properties of a walk of a fixed length (in an undirected graph) as word. (Contributed by Alexander van der Vekens, 16-Jul-2018.) (Revised by AV, 9-Apr-2021.) (Proof shortened by AV, 20-May-2021.)
𝑉 = (Vtx‘𝐺)       (𝑊 ∈ (𝑁 WWalkSN 𝐺) → (𝐺 ∈ V ∧ 𝑁 ∈ ℕ0𝑊 ∈ Word 𝑉))
 
Theoremwwlknp 41150* Properties of a set being a walk of length n (represented by a word). (Contributed by Alexander van der Vekens, 17-Jun-2018.) (Revised by AV, 9-Apr-2021.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)       (𝑊 ∈ (𝑁 WWalkSN 𝐺) → (𝑊 ∈ Word 𝑉 ∧ (#‘𝑊) = (𝑁 + 1) ∧ ∀𝑖 ∈ (0..^𝑁){(𝑊𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸))
 
Theoremwspthsn 41151* The set of simple paths of a fixed length as word. (Contributed by Alexander van der Vekens, 1-Mar-2018.) (Revised by AV, 11-May-2021.)
(𝑁 WSPathsN 𝐺) = {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ ∃𝑓 𝑓(SPathS‘𝐺)𝑤}
 
Theoremiswspthn 41152* An element of the set of simple paths of a fixed length as word. (Contributed by Alexander van der Vekens, 1-Mar-2018.) (Revised by AV, 11-May-2021.)
(𝑊 ∈ (𝑁 WSPathsN 𝐺) ↔ (𝑊 ∈ (𝑁 WWalkSN 𝐺) ∧ ∃𝑓 𝑓(SPathS‘𝐺)𝑊))
 
Theoremwspthnp 41153* Properties of a set being a simple path of a fixed length as word. (Contributed by AV, 18-May-2021.)
(𝑊 ∈ (𝑁 WSPathsN 𝐺) → ((𝑁 ∈ ℕ0𝐺 ∈ V) ∧ 𝑊 ∈ (𝑁 WWalkSN 𝐺) ∧ ∃𝑓 𝑓(SPathS‘𝐺)𝑊))
 
Theoremwwlksnon 41154* The set of walks of a fixed length between two vertices as word. (Contributed by Alexander van der Vekens, 15-Feb-2018.) (Revised by AV, 11-May-2021.)
𝑉 = (Vtx‘𝐺)       ((𝑁 ∈ ℕ0𝐺𝑈) → (𝑁 WWalksNOn 𝐺) = (𝑎𝑉, 𝑏𝑉 ↦ {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ ((𝑤‘0) = 𝑎 ∧ (𝑤𝑁) = 𝑏)}))
 
Theoremwspthsnon 41155* 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, 11-May-2021.)
𝑉 = (Vtx‘𝐺)       ((𝑁 ∈ ℕ0𝐺𝑈) → (𝑁 WSPathsNOn 𝐺) = (𝑎𝑉, 𝑏𝑉 ↦ {𝑤 ∈ (𝑎(𝑁 WWalksNOn 𝐺)𝑏) ∣ ∃𝑓 𝑓(𝑎(SPathsOn‘𝐺)𝑏)𝑤}))
 
Theoremiswwlksnon 41156* The set of walks of a fixed length between two vertices as word. (Contributed by Alexander van der Vekens, 15-Feb-2018.) (Revised by AV, 12-May-2021.)
𝑉 = (Vtx‘𝐺)       ((𝐴𝑉𝐵𝑉) → (𝐴(𝑁 WWalksNOn 𝐺)𝐵) = {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ ((𝑤‘0) = 𝐴 ∧ (𝑤𝑁) = 𝐵)})
 
Theoremiswspthsnon 41157* 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.)
𝑉 = (Vtx‘𝐺)       ((𝐴𝑉𝐵𝑉) → (𝐴(𝑁 WSPathsNOn 𝐺)𝐵) = {𝑤 ∈ (𝐴(𝑁 WWalksNOn 𝐺)𝐵) ∣ ∃𝑓 𝑓(𝐴(SPathsOn‘𝐺)𝐵)𝑤})
 
Theoremwwlknon 41158 An element of the set of walks of a fixed length between two vertices as word. (Contributed by Alexander van der Vekens, 15-Feb-2018.) (Revised by AV, 12-May-2021.)
𝑉 = (Vtx‘𝐺)       ((𝐴𝑉𝐵𝑉) → (𝑊 ∈ (𝐴(𝑁 WWalksNOn 𝐺)𝐵) ↔ (𝑊 ∈ (𝑁 WWalkSN 𝐺) ∧ (𝑊‘0) = 𝐴 ∧ (𝑊𝑁) = 𝐵)))
 
Theoremwspthnon 41159* 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.)
𝑉 = (Vtx‘𝐺)       ((𝐴𝑉𝐵𝑉) → (𝑊 ∈ (𝐴(𝑁 WSPathsNOn 𝐺)𝐵) ↔ (𝑊 ∈ (𝐴(𝑁 WWalksNOn 𝐺)𝐵) ∧ ∃𝑓 𝑓(𝐴(SPathsOn‘𝐺)𝐵)𝑊)))
 
Theoremwspthnonp 41160* Properties of a set being a simple path of a fixed length between two vertices as word. (Contributed by AV, 14-May-2021.)
𝑉 = (Vtx‘𝐺)       (𝑊 ∈ (𝐴(𝑁 WSPathsNOn 𝐺)𝐵) → ((𝑁 ∈ ℕ0𝐺 ∈ V) ∧ (𝐴𝑉𝐵𝑉) ∧ (𝑊 ∈ (𝐴(𝑁 WWalksNOn 𝐺)𝐵) ∧ ∃𝑓 𝑓(𝐴(SPathsOn‘𝐺)𝐵)𝑊)))
 
Theoremwspthneq1eq2 41161 Two simple paths with identical sequences of vertices start and end at the same vertices. (Contributed by AV, 14-May-2021.)
((𝑃 ∈ (𝐴(𝑁 WSPathsNOn 𝐺)𝐵) ∧ 𝑃 ∈ (𝐶(𝑁 WSPathsNOn 𝐺)𝐷)) → (𝐴 = 𝐶𝐵 = 𝐷))
 
Theoremwwlksn0s 41162* The set of all walks as words of length 0 is the set of all words of length 1 over the vertices. (Contributed by Alexander van der Vekens, 22-Jul-2018.) (Revised by AV, 12-Apr-2021.)
(0 WWalkSN 𝐺) = {𝑤 ∈ Word (Vtx‘𝐺) ∣ (#‘𝑤) = 1}
 
Theoremwwlkssswrd 41163 Walks (represented by words) are words. (Contributed by Alexander van der Vekens, 17-Jul-2018.) (Revised by AV, 9-Apr-2021.)
𝑉 = (Vtx‘𝐺)       (WWalkS‘𝐺) ⊆ Word 𝑉
 
Theoremwwlksn0 41164* A walk of length 0 is represented by a singleton word. (Contributed by Alexander van der Vekens, 20-Jul-2018.) (Revised by AV, 9-Apr-2021.) (Proof shortened by AV, 21-May-2021.)
𝑉 = (Vtx‘𝐺)       (𝑊 ∈ (0 WWalkSN 𝐺) → ∃𝑣𝑉 𝑊 = ⟨“𝑣”⟩)
 
Theorem0enwwlksnge1 41165 In graphs without edges, there are no walks of length greater than 0. (Contributed by Alexander van der Vekens, 26-Jul-2018.) (Revised by AV, 7-May-2021.)
(((Edg‘𝐺) = ∅ ∧ 𝑁 ∈ ℕ) → (𝑁 WWalkSN 𝐺) = ∅)
 
Theoremwwlkswwlksn 41166 A walk of a fixed length as word is a walk (in an undirected graph) as word. (Contributed by Alexander van der Vekens, 17-Jul-2018.) (Revised by AV, 12-Apr-2021.)
(𝑊 ∈ (𝑁 WWalkSN 𝐺) → 𝑊 ∈ (WWalkS‘𝐺))
 
Theoremwwlkssswwlksn 41167 The walks of a fixed length as words are walks (in an undirected graph) as words. (Contributed by Alexander van der Vekens, 17-Jul-2018.) (Revised by AV, 12-Apr-2021.)
(𝑁 WWalkSN 𝐺) ⊆ (WWalkS‘𝐺)
 
Theoremwwlknbp2 41168 Other basic properties of a set being a walk of length n (represented by a word). (Contributed by Alexander van der Vekens, 3-Oct-2018.) (Revised by AV, 12-Apr-2021.)
(𝑊 ∈ (𝑁 WWalkSN 𝐺) → (𝑊 ∈ Word (Vtx‘𝐺) ∧ (#‘𝑊) = (𝑁 + 1)))
 
Theorem1wlkiswwlks1 41169 The sequence of vertices in a walk is a walk as word in a pseudograph. (Contributed by Alexander van der Vekens, 20-Jul-2018.) (Revised by AV, 9-Apr-2021.)
(𝐺 ∈ UPGraph → (𝐹(1Walks‘𝐺)𝑃𝑃 ∈ (WWalkS‘𝐺)))
 
Theorem1wlklnwwlkln1 41170 The sequence of vertices in a walk of length 𝑁 is a walk as word of length 𝑁 in a pseudograph. (Contributed by Alexander van der Vekens, 21-Jul-2018.) (Revised by AV, 12-Apr-2021.)
(𝐺 ∈ UPGraph → ((𝐹(1Walks‘𝐺)𝑃 ∧ (#‘𝐹) = 𝑁) → 𝑃 ∈ (𝑁 WWalkSN 𝐺)))
 
Theorem1wlkiswwlks2lem1 41171* Lemma 1 for 1wlkiswwlks2 41177. (Contributed by Alexander van der Vekens, 20-Jul-2018.)
𝐹 = (𝑥 ∈ (0..^((#‘𝑃) − 1)) ↦ (𝐸‘{(𝑃𝑥), (𝑃‘(𝑥 + 1))}))       ((𝑃 ∈ Word 𝑉 ∧ 1 ≤ (#‘𝑃)) → (#‘𝐹) = ((#‘𝑃) − 1))
 
Theorem1wlkiswwlks2lem2 41172* Lemma 2 for 1wlkiswwlks2 41177. (Contributed by Alexander van der Vekens, 20-Jul-2018.)
𝐹 = (𝑥 ∈ (0..^((#‘𝑃) − 1)) ↦ (𝐸‘{(𝑃𝑥), (𝑃‘(𝑥 + 1))}))       (((#‘𝑃) ∈ ℕ0𝐼 ∈ (0..^((#‘𝑃) − 1))) → (𝐹𝐼) = (𝐸‘{(𝑃𝐼), (𝑃‘(𝐼 + 1))}))
 
Theorem1wlkiswwlks2lem3 41173* Lemma 3 for 1wlkiswwlks2 41177. (Contributed by Alexander van der Vekens, 20-Jul-2018.)
𝐹 = (𝑥 ∈ (0..^((#‘𝑃) − 1)) ↦ (𝐸‘{(𝑃𝑥), (𝑃‘(𝑥 + 1))}))       ((𝑃 ∈ Word 𝑉 ∧ 1 ≤ (#‘𝑃)) → 𝑃:(0...(#‘𝐹))⟶𝑉)
 
Theorem1wlkiswwlks2lem4 41174* Lemma 4 for 1wlkiswwlks2 41177. (Contributed by Alexander van der Vekens, 20-Jul-2018.) (Revised by AV, 10-Apr-2021.)
𝐹 = (𝑥 ∈ (0..^((#‘𝑃) − 1)) ↦ (𝐸‘{(𝑃𝑥), (𝑃‘(𝑥 + 1))}))    &   𝐸 = (iEdg‘𝐺)       ((𝐺 ∈ USPGraph ∧ 𝑃 ∈ Word 𝑉 ∧ 1 ≤ (#‘𝑃)) → (∀𝑖 ∈ (0..^((#‘𝑃) − 1)){(𝑃𝑖), (𝑃‘(𝑖 + 1))} ∈ ran 𝐸 → ∀𝑖 ∈ (0..^(#‘𝐹))(𝐸‘(𝐹𝑖)) = {(𝑃𝑖), (𝑃‘(𝑖 + 1))}))
 
Theorem1wlkiswwlks2lem5 41175* Lemma 5 for 1wlkiswwlks2 41177. (Contributed by Alexander van der Vekens, 21-Jul-2018.) (Revised by AV, 10-Apr-2021.)
𝐹 = (𝑥 ∈ (0..^((#‘𝑃) − 1)) ↦ (𝐸‘{(𝑃𝑥), (𝑃‘(𝑥 + 1))}))    &   𝐸 = (iEdg‘𝐺)       ((𝐺 ∈ USPGraph ∧ 𝑃 ∈ Word 𝑉 ∧ 1 ≤ (#‘𝑃)) → (∀𝑖 ∈ (0..^((#‘𝑃) − 1)){(𝑃𝑖), (𝑃‘(𝑖 + 1))} ∈ ran 𝐸𝐹 ∈ Word dom 𝐸))
 
Theorem1wlkiswwlks2lem6 41176* Lemma 6 for 1wlkiswwlks2 41177. (Contributed by Alexander van der Vekens, 21-Jul-2018.) (Revised by AV, 10-Apr-2021.)
𝐹 = (𝑥 ∈ (0..^((#‘𝑃) − 1)) ↦ (𝐸‘{(𝑃𝑥), (𝑃‘(𝑥 + 1))}))    &   𝐸 = (iEdg‘𝐺)       ((𝐺 ∈ USPGraph ∧ 𝑃 ∈ Word 𝑉 ∧ 1 ≤ (#‘𝑃)) → (∀𝑖 ∈ (0..^((#‘𝑃) − 1)){(𝑃𝑖), (𝑃‘(𝑖 + 1))} ∈ ran 𝐸 → (𝐹 ∈ Word dom 𝐸𝑃:(0...(#‘𝐹))⟶𝑉 ∧ ∀𝑖 ∈ (0..^(#‘𝐹))(𝐸‘(𝐹𝑖)) = {(𝑃𝑖), (𝑃‘(𝑖 + 1))})))
 
Theorem1wlkiswwlks2 41177* A walk as word corresponds to the sequence of vertices in a walk in a simple pseudograph. (Contributed by Alexander van der Vekens, 21-Jul-2018.) (Revised by AV, 10-Apr-2021.)
(𝐺 ∈ USPGraph → (𝑃 ∈ (WWalkS‘𝐺) → ∃𝑓 𝑓(1Walks‘𝐺)𝑃))
 
Theorem1wlkiswwlks 41178* A walk as word corresponds to a walk in a simple pseudograph. (Contributed by Alexander van der Vekens, 21-Jul-2018.) (Revised by AV, 10-Apr-2021.)
(𝐺 ∈ USPGraph → (∃𝑓 𝑓(1Walks‘𝐺)𝑃𝑃 ∈ (WWalkS‘𝐺)))
 
Theorem1wlkiswwlksupgr2 41179* A walk as word corresponds to the sequence of vertices in a walk in a pseudograph. This variant of 1wlkiswwlks2 41177 does not require 𝐺 to be a simple pseudograph, but it requires the Axiom of Choice (ac6 9061) for its proof. Notice that only the existence of a function 𝑓 can be proven, but, in general, it cannot be "constructed" (as in 1wlkiswwlks2 41177). (Contributed by Alexander van der Vekens, 21-Jul-2018.) (Revised by AV, 10-Apr-2021.)
(𝐺 ∈ UPGraph → (𝑃 ∈ (WWalkS‘𝐺) → ∃𝑓 𝑓(1Walks‘𝐺)𝑃))
 
Theorem1wlkiswwlkupgr 41180* A walk as word corresponds to a walk in a pseudograph. This variant of 1wlkiswwlks 41178 does not require 𝐺 to be a simple pseudograph, but it requires (indirectly) the Axiom of Choice for its proof. (Contributed by Alexander van der Vekens, 21-Jul-2018.) (Revised by AV, 10-Apr-2021.)
(𝐺 ∈ UPGraph → (∃𝑓 𝑓(1Walks‘𝐺)𝑃𝑃 ∈ (WWalkS‘𝐺)))
 
Theorem1wlkpwwlkf1ouspgr 41181* The mapping of (ordinary) walks to their sequences of vertices is a bijection in a simple pseudograph. (Contributed by AV, 6-May-2021.)
𝐹 = (𝑤 ∈ (1Walks‘𝐺) ↦ (2nd𝑤))       (𝐺 ∈ USPGraph → 𝐹:(1Walks‘𝐺)–1-1-onto→(WWalkS‘𝐺))
 
Theorem1wlkisowwlkupgr 41182* The set of walks as words and the set of (ordinary) walks are isomorphic in a simple pseudograph. (Contributed by AV, 6-May-2021.)
(𝐺 ∈ USPGraph → ∃𝑓 𝑓:(1Walks‘𝐺)–1-1-onto→(WWalkS‘𝐺))
 
Theoremwwlksm1edg 41183 Removing the trailing edge from a walk (as word) with at least one edge results in a walk. (Contributed by Alexander van der Vekens, 1-Aug-2018.) (Revised by AV, 19-Apr-2021.)
((𝑊 ∈ (WWalkS‘𝐺) ∧ 2 ≤ (#‘𝑊)) → (𝑊 substr ⟨0, ((#‘𝑊) − 1)⟩) ∈ (WWalkS‘𝐺))
 
Theorem1wlklnwwlkln2lem 41184* Lemma for 1wlklnwwlkln2 41185 and 1wlklnwwlklnupgr2 41187. Formerly part of proof for 1wlklnwwlkln2 41185. (Contributed by Alexander van der Vekens, 21-Jul-2018.) (Revised by AV, 12-Apr-2021.)
(𝜑 → (𝑃 ∈ (WWalkS‘𝐺) → ∃𝑓 𝑓(1Walks‘𝐺)𝑃))       (𝜑 → (𝑃 ∈ (𝑁 WWalkSN 𝐺) → ∃𝑓(𝑓(1Walks‘𝐺)𝑃 ∧ (#‘𝑓) = 𝑁)))
 
Theorem1wlklnwwlkln2 41185* A walk of length 𝑁 as word corresponds to the sequence of vertices in a walk of length 𝑁 in a simple pseudograph. (Contributed by Alexander van der Vekens, 21-Jul-2018.) (Revised by AV, 12-Apr-2021.)
(𝐺 ∈ USPGraph → (𝑃 ∈ (𝑁 WWalkSN 𝐺) → ∃𝑓(𝑓(1Walks‘𝐺)𝑃 ∧ (#‘𝑓) = 𝑁)))
 
Theorem1wlklnwwlkn 41186* A walk of length 𝑁 as word corresponds to a walk with length 𝑁 in a simple pseudograph. (Contributed by Alexander van der Vekens, 21-Jul-2018.) (Revised by AV, 12-Apr-2021.)
(𝐺 ∈ USPGraph → (∃𝑓(𝑓(1Walks‘𝐺)𝑃 ∧ (#‘𝑓) = 𝑁) ↔ 𝑃 ∈ (𝑁 WWalkSN 𝐺)))
 
Theorem1wlklnwwlklnupgr2 41187* A walk of length 𝑁 as word corresponds to the sequence of vertices in a walk of length 𝑁 in a pseudograph. This variant of 1wlklnwwlkln2 41185 does not require 𝐺 to be a simple pseudograph, but it requires (indirectly) the Axiom of Choice. (Contributed by Alexander van der Vekens, 21-Jul-2018.) (Revised by AV, 12-Apr-2021.)
(𝐺 ∈ UPGraph → (𝑃 ∈ (𝑁 WWalkSN 𝐺) → ∃𝑓(𝑓(1Walks‘𝐺)𝑃 ∧ (#‘𝑓) = 𝑁)))
 
Theorem1wlklnwwlknupgr 41188* A walk of length 𝑁 as word corresponds to a walk with length 𝑁 in a pseudograph. This variant of 1wlkiswwlks 40197 does not require 𝐺 to be a simple pseudograph, but it requires (indirectly) the Axiom of Choice for its proof. (Contributed by Alexander van der Vekens, 21-Jul-2018.) (Revised by AV, 12-Apr-2021.)
(𝐺 ∈ UPGraph → (∃𝑓(𝑓(1Walks‘𝐺)𝑃 ∧ (#‘𝑓) = 𝑁) ↔ 𝑃 ∈ (𝑁 WWalkSN 𝐺)))
 
Theoremwlknewwlksn 41189 If a walk in a pseudograph has length 𝑁, then the sequence of the vertices of the walk is a word representing the walk as word of length 𝑁. (Contributed by Alexander van der Vekens, 25-Aug-2018.) (Revised by AV, 11-Apr-2021.)
(((𝐺 ∈ UPGraph ∧ 𝑊 ∈ (1Walks‘𝐺)) ∧ (𝑁 ∈ ℕ0 ∧ (#‘(1st𝑊)) = 𝑁)) → (2nd𝑊) ∈ (𝑁 WWalkSN 𝐺))
 
Theoremwlknwwlksnfun 41190* Lemma 1 for wlknwwlksnbij2 41194. (Contributed by Alexander van der Vekens, 25-Aug-2018.) (Revised by AV, 14-Apr-2021.)
𝑇 = {𝑝 ∈ (1Walks‘𝐺) ∣ (#‘(1st𝑝)) = 𝑁}    &   𝑊 = (𝑁 WWalkSN 𝐺)    &   𝐹 = (𝑡𝑇 ↦ (2nd𝑡))       ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ ℕ0) → 𝐹:𝑇𝑊)
 
Theoremwlknwwlksninj 41191* Lemma 2 for wlknwwlksnbij2 41194. (Contributed by Alexander van der Vekens, 25-Aug-2018.) (Revised by AV, 14-Apr-2021.)
𝑇 = {𝑝 ∈ (1Walks‘𝐺) ∣ (#‘(1st𝑝)) = 𝑁}    &   𝑊 = (𝑁 WWalkSN 𝐺)    &   𝐹 = (𝑡𝑇 ↦ (2nd𝑡))       ((𝐺 ∈ USPGraph ∧ 𝑁 ∈ ℕ0) → 𝐹:𝑇1-1𝑊)
 
Theoremwlknwwlksnsur 41192* Lemma 3 for wlknwwlksnbij2 41194. (Contributed by Alexander van der Vekens, 25-Aug-2018.) (Revised by AV, 14-Apr-2021.)
𝑇 = {𝑝 ∈ (1Walks‘𝐺) ∣ (#‘(1st𝑝)) = 𝑁}    &   𝑊 = (𝑁 WWalkSN 𝐺)    &   𝐹 = (𝑡𝑇 ↦ (2nd𝑡))       ((𝐺 ∈ USPGraph ∧ 𝑁 ∈ ℕ0) → 𝐹:𝑇onto𝑊)
 
Theoremwlknwwlksnbij 41193* Lemma 4 for wlknwwlksnbij2 41194. (Contributed by Alexander van der Vekens, 25-Aug-2018.) (Revised by AV, 14-Apr-2021.)
𝑇 = {𝑝 ∈ (1Walks‘𝐺) ∣ (#‘(1st𝑝)) = 𝑁}    &   𝑊 = (𝑁 WWalkSN 𝐺)    &   𝐹 = (𝑡𝑇 ↦ (2nd𝑡))       ((𝐺 ∈ USPGraph ∧ 𝑁 ∈ ℕ0) → 𝐹:𝑇1-1-onto𝑊)
 
Theoremwlknwwlksnbij2 41194* There is a bijection between the set of walks of a fixed length and the set of walks represented by words of the same length in a simple pseudograph. (Contributed by Alexander van der Vekens, 25-Aug-2018.) (Revised by AV, 15-Apr-2021.)
((𝐺 ∈ USPGraph ∧ 𝑁 ∈ ℕ0) → ∃𝑓 𝑓:{𝑝 ∈ (1Walks‘𝐺) ∣ (#‘(1st𝑝)) = 𝑁}–1-1-onto→(𝑁 WWalkSN 𝐺))
 
Theoremwlknwwlksnen 41195* In a simple pseudograph, the set of walks of a fixed length and the set of walks represented by words are equinumerous. (Contributed by Alexander van der Vekens, 25-Aug-2018.) (Revised by AV, 15-Apr-2021.)
((𝐺 ∈ USPGraph ∧ 𝑁 ∈ ℕ0) → {𝑝 ∈ (1Walks‘𝐺) ∣ (#‘(1st𝑝)) = 𝑁} ≈ (𝑁 WWalkSN 𝐺))
 
Theoremwlknwwlksneqs 41196* The set of walks of a fixed length and the set of walks represented by words have the same size. (Contributed by Alexander van der Vekens, 25-Aug-2018.) (Revised by AV, 15-Apr-2021.)
((𝐺 ∈ USPGraph ∧ 𝑁 ∈ ℕ0) → (#‘{𝑝 ∈ (1Walks‘𝐺) ∣ (#‘(1st𝑝)) = 𝑁}) = (#‘(𝑁 WWalkSN 𝐺)))
 
Theoremwlkwwlkfun 41197* Lemma 1 for wlkwwlkbij2 41201. (Contributed by Alexander van der Vekens, 22-Jul-2018.) (Proof shortened by Alexander van der Vekens, 25-Aug-2018.) (Revised by AV, 15-Apr-2021.)
𝑇 = {𝑝 ∈ (1Walks‘𝐺) ∣ ((#‘(1st𝑝)) = 𝑁 ∧ ((2nd𝑝)‘0) = 𝑃)}    &   𝑊 = {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}    &   𝐹 = (𝑡𝑇 ↦ (2nd𝑡))       ((𝐺 ∈ UPGraph ∧ 𝑃𝑉𝑁 ∈ ℕ0) → 𝐹:𝑇𝑊)
 
Theoremwlkwwlkinj 41198* Lemma 2 for wlkwwlkbij2 41201. (Contributed by Alexander van der Vekens, 23-Jul-2018.) (Proof shortened by Alexander van der Vekens, 25-Aug-2018.) (Revised by AV, 16-Apr-2021.)
𝑇 = {𝑝 ∈ (1Walks‘𝐺) ∣ ((#‘(1st𝑝)) = 𝑁 ∧ ((2nd𝑝)‘0) = 𝑃)}    &   𝑊 = {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}    &   𝐹 = (𝑡𝑇 ↦ (2nd𝑡))       ((𝐺 ∈ USPGraph ∧ 𝑃𝑉𝑁 ∈ ℕ0) → 𝐹:𝑇1-1𝑊)
 
Theoremwlkwwlksur 41199* Lemma 3 for wlkwwlkbij2 41201. (Contributed by Alexander van der Vekens, 23-Jul-2018.) (Revised by AV, 16-Apr-2021.)
𝑇 = {𝑝 ∈ (1Walks‘𝐺) ∣ ((#‘(1st𝑝)) = 𝑁 ∧ ((2nd𝑝)‘0) = 𝑃)}    &   𝑊 = {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}    &   𝐹 = (𝑡𝑇 ↦ (2nd𝑡))       ((𝐺 ∈ USPGraph ∧ 𝑃𝑉𝑁 ∈ ℕ0) → 𝐹:𝑇onto𝑊)
 
Theoremwlkwwlkbij 41200* Lemma 4 for wlkwwlkbij2 41201. (Contributed by Alexander van der Vekens, 22-Jul-2018.) (Revised by AV, 16-Apr-2021.)
𝑇 = {𝑝 ∈ (1Walks‘𝐺) ∣ ((#‘(1st𝑝)) = 𝑁 ∧ ((2nd𝑝)‘0) = 𝑃)}    &   𝑊 = {𝑤 ∈ (𝑁 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}    &   𝐹 = (𝑡𝑇 ↦ (2nd𝑡))       ((𝐺 ∈ USPGraph ∧ 𝑃𝑉𝑁 ∈ ℕ0) → 𝐹:𝑇1-1-onto𝑊)
    < Previous  Next >

Page List
Jump to page: Contents  1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700 8 701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7400 75 7401-7500 76 7501-7600 77 7601-7700 78 7701-7800 79 7801-7900 80 7901-8000 81 8001-8100 82 8101-8200 83 8201-8300 84 8301-8400 85 8401-8500 86 8501-8600 87 8601-8700 88 8701-8800 89 8801-8900 90 8901-9000 91 9001-9100 92 9101-9200 93 9201-9300 94 9301-9400 95 9401-9500 96 9501-9600 97 9601-9700 98 9701-9800 99 9801-9900 100 9901-10000 101 10001-10100 102 10101-10200 103 10201-10300 104 10301-10400 105 10401-10500 106 10501-10600 107 10601-10700 108 10701-10800 109 10801-10900 110 10901-11000 111 11001-11100 112 11101-11200 113 11201-11300 114 11301-11400 115 11401-11500 116 11501-11600 117 11601-11700 118 11701-11800 119 11801-11900 120 11901-12000 121 12001-12100 122 12101-12200 123 12201-12300 124 12301-12400 125 12401-12500 126 12501-12600 127 12601-12700 128 12701-12800 129 12801-12900 130 12901-13000 131 13001-13100 132 13101-13200 133 13201-13300 134 13301-13400 135 13401-13500 136 13501-13600 137 13601-13700 138 13701-13800 139 13801-13900 140 13901-14000 141 14001-14100 142 14101-14200 143 14201-14300 144 14301-14400 145 14401-14500 146 14501-14600 147 14601-14700 148 14701-14800 149 14801-14900 150 14901-15000 151 15001-15100 152 15101-15200 153 15201-15300 154 15301-15400 155 15401-15500 156 15501-15600 157 15601-15700 158 15701-15800 159 15801-15900 160 15901-16000 161 16001-16100 162 16101-16200 163 16201-16300 164 16301-16400 165 16401-16500 166 16501-16600 167 16601-16700 168 16701-16800 169 16801-16900 170 16901-17000 171 17001-17100 172 17101-17200 173 17201-17300 174 17301-17400 175 17401-17500 176 17501-17600 177 17601-17700 178 17701-17800 179 17801-17900 180 17901-18000 181 18001-18100 182 18101-18200 183 18201-18300 184 18301-18400 185 18401-18500 186 18501-18600 187 18601-18700 188 18701-18800 189 18801-18900 190 18901-19000 191 19001-19100 192 19101-19200 193 19201-19300 194 19301-19400 195 19401-19500 196 19501-19600 197 19601-19700 198 19701-19800 199 19801-19900 200 19901-20000 201 20001-20100 202 20101-20200 203 20201-20300 204 20301-20400 205 20401-20500 206 20501-20600 207 20601-20700 208 20701-20800 209 20801-20900 210 20901-21000 211 21001-21100 212 21101-21200 213 21201-21300 214 21301-21400 215 21401-21500 216 21501-21600 217 21601-21700 218 21701-21800 219 21801-21900 220 21901-22000 221 22001-22100 222 22101-22200 223 22201-22300 224 22301-22400 225 22401-22500 226 22501-22600 227 22601-22700 228 22701-22800 229 22801-22900 230 22901-23000 231 23001-23100 232 23101-23200 233 23201-23300 234 23301-23400 235 23401-23500 236 23501-23600 237 23601-23700 238 23701-23800 239 23801-23900 240 23901-24000 241 24001-24100 242 24101-24200 243 24201-24300 244 24301-24400 245 24401-24500 246 24501-24600 247 24601-24700 248 24701-24800 249 24801-24900 250 24901-25000 251 25001-25100 252 25101-25200 253 25201-25300 254 25301-25400 255 25401-25500 256 25501-25600 257 25601-25700 258 25701-25800 259 25801-25900 260 25901-26000 261 26001-26100 262 26101-26200 263 26201-26300 264 26301-26400 265 26401-26500 266 26501-26600 267 26601-26700 268 26701-26800 269 26801-26900 270 26901-27000 271 27001-27100 272 27101-27200 273 27201-27300 274 27301-27400 275 27401-27500 276 27501-27600 277 27601-27700 278 27701-27800 279 27801-27900 280 27901-28000 281 28001-28100 282 28101-28200 283 28201-28300 284 28301-28400 285 28401-28500 286 28501-28600 287 28601-28700 288 28701-28800 289 28801-28900 290 28901-29000 291 29001-29100 292 29101-29200 293 29201-29300 294 29301-29400 295 29401-29500 296 29501-29600 297 29601-29700 298 29701-29800 299 29801-29900 300 29901-30000 301 30001-30100 302 30101-30200 303 30201-30300 304 30301-30400 305 30401-30500 306 30501-30600 307 30601-30700 308 30701-30800 309 30801-30900 310 30901-31000 311 31001-31100 312 31101-31200 313 31201-31300 314 31301-31400 315 31401-31500 316 31501-31600 317 31601-31700 318 31701-31800 319 31801-31900 320 31901-32000 321 32001-32100 322 32101-32200 323 32201-32300 324 32301-32400 325 32401-32500 326 32501-32600 327 32601-32700 328 32701-32800 329 32801-32900 330 32901-33000 331 33001-33100 332 33101-33200 333 33201-33300 334 33301-33400 335 33401-33500 336 33501-33600 337 33601-33700 338 33701-33800 339 33801-33900 340 33901-34000 341 34001-34100 342 34101-34200 343 34201-34300 344 34301-34400 345 34401-34500 346 34501-34600 347 34601-34700 348 34701-34800 349 34801-34900 350 34901-35000 351 35001-35100 352 35101-35200 353 35201-35300 354 35301-35400 355 35401-35500 356 35501-35600 357 35601-35700 358 35701-35800 359 35801-35900 360 35901-36000 361 36001-36100 362 36101-36200 363 36201-36300 364 36301-36400 365 36401-36500 366 36501-36600 367 36601-36700 368 36701-36800 369 36801-36900 370 36901-37000 371 37001-37100 372 37101-37200 373 37201-37300 374 37301-37400 375 37401-37500 376 37501-37600 377 37601-37700 378 37701-37800 379 37801-37900 380 37901-38000 381 38001-38100 382 38101-38200 383 38201-38300 384 38301-38400 385 38401-38500 386 38501-38600 387 38601-38700 388 38701-38800 389 38801-38900 390 38901-39000 391 39001-39100 392 39101-39200 393 39201-39300 394 39301-39400 395 39401-39500 396 39501-39600 397 39601-39700 398 39701-39800 399 39801-39900 400 39901-40000 401 40001-40100 402 40101-40200 403 40201-40300 404 40301-40400 405 40401-40500 406 40501-40600 407 40601-40700 408 40701-40800 409 40801-40900 410 40901-41000 411 41001-41100 412 41101-41200 413 41201-41300 414 41301-41400 415 41401-41500 416 41501-41600 417 41601-41700 418 41701-41800 419 41801-41900 420 41901-42000 421 42001-42100 422 42101-42200 423 42201-42300 424 42301-42400 425 42401-42426
  Copyright terms: Public domain < Previous  Next >