HomeHome Metamath Proof Explorer
Theorem List (p. 260 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 - 25901-26000   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremfargshiftfv 25901* If a class is a function, then the values of the "shifted function" correspond to the function values of the class. (Contributed by Alexander van der Vekens, 23-Nov-2017.)
𝐺 = (𝑥 ∈ (0..^(#‘𝐹)) ↦ (𝐹‘(𝑥 + 1)))       ((𝑁 ∈ ℕ0𝐹:(1...𝑁)⟶dom 𝐸) → (𝑋 ∈ (0..^𝑁) → (𝐺𝑋) = (𝐹‘(𝑋 + 1))))
 
Theoremfargshiftf 25902* If a class is a function, then also its "shifted function" is a function. (Contributed by Alexander van der Vekens, 23-Nov-2017.)
𝐺 = (𝑥 ∈ (0..^(#‘𝐹)) ↦ (𝐹‘(𝑥 + 1)))       ((𝑁 ∈ ℕ0𝐹:(1...𝑁)⟶dom 𝐸) → 𝐺:(0..^(#‘𝐹))⟶dom 𝐸)
 
Theoremfargshiftf1 25903* If a function is 1-1, then also the shifted function is 1-1. (Contributed by Alexander van der Vekens, 23-Nov-2017.)
𝐺 = (𝑥 ∈ (0..^(#‘𝐹)) ↦ (𝐹‘(𝑥 + 1)))       ((𝑁 ∈ ℕ0𝐹:(1...𝑁)–1-1→dom 𝐸) → 𝐺:(0..^(#‘𝐹))–1-1→dom 𝐸)
 
Theoremfargshiftfo 25904* If a function is onto, then also the shifted function is onto. (Contributed by Alexander van der Vekens, 24-Nov-2017.)
𝐺 = (𝑥 ∈ (0..^(#‘𝐹)) ↦ (𝐹‘(𝑥 + 1)))       ((𝑁 ∈ ℕ0𝐹:(1...𝑁)–onto→dom 𝐸) → 𝐺:(0..^(#‘𝐹))–onto→dom 𝐸)
 
Theoremfargshiftfva 25905* The values of a shifted function correspond to the value of the original function. (Contributed by Alexander van der Vekens, 24-Nov-2017.)
𝐺 = (𝑥 ∈ (0..^(#‘𝐹)) ↦ (𝐹‘(𝑥 + 1)))       ((𝑁 ∈ ℕ0𝐹:(1...𝑁)⟶dom 𝐸) → (∀𝑘 ∈ (1...𝑁)(𝐸‘(𝐹𝑘)) = 𝑘 / 𝑥𝑃 → ∀𝑙 ∈ (0..^𝑁)(𝐸‘(𝐺𝑙)) = (𝑙 + 1) / 𝑥𝑃))
 
Theoremusgrcyclnl1 25906 In an undirected simple graph (with no loops!) there are no cycles with length 1 (consisting of one edge ). (Contributed by Alexander van der Vekens, 7-Nov-2017.)
((𝑉 USGrph 𝐸𝐹(𝑉 Cycles 𝐸)𝑃) → (#‘𝐹) ≠ 1)
 
Theoremusgrcyclnl2 25907 In an undirected simple graph (with no loops!) there are no cycles with length 2 (consisting of two edges ). (Contributed by Alexander van der Vekens, 9-Nov-2017.)
((𝑉 USGrph 𝐸𝐹(𝑉 Cycles 𝐸)𝑃) → (#‘𝐹) ≠ 2)
 
Theorem3cycl3dv 25908 In a simple graph, the vertices of a 3-cycle are mutually different. (Contributed by Alexander van der Vekens, 11-Nov-2017.)
((𝑉 USGrph 𝐸 ∧ ({𝐴, 𝐵} ∈ ran 𝐸 ∧ {𝐵, 𝐶} ∈ ran 𝐸 ∧ {𝐶, 𝐴} ∈ ran 𝐸)) → (𝐴𝐵𝐵𝐶𝐶𝐴))
 
Theoremnvnencycllem 25909 Lemma for 3v3e3cycl1 25910 and 4cycl4v4e 25932. (Contributed by Alexander van der Vekens, 9-Nov-2017.)
(((Fun 𝐸𝐹 ∈ Word dom 𝐸) ∧ (𝑋 ∈ ℕ0𝑋 < (#‘𝐹))) → ((𝐸‘(𝐹𝑋)) = {𝐴, 𝐵} → {𝐴, 𝐵} ∈ ran 𝐸))
 
Theorem3v3e3cycl1 25910* If there is a cycle of length 3 in a graph, there are three (different) vertices in the graph which are mutually connected by edges. (Contributed by Alexander van der Vekens, 9-Nov-2017.)
((Fun 𝐸𝐹(𝑉 Cycles 𝐸)𝑃 ∧ (#‘𝐹) = 3) → ∃𝑎𝑉𝑏𝑉𝑐𝑉 ({𝑎, 𝑏} ∈ ran 𝐸 ∧ {𝑏, 𝑐} ∈ ran 𝐸 ∧ {𝑐, 𝑎} ∈ ran 𝐸))
 
Theoremconstr3lem1 25911 Lemma for constr3trl 25925 etc. (Contributed by Alexander van der Vekens, 10-Nov-2017.)
𝐹 = {⟨0, (𝐸‘{𝐴, 𝐵})⟩, ⟨1, (𝐸‘{𝐵, 𝐶})⟩, ⟨2, (𝐸‘{𝐶, 𝐴})⟩}    &   𝑃 = ({⟨0, 𝐴⟩, ⟨1, 𝐵⟩} ∪ {⟨2, 𝐶⟩, ⟨3, 𝐴⟩})       (𝐹 ∈ V ∧ 𝑃 ∈ V)
 
Theoremconstr3lem2 25912 Lemma for constr3trl 25925 etc. (Contributed by Alexander van der Vekens, 10-Nov-2017.)
𝐹 = {⟨0, (𝐸‘{𝐴, 𝐵})⟩, ⟨1, (𝐸‘{𝐵, 𝐶})⟩, ⟨2, (𝐸‘{𝐶, 𝐴})⟩}    &   𝑃 = ({⟨0, 𝐴⟩, ⟨1, 𝐵⟩} ∪ {⟨2, 𝐶⟩, ⟨3, 𝐴⟩})       (#‘𝐹) = 3
 
Theoremconstr3lem4 25913 Lemma for constr3trl 25925 etc. (Contributed by Alexander van der Vekens, 10-Nov-2017.) (Proof shortened by Alexander van der Vekens, 16-Dec-2017.)
𝐹 = {⟨0, (𝐸‘{𝐴, 𝐵})⟩, ⟨1, (𝐸‘{𝐵, 𝐶})⟩, ⟨2, (𝐸‘{𝐶, 𝐴})⟩}    &   𝑃 = ({⟨0, 𝐴⟩, ⟨1, 𝐵⟩} ∪ {⟨2, 𝐶⟩, ⟨3, 𝐴⟩})       ((𝐴𝑉𝐵𝑉𝐶𝑉) → (((𝑃‘0) = 𝐴 ∧ (𝑃‘1) = 𝐵) ∧ ((𝑃‘2) = 𝐶 ∧ (𝑃‘3) = 𝐴)))
 
Theoremconstr3lem5 25914 Lemma for constr3trl 25925 etc. (Contributed by Alexander van der Vekens, 12-Nov-2017.)
𝐹 = {⟨0, (𝐸‘{𝐴, 𝐵})⟩, ⟨1, (𝐸‘{𝐵, 𝐶})⟩, ⟨2, (𝐸‘{𝐶, 𝐴})⟩}    &   𝑃 = ({⟨0, 𝐴⟩, ⟨1, 𝐵⟩} ∪ {⟨2, 𝐶⟩, ⟨3, 𝐴⟩})       ((𝐹‘0) = (𝐸‘{𝐴, 𝐵}) ∧ (𝐹‘1) = (𝐸‘{𝐵, 𝐶}) ∧ (𝐹‘2) = (𝐸‘{𝐶, 𝐴}))
 
Theoremconstr3lem6 25915 Lemma for constr3pthlem3 25923. (Contributed by Alexander van der Vekens, 11-Nov-2017.)
𝐹 = {⟨0, (𝐸‘{𝐴, 𝐵})⟩, ⟨1, (𝐸‘{𝐵, 𝐶})⟩, ⟨2, (𝐸‘{𝐶, 𝐴})⟩}    &   𝑃 = ({⟨0, 𝐴⟩, ⟨1, 𝐵⟩} ∪ {⟨2, 𝐶⟩, ⟨3, 𝐴⟩})       (((𝐴𝑉𝐵𝑉𝐶𝑉) ∧ (𝐴𝐵𝐵𝐶𝐶𝐴)) → ({(𝑃‘0), (𝑃‘3)} ∩ {(𝑃‘1), (𝑃‘2)}) = ∅)
 
Theoremconstr3trllem1 25916 Lemma for constr3trl 25925. (Contributed by Alexander van der Vekens, 10-Nov-2017.)
𝐹 = {⟨0, (𝐸‘{𝐴, 𝐵})⟩, ⟨1, (𝐸‘{𝐵, 𝐶})⟩, ⟨2, (𝐸‘{𝐶, 𝐴})⟩}    &   𝑃 = ({⟨0, 𝐴⟩, ⟨1, 𝐵⟩} ∪ {⟨2, 𝐶⟩, ⟨3, 𝐴⟩})       ((𝑉 USGrph 𝐸 ∧ ({𝐴, 𝐵} ∈ ran 𝐸 ∧ {𝐵, 𝐶} ∈ ran 𝐸 ∧ {𝐶, 𝐴} ∈ ran 𝐸)) → 𝐹 ∈ Word dom 𝐸)
 
Theoremconstr3trllem2 25917 Lemma for constr3trl 25925. (Contributed by Alexander van der Vekens, 12-Nov-2017.)
𝐹 = {⟨0, (𝐸‘{𝐴, 𝐵})⟩, ⟨1, (𝐸‘{𝐵, 𝐶})⟩, ⟨2, (𝐸‘{𝐶, 𝐴})⟩}    &   𝑃 = ({⟨0, 𝐴⟩, ⟨1, 𝐵⟩} ∪ {⟨2, 𝐶⟩, ⟨3, 𝐴⟩})       ((𝑉 USGrph 𝐸 ∧ ({𝐴, 𝐵} ∈ ran 𝐸 ∧ {𝐵, 𝐶} ∈ ran 𝐸 ∧ {𝐶, 𝐴} ∈ ran 𝐸)) → Fun 𝐹)
 
Theoremconstr3trllem3 25918 Lemma for constr3trl 25925. (Contributed by Alexander van der Vekens, 11-Nov-2017.)
𝐹 = {⟨0, (𝐸‘{𝐴, 𝐵})⟩, ⟨1, (𝐸‘{𝐵, 𝐶})⟩, ⟨2, (𝐸‘{𝐶, 𝐴})⟩}    &   𝑃 = ({⟨0, 𝐴⟩, ⟨1, 𝐵⟩} ∪ {⟨2, 𝐶⟩, ⟨3, 𝐴⟩})       ((𝐴𝑉𝐵𝑉𝐶𝑉) → 𝑃:(0...(#‘𝐹))⟶𝑉)
 
Theoremconstr3trllem4 25919 Lemma for constr3trl 25925. (Contributed by Alexander van der Vekens, 11-Nov-2017.)
𝐹 = {⟨0, (𝐸‘{𝐴, 𝐵})⟩, ⟨1, (𝐸‘{𝐵, 𝐶})⟩, ⟨2, (𝐸‘{𝐶, 𝐴})⟩}    &   𝑃 = ({⟨0, 𝐴⟩, ⟨1, 𝐵⟩} ∪ {⟨2, 𝐶⟩, ⟨3, 𝐴⟩})       ((𝐴𝑉𝐵𝑉𝐶𝑉) → 𝑃:(0...3)⟶𝑉)
 
Theoremconstr3trllem5 25920* Lemma for constr3trl 25925. (Contributed by Alexander van der Vekens, 12-Nov-2017.)
𝐹 = {⟨0, (𝐸‘{𝐴, 𝐵})⟩, ⟨1, (𝐸‘{𝐵, 𝐶})⟩, ⟨2, (𝐸‘{𝐶, 𝐴})⟩}    &   𝑃 = ({⟨0, 𝐴⟩, ⟨1, 𝐵⟩} ∪ {⟨2, 𝐶⟩, ⟨3, 𝐴⟩})       ((𝑉 USGrph 𝐸 ∧ ({𝐴, 𝐵} ∈ ran 𝐸 ∧ {𝐵, 𝐶} ∈ ran 𝐸 ∧ {𝐶, 𝐴} ∈ ran 𝐸)) → ∀𝑘 ∈ (0..^(#‘𝐹))(𝐸‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))})
 
Theoremconstr3pthlem1 25921 Lemma for constr3pth 25926. (Contributed by Alexander van der Vekens, 13-Nov-2017.)
𝐹 = {⟨0, (𝐸‘{𝐴, 𝐵})⟩, ⟨1, (𝐸‘{𝐵, 𝐶})⟩, ⟨2, (𝐸‘{𝐶, 𝐴})⟩}    &   𝑃 = ({⟨0, 𝐴⟩, ⟨1, 𝐵⟩} ∪ {⟨2, 𝐶⟩, ⟨3, 𝐴⟩})       ((𝐵𝑉𝐶𝑊) → (𝑃 ↾ (1..^(#‘𝐹))) = {⟨1, 𝐵⟩, ⟨2, 𝐶⟩})
 
Theoremconstr3pthlem2 25922 Lemma for constr3pth 25926. (Contributed by Alexander van der Vekens, 13-Nov-2017.)
𝐹 = {⟨0, (𝐸‘{𝐴, 𝐵})⟩, ⟨1, (𝐸‘{𝐵, 𝐶})⟩, ⟨2, (𝐸‘{𝐶, 𝐴})⟩}    &   𝑃 = ({⟨0, 𝐴⟩, ⟨1, 𝐵⟩} ∪ {⟨2, 𝐶⟩, ⟨3, 𝐴⟩})       (((𝐴𝑉𝐵𝑉𝐶𝑉) ∧ 𝐵𝐶) → Fun (𝑃 ↾ (1..^(#‘𝐹))))
 
Theoremconstr3pthlem3 25923 Lemma for constr3pth 25926. (Contributed by Alexander van der Vekens, 11-Nov-2017.)
𝐹 = {⟨0, (𝐸‘{𝐴, 𝐵})⟩, ⟨1, (𝐸‘{𝐵, 𝐶})⟩, ⟨2, (𝐸‘{𝐶, 𝐴})⟩}    &   𝑃 = ({⟨0, 𝐴⟩, ⟨1, 𝐵⟩} ∪ {⟨2, 𝐶⟩, ⟨3, 𝐴⟩})       (((𝐴𝑉𝐵𝑉𝐶𝑉) ∧ (𝐴𝐵𝐵𝐶𝐶𝐴)) → ((𝑃 “ {0, (#‘𝐹)}) ∩ (𝑃 “ (1..^(#‘𝐹)))) = ∅)
 
Theoremconstr3cycllem1 25924 Lemma for constr3cycl 25927. (Contributed by Alexander van der Vekens, 11-Nov-2017.)
𝐹 = {⟨0, (𝐸‘{𝐴, 𝐵})⟩, ⟨1, (𝐸‘{𝐵, 𝐶})⟩, ⟨2, (𝐸‘{𝐶, 𝐴})⟩}    &   𝑃 = ({⟨0, 𝐴⟩, ⟨1, 𝐵⟩} ∪ {⟨2, 𝐶⟩, ⟨3, 𝐴⟩})       ((𝐴𝑉𝐵𝑉𝐶𝑉) → (𝑃‘0) = (𝑃‘(#‘𝐹)))
 
Theoremconstr3trl 25925 Construction of a trail from three given edges in a graph. (Contributed by Alexander van der Vekens, 13-Nov-2017.)
𝐹 = {⟨0, (𝐸‘{𝐴, 𝐵})⟩, ⟨1, (𝐸‘{𝐵, 𝐶})⟩, ⟨2, (𝐸‘{𝐶, 𝐴})⟩}    &   𝑃 = ({⟨0, 𝐴⟩, ⟨1, 𝐵⟩} ∪ {⟨2, 𝐶⟩, ⟨3, 𝐴⟩})       ((𝑉 USGrph 𝐸 ∧ (𝐴𝑉𝐵𝑉𝐶𝑉) ∧ ({𝐴, 𝐵} ∈ ran 𝐸 ∧ {𝐵, 𝐶} ∈ ran 𝐸 ∧ {𝐶, 𝐴} ∈ ran 𝐸)) → 𝐹(𝑉 Trails 𝐸)𝑃)
 
Theoremconstr3pth 25926 Construction of a path from three given edges in a graph. (Contributed by Alexander van der Vekens, 13-Nov-2017.)
𝐹 = {⟨0, (𝐸‘{𝐴, 𝐵})⟩, ⟨1, (𝐸‘{𝐵, 𝐶})⟩, ⟨2, (𝐸‘{𝐶, 𝐴})⟩}    &   𝑃 = ({⟨0, 𝐴⟩, ⟨1, 𝐵⟩} ∪ {⟨2, 𝐶⟩, ⟨3, 𝐴⟩})       ((𝑉 USGrph 𝐸 ∧ (𝐴𝑉𝐵𝑉𝐶𝑉) ∧ ({𝐴, 𝐵} ∈ ran 𝐸 ∧ {𝐵, 𝐶} ∈ ran 𝐸 ∧ {𝐶, 𝐴} ∈ ran 𝐸)) → 𝐹(𝑉 Paths 𝐸)𝑃)
 
Theoremconstr3cycl 25927 Construction of a 3-cycle from three given edges in a graph. (Contributed by Alexander van der Vekens, 13-Nov-2017.)
𝐹 = {⟨0, (𝐸‘{𝐴, 𝐵})⟩, ⟨1, (𝐸‘{𝐵, 𝐶})⟩, ⟨2, (𝐸‘{𝐶, 𝐴})⟩}    &   𝑃 = ({⟨0, 𝐴⟩, ⟨1, 𝐵⟩} ∪ {⟨2, 𝐶⟩, ⟨3, 𝐴⟩})       ((𝑉 USGrph 𝐸 ∧ (𝐴𝑉𝐵𝑉𝐶𝑉) ∧ ({𝐴, 𝐵} ∈ ran 𝐸 ∧ {𝐵, 𝐶} ∈ ran 𝐸 ∧ {𝐶, 𝐴} ∈ ran 𝐸)) → (𝐹(𝑉 Cycles 𝐸)𝑃 ∧ (#‘𝐹) = 3))
 
Theoremconstr3cyclp 25928 Construction of a 3-cycle from three given edges in a graph, containing an endpoint of one of these edges. (Contributed by Alexander van der Vekens, 17-Nov-2017.)
𝐹 = {⟨0, (𝐸‘{𝐴, 𝐵})⟩, ⟨1, (𝐸‘{𝐵, 𝐶})⟩, ⟨2, (𝐸‘{𝐶, 𝐴})⟩}    &   𝑃 = ({⟨0, 𝐴⟩, ⟨1, 𝐵⟩} ∪ {⟨2, 𝐶⟩, ⟨3, 𝐴⟩})       ((𝑉 USGrph 𝐸 ∧ (𝐴𝑉𝐵𝑉𝐶𝑉) ∧ ({𝐴, 𝐵} ∈ ran 𝐸 ∧ {𝐵, 𝐶} ∈ ran 𝐸 ∧ {𝐶, 𝐴} ∈ ran 𝐸)) → (𝐹(𝑉 Cycles 𝐸)𝑃 ∧ (#‘𝐹) = 3 ∧ (𝑃‘0) = 𝐴))
 
Theoremconstr3cyclpe 25929* If there are three (different) vertices in a graph which are mutually connected by edges, there is a 3-cycle in the graph containing one of these vertices. (Contributed by Alexander van der Vekens, 17-Nov-2017.)
((𝑉 USGrph 𝐸 ∧ (𝐴𝑉𝐵𝑉𝐶𝑉) ∧ ({𝐴, 𝐵} ∈ ran 𝐸 ∧ {𝐵, 𝐶} ∈ ran 𝐸 ∧ {𝐶, 𝐴} ∈ ran 𝐸)) → ∃𝑓𝑝(𝑓(𝑉 Cycles 𝐸)𝑝 ∧ (#‘𝑓) = 3 ∧ (𝑝‘0) = 𝐴))
 
Theorem3v3e3cycl2 25930* If there are three (different) vertices in a graph which are mutually connected by edges, there is a 3-cycle in the graph. (Contributed by Alexander van der Vekens, 14-Nov-2017.)
(𝑉 USGrph 𝐸 → (∃𝑎𝑉𝑏𝑉𝑐𝑉 ({𝑎, 𝑏} ∈ ran 𝐸 ∧ {𝑏, 𝑐} ∈ ran 𝐸 ∧ {𝑐, 𝑎} ∈ ran 𝐸) → ∃𝑓𝑝(𝑓(𝑉 Cycles 𝐸)𝑝 ∧ (#‘𝑓) = 3)))
 
Theorem3v3e3cycl 25931* If and only if there is a 3-cycle in a graph, there are three (different) vertices in the graph which are mutually connected by edges. (Contributed by Alexander van der Vekens, 14-Nov-2017.)
(𝑉 USGrph 𝐸 → (∃𝑓𝑝(𝑓(𝑉 Cycles 𝐸)𝑝 ∧ (#‘𝑓) = 3) ↔ ∃𝑎𝑉𝑏𝑉𝑐𝑉 ({𝑎, 𝑏} ∈ ran 𝐸 ∧ {𝑏, 𝑐} ∈ ran 𝐸 ∧ {𝑐, 𝑎} ∈ ran 𝐸)))
 
Theorem4cycl4v4e 25932* If there is a cycle of length 4 in a graph, there are four (different) vertices in the graph which are mutually connected by edges. (Contributed by Alexander van der Vekens, 9-Nov-2017.)
((Fun 𝐸𝐹(𝑉 Cycles 𝐸)𝑃 ∧ (#‘𝐹) = 4) → ∃𝑎𝑉𝑏𝑉𝑐𝑉𝑑𝑉 (({𝑎, 𝑏} ∈ ran 𝐸 ∧ {𝑏, 𝑐} ∈ ran 𝐸) ∧ ({𝑐, 𝑑} ∈ ran 𝐸 ∧ {𝑑, 𝑎} ∈ ran 𝐸)))
 
Theorem4cycl4dv 25933 In a simple graph, the vertices of a 4-cycle are mutually different. (Contributed by Alexander van der Vekens, 18-Nov-2017.)
((𝑉 USGrph 𝐸 ∧ (𝐹 ∈ Word dom 𝐸 ∧ Fun 𝐹 ∧ (#‘𝐹) = 4)) → ((((𝐸‘(𝐹‘0)) = {𝐴, 𝐵} ∧ (𝐸‘(𝐹‘1)) = {𝐵, 𝐶}) ∧ ((𝐸‘(𝐹‘2)) = {𝐶, 𝐷} ∧ (𝐸‘(𝐹‘3)) = {𝐷, 𝐴})) → ((({𝐴, 𝐵} ∈ ran 𝐸 ∧ {𝐵, 𝐶} ∈ ran 𝐸) ∧ ({𝐶, 𝐷} ∈ ran 𝐸 ∧ {𝐷, 𝐴} ∈ ran 𝐸)) ∧ ((𝐴𝐵𝐴𝐶𝐴𝐷) ∧ (𝐵𝐶𝐵𝐷𝐶𝐷)))))
 
Theorem4cycl4dv4e 25934* If there is a cycle of length 4 in a graph, there are four (different) vertices in the graph which are mutually connected by edges. (Contributed by Alexander van der Vekens, 9-Nov-2017.)
((𝑉 USGrph 𝐸𝐹(𝑉 Cycles 𝐸)𝑃 ∧ (#‘𝐹) = 4) → ∃𝑎𝑉𝑏𝑉𝑐𝑉𝑑𝑉 ((({𝑎, 𝑏} ∈ ran 𝐸 ∧ {𝑏, 𝑐} ∈ ran 𝐸) ∧ ({𝑐, 𝑑} ∈ ran 𝐸 ∧ {𝑑, 𝑎} ∈ ran 𝐸)) ∧ ((𝑎𝑏𝑎𝑐𝑎𝑑) ∧ (𝑏𝑐𝑏𝑑𝑐𝑑))))
 
16.1.5.4  Connected graphs
 
Syntaxcconngra 25935 Extend class notation with connected graphs.
class ConnGrph
 
Definitiondf-conngra 25936* Define the class of all connected graphs. A graph (or, more generally, any pair representing a structure consisting of "vertices" and "edges") is called connected if there is a path between every pair of (distinct) vertices. The distinctness of the vertices is not necessary for the definition, because there is always a path (of length 0) from a vertex to itself, see 0pthonv 25849 and dfconngra1 25937. (Contributed by Alexander van der Vekens, 2-Dec-2017.)
ConnGrph = {⟨𝑣, 𝑒⟩ ∣ ∀𝑘𝑣𝑛𝑣𝑓𝑝 𝑓(𝑘(𝑣 PathOn 𝑒)𝑛)𝑝}
 
Theoremdfconngra1 25937* Alternative definition of the class of all connected graphs, requiring paths between distinct vertices. (Contributed by Alexander van der Vekens, 3-Dec-2017.)
ConnGrph = {⟨𝑣, 𝑒⟩ ∣ ∀𝑘𝑣𝑛 ∈ (𝑣 ∖ {𝑘})∃𝑓𝑝 𝑓(𝑘(𝑣 PathOn 𝑒)𝑛)𝑝}
 
Theoremisconngra 25938* The property of being a connected graph. (Contributed by Alexander van der Vekens, 2-Dec-2017.)
((𝑉𝑋𝐸𝑌) → (𝑉 ConnGrph 𝐸 ↔ ∀𝑘𝑉𝑛𝑉𝑓𝑝 𝑓(𝑘(𝑉 PathOn 𝐸)𝑛)𝑝))
 
Theoremisconngra1 25939* The property of being a connected graph. (Contributed by Alexander van der Vekens, 2-Dec-2017.)
((𝑉𝑋𝐸𝑌) → (𝑉 ConnGrph 𝐸 ↔ ∀𝑘𝑉𝑛 ∈ (𝑉 ∖ {𝑘})∃𝑓𝑝 𝑓(𝑘(𝑉 PathOn 𝐸)𝑛)𝑝))
 
Theorem0conngra 25940 A class/graph without vertices is connected. (Contributed by Alexander van der Vekens, 2-Dec-2017.)
(𝐸𝑉 → ∅ ConnGrph 𝐸)
 
Theorem1conngra 25941 A class/graph with (at most) one vertex is connected. (Contributed by Alexander van der Vekens, 2-Dec-2017.)
(𝐸𝑉 → {𝐴} ConnGrph 𝐸)
 
Theoremcusconngra 25942 A complete (undirected simple) graph is connected. (Contributed by Alexander van der Vekens, 4-Dec-2017.)
(𝑉 ComplUSGrph 𝐸𝑉 ConnGrph 𝐸)
 
16.1.5.5  Walks as words
 
Syntaxcwwlk 25943 Extend class notation with Walks (of a graph) as Word over the set of vertices.
class WWalks
 
Syntaxcwwlkn 25944 Extend class notation with Walks (of a graph) of a fixed length as Word over the set of vertices.
class WWalksN
 
Definitiondf-wwlk 25945* 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-wlk 25774. 𝑤 = ∅ 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.)
WWalks = (𝑣 ∈ V, 𝑒 ∈ V ↦ {𝑤 ∈ Word 𝑣 ∣ (𝑤 ≠ ∅ ∧ ∀𝑖 ∈ (0..^((#‘𝑤) − 1)){(𝑤𝑖), (𝑤‘(𝑖 + 1))} ∈ ran 𝑒)})
 
Definitiondf-wwlkn 25946* 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-wlk 25774. (Contributed by Alexander van der Vekens, 15-Jul-2018.)
WWalksN = (𝑣 ∈ V, 𝑒 ∈ V ↦ (𝑛 ∈ ℕ0 ↦ {𝑤 ∈ (𝑣 WWalks 𝑒) ∣ (#‘𝑤) = (𝑛 + 1)}))
 
Theoremwwlk 25947* The set of walks (in an undirected graph) as words over the set of vertices. (Contributed by Alexander van der Vekens, 15-Jul-2018.)
((𝑉𝑋𝐸𝑌) → (𝑉 WWalks 𝐸) = {𝑤 ∈ Word 𝑉 ∣ (𝑤 ≠ ∅ ∧ ∀𝑖 ∈ (0..^((#‘𝑤) − 1)){(𝑤𝑖), (𝑤‘(𝑖 + 1))} ∈ ran 𝐸)})
 
Theoremwwlkn 25948* 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.)
((𝑉𝑋𝐸𝑌𝑁 ∈ ℕ0) → ((𝑉 WWalksN 𝐸)‘𝑁) = {𝑤 ∈ (𝑉 WWalks 𝐸) ∣ (#‘𝑤) = (𝑁 + 1)})
 
Theoremiswwlk 25949* Properties of a word to represent a walk (in an undirected graph). (Contributed by Alexander van der Vekens, 15-Jul-2018.)
((𝑉𝑋𝐸𝑌) → (𝑊 ∈ (𝑉 WWalks 𝐸) ↔ (𝑊 ≠ ∅ ∧ 𝑊 ∈ Word 𝑉 ∧ ∀𝑖 ∈ (0..^((#‘𝑊) − 1)){(𝑊𝑖), (𝑊‘(𝑖 + 1))} ∈ ran 𝐸)))
 
Theoremiswwlkn 25950 Properties of a word to represent a walk of a fixed length (in an undirected graph). (Contributed by Alexander van der Vekens, 15-Jul-2018.)
((𝑉𝑋𝐸𝑌𝑁 ∈ ℕ0) → (𝑊 ∈ ((𝑉 WWalksN 𝐸)‘𝑁) ↔ (𝑊 ∈ (𝑉 WWalks 𝐸) ∧ (#‘𝑊) = (𝑁 + 1))))
 
Theoremwwlkprop 25951 Properties of a walk (in an undirected graph) as word. (Contributed by Alexander van der Vekens, 15-Jul-2018.)
(𝑃 ∈ (𝑉 WWalks 𝐸) → (𝑉 ∈ V ∧ 𝐸 ∈ V ∧ 𝑃 ∈ Word 𝑉))
 
Theoremwwlknprop 25952 Properties of a walk of a fixed length (in an undirected graph) as word. (Contributed by Alexander van der Vekens, 16-Jul-2018.)
(𝑃 ∈ ((𝑉 WWalksN 𝐸)‘𝑁) → ((𝑉 ∈ V ∧ 𝐸 ∈ V) ∧ (𝑁 ∈ ℕ0𝑃 ∈ Word 𝑉)))
 
Theoremwwlknimp 25953* Implications for a set being a walk of length n (represented by a word). (Contributed by Alexander van der Vekens, 17-Jun-2018.)
(𝑊 ∈ ((𝑉 WWalksN 𝐸)‘𝑁) → (𝑊 ∈ Word 𝑉 ∧ (#‘𝑊) = (𝑁 + 1) ∧ ∀𝑖 ∈ (0..^𝑁){(𝑊𝑖), (𝑊‘(𝑖 + 1))} ∈ ran 𝐸))
 
Theoremwwlksswrd 25954 Walks (represented by words) are words. (Contributed by Alexander van der Vekens, 17-Jul-2018.)
(𝑉 WWalks 𝐸) ⊆ Word 𝑉
 
Theoremwwlkn0 25955* A walk of length 0 is represented by a singleton word. (Contributed by Alexander van der Vekens, 20-Jul-2018.)
(𝑊 ∈ ((𝑉 WWalksN 𝐸)‘0) → ∃𝑣𝑉 𝑊 = ⟨“𝑣”⟩)
 
Theoremwlkiswwlk1 25956 The sequence of vertices in a walk is a walk as word in an undirected simple graph. (Contributed by Alexander van der Vekens, 20-Jul-2018.)
(𝑉 USGrph 𝐸 → (𝐹(𝑉 Walks 𝐸)𝑃𝑃 ∈ (𝑉 WWalks 𝐸)))
 
Theoremwlkiswwlk2lem1 25957* Lemma 1 for wlkiswwlk2 25963. (Contributed by Alexander van der Vekens, 20-Jul-2018.)
𝐹 = (𝑥 ∈ (0..^((#‘𝑃) − 1)) ↦ (𝐸‘{(𝑃𝑥), (𝑃‘(𝑥 + 1))}))       ((𝑃 ∈ Word 𝑉 ∧ 1 ≤ (#‘𝑃)) → (#‘𝐹) = ((#‘𝑃) − 1))
 
Theoremwlkiswwlk2lem2 25958* Lemma 2 for wlkiswwlk2 25963. (Contributed by Alexander van der Vekens, 20-Jul-2018.)
𝐹 = (𝑥 ∈ (0..^((#‘𝑃) − 1)) ↦ (𝐸‘{(𝑃𝑥), (𝑃‘(𝑥 + 1))}))       (((#‘𝑃) ∈ ℕ0𝐼 ∈ (0..^((#‘𝑃) − 1))) → (𝐹𝐼) = (𝐸‘{(𝑃𝐼), (𝑃‘(𝐼 + 1))}))
 
Theoremwlkiswwlk2lem3 25959* Lemma 3 for wlkiswwlk2 25963. (Contributed by Alexander van der Vekens, 20-Jul-2018.)
𝐹 = (𝑥 ∈ (0..^((#‘𝑃) − 1)) ↦ (𝐸‘{(𝑃𝑥), (𝑃‘(𝑥 + 1))}))       ((𝑃 ∈ Word 𝑉 ∧ 1 ≤ (#‘𝑃)) → 𝑃:(0...(#‘𝐹))⟶𝑉)
 
Theoremwlkiswwlk2lem4 25960* Lemma 4 for wlkiswwlk2 25963. (Contributed by Alexander van der Vekens, 20-Jul-2018.)
𝐹 = (𝑥 ∈ (0..^((#‘𝑃) − 1)) ↦ (𝐸‘{(𝑃𝑥), (𝑃‘(𝑥 + 1))}))       ((𝑉 USGrph 𝐸𝑃 ∈ Word 𝑉 ∧ 1 ≤ (#‘𝑃)) → (∀𝑖 ∈ (0..^((#‘𝑃) − 1)){(𝑃𝑖), (𝑃‘(𝑖 + 1))} ∈ ran 𝐸 → ∀𝑖 ∈ (0..^(#‘𝐹))(𝐸‘(𝐹𝑖)) = {(𝑃𝑖), (𝑃‘(𝑖 + 1))}))
 
Theoremwlkiswwlk2lem5 25961* Lemma 5 for wlkiswwlk2 25963. (Contributed by Alexander van der Vekens, 21-Jul-2018.)
𝐹 = (𝑥 ∈ (0..^((#‘𝑃) − 1)) ↦ (𝐸‘{(𝑃𝑥), (𝑃‘(𝑥 + 1))}))       ((𝑉 USGrph 𝐸𝑃 ∈ Word 𝑉 ∧ 1 ≤ (#‘𝑃)) → (∀𝑖 ∈ (0..^((#‘𝑃) − 1)){(𝑃𝑖), (𝑃‘(𝑖 + 1))} ∈ ran 𝐸𝐹 ∈ Word dom 𝐸))
 
Theoremwlkiswwlk2lem6 25962* Lemma 6 for wlkiswwlk2 25963. (Contributed by Alexander van der Vekens, 21-Jul-2018.)
𝐹 = (𝑥 ∈ (0..^((#‘𝑃) − 1)) ↦ (𝐸‘{(𝑃𝑥), (𝑃‘(𝑥 + 1))}))       ((𝑉 USGrph 𝐸𝑃 ∈ Word 𝑉 ∧ 1 ≤ (#‘𝑃)) → (∀𝑖 ∈ (0..^((#‘𝑃) − 1)){(𝑃𝑖), (𝑃‘(𝑖 + 1))} ∈ ran 𝐸 → (𝐹 ∈ Word dom 𝐸𝑃:(0...(#‘𝐹))⟶𝑉 ∧ ∀𝑖 ∈ (0..^(#‘𝐹))(𝐸‘(𝐹𝑖)) = {(𝑃𝑖), (𝑃‘(𝑖 + 1))})))
 
Theoremwlkiswwlk2 25963* A walk as word corresponds to the sequence of vertices in a walk in an undirected simple graph. (Contributed by Alexander van der Vekens, 21-Jul-2018.)
(𝑉 USGrph 𝐸 → (𝑃 ∈ (𝑉 WWalks 𝐸) → ∃𝑓 𝑓(𝑉 Walks 𝐸)𝑃))
 
Theoremwlkiswwlk 25964* A walk as word corresponds to a walk in an undirected simple graph. (Contributed by Alexander van der Vekens, 21-Jul-2018.)
(𝑉 USGrph 𝐸 → (∃𝑓 𝑓(𝑉 Walks 𝐸)𝑃𝑃 ∈ (𝑉 WWalks 𝐸)))
 
Theoremwlklniswwlkn1 25965 The sequence of vertices in a walk of length n is a walk as word of length n in an undirected simple graph. (Contributed by Alexander van der Vekens, 21-Jul-2018.)
(𝑉 USGrph 𝐸 → ((𝐹(𝑉 Walks 𝐸)𝑃 ∧ (#‘𝐹) = 𝑁) → 𝑃 ∈ ((𝑉 WWalksN 𝐸)‘𝑁)))
 
Theoremwlklniswwlkn2 25966* A walk of length n as word corresponds to the sequence of vertices in a walk of length n in an undirected simple graph. (Contributed by Alexander van der Vekens, 21-Jul-2018.)
(𝑉 USGrph 𝐸 → (𝑃 ∈ ((𝑉 WWalksN 𝐸)‘𝑁) → ∃𝑓(𝑓(𝑉 Walks 𝐸)𝑃 ∧ (#‘𝑓) = 𝑁)))
 
Theoremwlklniswwlkn 25967* A walk of length n as word corresponds to a walk with length n in an undirected simple graph. (Contributed by Alexander van der Vekens, 21-Jul-2018.)
(𝑉 USGrph 𝐸 → (∃𝑓(𝑓(𝑉 Walks 𝐸)𝑃 ∧ (#‘𝑓) = 𝑁) ↔ 𝑃 ∈ ((𝑉 WWalksN 𝐸)‘𝑁)))
 
Theoremwwlkiswwlkn 25968 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.)
(𝑃 ∈ ((𝑉 WWalksN 𝐸)‘𝑁) → 𝑃 ∈ (𝑉 WWalks 𝐸))
 
Theoremwwlksswwlkn 25969 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.)
((𝑉 WWalksN 𝐸)‘𝑁) ⊆ (𝑉 WWalks 𝐸)
 
Theoremwwlknimpb 25970 Basic implications for a set being a walk of length n (represented by a word). (Contributed by Alexander van der Vekens, 3-Oct-2018.)
(𝑊 ∈ ((𝑉 WWalksN 𝐸)‘𝑁) → (𝑊 ∈ Word 𝑉 ∧ (#‘𝑊) = (𝑁 + 1)))
 
Theoremwwlkn0s 25971* 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.)
((𝑉𝑋𝐸𝑌) → ((𝑉 WWalksN 𝐸)‘0) = {𝑤 ∈ Word 𝑉 ∣ (#‘𝑤) = 1})
 
Theoremvfwlkniswwlkn 25972 If the edge function of a walk has length n, then the vertex function of the walk is a word representing the walk as word of length n. (Contributed by Alexander van der Vekens, 25-Aug-2018.)
((𝑁 ∈ ℕ0 ∧ (𝑊 ∈ (𝑉 Walks 𝐸) ∧ (#‘(1st𝑊)) = 𝑁)) → (2nd𝑊) ∈ ((𝑉 WWalksN 𝐸)‘𝑁))
 
Theorem2wlkeq 25973* Conditions for two walks (within the same graph) being the same. (Contributed by AV, 1-Jul-2018.) (Revised by AV, 16-May-2019.)
((𝐴 ∈ (𝑉 Walks 𝐸) ∧ 𝐵 ∈ (𝑉 Walks 𝐸) ∧ 𝑁 = (#‘(1st𝐴))) → (𝐴 = 𝐵 ↔ (𝑁 = (#‘(1st𝐵)) ∧ ∀𝑥 ∈ (0..^𝑁)((1st𝐴)‘𝑥) = ((1st𝐵)‘𝑥) ∧ ∀𝑥 ∈ (0...𝑁)((2nd𝐴)‘𝑥) = ((2nd𝐵)‘𝑥))))
 
Theoremusg2wlkeq 25974* Conditions for two walks within the same undirected simple graph being the same. It is sufficient that the vertices (in the same order) are identical. (Contributed by AV, 3-Jul-2018.)
((𝑉 USGrph 𝐸 ∧ (𝐴 ∈ (𝑉 Walks 𝐸) ∧ 𝐵 ∈ (𝑉 Walks 𝐸)) ∧ 𝑁 = (#‘(1st𝐴))) → (𝐴 = 𝐵 ↔ (𝑁 = (#‘(1st𝐵)) ∧ ∀𝑦 ∈ (0...𝑁)((2nd𝐴)‘𝑦) = ((2nd𝐵)‘𝑦))))
 
Theoremusg2wlkeq2 25975 Conditions for which two walks within the same undirected simple graph are the same. It is sufficient that the vertices (in the same order) are identical. (Contributed by Alexander van der Vekens, 25-Aug-2018.)
(((𝑉 USGrph 𝐸𝑁 ∈ ℕ0) ∧ (𝑋 ∈ (𝑉 Walks 𝐸) ∧ (#‘(1st𝑋)) = 𝑁) ∧ (𝑊 ∈ (𝑉 Walks 𝐸) ∧ (#‘(1st𝑊)) = 𝑁)) → ((2nd𝑋) = (2nd𝑊) → 𝑋 = 𝑊))
 
Theoremwlknwwlknfun 25976* Lemma 1 for wlknwwlknbij2 25980. (Contributed by Alexander van der Vekens, 25-Aug-2018.)
𝑇 = {𝑝 ∈ (𝑉 Walks 𝐸) ∣ (#‘(1st𝑝)) = 𝑁}    &   𝑊 = ((𝑉 WWalksN 𝐸)‘𝑁)    &   𝐹 = (𝑡𝑇 ↦ (2nd𝑡))       (𝑁 ∈ ℕ0𝐹:𝑇𝑊)
 
Theoremwlknwwlkninj 25977* Lemma 2 for wlknwwlknbij2 25980. (Contributed by Alexander van der Vekens, 25-Aug-2018.)
𝑇 = {𝑝 ∈ (𝑉 Walks 𝐸) ∣ (#‘(1st𝑝)) = 𝑁}    &   𝑊 = ((𝑉 WWalksN 𝐸)‘𝑁)    &   𝐹 = (𝑡𝑇 ↦ (2nd𝑡))       ((𝑉 USGrph 𝐸𝑁 ∈ ℕ0) → 𝐹:𝑇1-1𝑊)
 
Theoremwlknwwlknsur 25978* Lemma 3 for wlknwwlknbij2 25980. (Contributed by Alexander van der Vekens, 25-Aug-2018.)
𝑇 = {𝑝 ∈ (𝑉 Walks 𝐸) ∣ (#‘(1st𝑝)) = 𝑁}    &   𝑊 = ((𝑉 WWalksN 𝐸)‘𝑁)    &   𝐹 = (𝑡𝑇 ↦ (2nd𝑡))       ((𝑉 USGrph 𝐸𝑁 ∈ ℕ0) → 𝐹:𝑇onto𝑊)
 
Theoremwlknwwlknbij 25979* Lemma 4 for wlknwwlknbij2 25980. (Contributed by Alexander van der Vekens, 25-Aug-2018.)
𝑇 = {𝑝 ∈ (𝑉 Walks 𝐸) ∣ (#‘(1st𝑝)) = 𝑁}    &   𝑊 = ((𝑉 WWalksN 𝐸)‘𝑁)    &   𝐹 = (𝑡𝑇 ↦ (2nd𝑡))       ((𝑉 USGrph 𝐸𝑁 ∈ ℕ0) → 𝐹:𝑇1-1-onto𝑊)
 
Theoremwlknwwlknbij2 25980* 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. (Contributed by Alexander van der Vekens, 25-Aug-2018.)
((𝑉 USGrph 𝐸𝑁 ∈ ℕ0) → ∃𝑓 𝑓:{𝑝 ∈ (𝑉 Walks 𝐸) ∣ (#‘(1st𝑝)) = 𝑁}–1-1-onto→((𝑉 WWalksN 𝐸)‘𝑁))
 
Theoremwlknwwlknen 25981* 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.)
((𝑉 USGrph 𝐸𝑁 ∈ ℕ0) → {𝑝 ∈ (𝑉 Walks 𝐸) ∣ (#‘(1st𝑝)) = 𝑁} ≈ ((𝑉 WWalksN 𝐸)‘𝑁))
 
Theoremwlknwwlkneqs 25982* 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.)
((𝑉 USGrph 𝐸𝑁 ∈ ℕ0) → (#‘{𝑝 ∈ (𝑉 Walks 𝐸) ∣ (#‘(1st𝑝)) = 𝑁}) = (#‘((𝑉 WWalksN 𝐸)‘𝑁)))
 
Theoremwlkiswwlkfun 25983* Lemma 1 for wlkiswwlkbij2 25987. (Contributed by Alexander van der Vekens, 22-Jul-2018.) (Proof shortened by Alexander van der Vekens, 25-Aug-2018.)
𝑇 = {𝑝 ∈ (𝑉 Walks 𝐸) ∣ ((#‘(1st𝑝)) = 𝑁 ∧ ((2nd𝑝)‘0) = 𝑃)}    &   𝑊 = {𝑤 ∈ ((𝑉 WWalksN 𝐸)‘𝑁) ∣ (𝑤‘0) = 𝑃}    &   𝐹 = (𝑡𝑇 ↦ (2nd𝑡))       ((𝑃𝑉𝑁 ∈ ℕ0) → 𝐹:𝑇𝑊)
 
Theoremwlkiswwlkinj 25984* Lemma 2 for wlkiswwlkbij2 25987. (Contributed by Alexander van der Vekens, 23-Jul-2018.) (Proof shortened by Alexander van der Vekens, 25-Aug-2018.)
𝑇 = {𝑝 ∈ (𝑉 Walks 𝐸) ∣ ((#‘(1st𝑝)) = 𝑁 ∧ ((2nd𝑝)‘0) = 𝑃)}    &   𝑊 = {𝑤 ∈ ((𝑉 WWalksN 𝐸)‘𝑁) ∣ (𝑤‘0) = 𝑃}    &   𝐹 = (𝑡𝑇 ↦ (2nd𝑡))       ((𝑉 USGrph 𝐸𝑃𝑉𝑁 ∈ ℕ0) → 𝐹:𝑇1-1𝑊)
 
Theoremwlkiswwlksur 25985* Lemma 3 for wlkiswwlkbij2 25987. (Contributed by Alexander van der Vekens, 23-Jul-2018.)
𝑇 = {𝑝 ∈ (𝑉 Walks 𝐸) ∣ ((#‘(1st𝑝)) = 𝑁 ∧ ((2nd𝑝)‘0) = 𝑃)}    &   𝑊 = {𝑤 ∈ ((𝑉 WWalksN 𝐸)‘𝑁) ∣ (𝑤‘0) = 𝑃}    &   𝐹 = (𝑡𝑇 ↦ (2nd𝑡))       ((𝑉 USGrph 𝐸𝑃𝑉𝑁 ∈ ℕ0) → 𝐹:𝑇onto𝑊)
 
Theoremwlkiswwlkbij 25986* Lemma 4 for wlkiswwlkbij2 25987. (Contributed by Alexander van der Vekens, 22-Jul-2018.)
𝑇 = {𝑝 ∈ (𝑉 Walks 𝐸) ∣ ((#‘(1st𝑝)) = 𝑁 ∧ ((2nd𝑝)‘0) = 𝑃)}    &   𝑊 = {𝑤 ∈ ((𝑉 WWalksN 𝐸)‘𝑁) ∣ (𝑤‘0) = 𝑃}    &   𝐹 = (𝑡𝑇 ↦ (2nd𝑡))       ((𝑉 USGrph 𝐸𝑃𝑉𝑁 ∈ ℕ0) → 𝐹:𝑇1-1-onto𝑊)
 
Theoremwlkiswwlkbij2 25987* There is a bijection between the set of walks of a fixed length, starting at a fixed vertex, and the set of walks represented as words of the same length, starting at the same vertex. (Contributed by Alexander van der Vekens, 22-Jul-2018.)
((𝑉 USGrph 𝐸𝑃𝑉𝑁 ∈ ℕ0) → ∃𝑓 𝑓:{𝑝 ∈ (𝑉 Walks 𝐸) ∣ ((#‘(1st𝑝)) = 𝑁 ∧ ((2nd𝑝)‘0) = 𝑃)}–1-1-onto→{𝑤 ∈ ((𝑉 WWalksN 𝐸)‘𝑁) ∣ (𝑤‘0) = 𝑃})
 
Theoremwwlkeq 25988* Equality of two walks (as words). (Contributed by Alexander van der Vekens, 4-Aug-2018.)
((𝑊 ∈ (𝑉 WWalks 𝐸) ∧ 𝑇 ∈ (𝑉 WWalks 𝐸)) → (𝑊 = 𝑇 ↔ ((#‘𝑊) = (#‘𝑇) ∧ ∀𝑖 ∈ (0..^(#‘𝑊))(𝑊𝑖) = (𝑇𝑖))))
 
Theoremwwlknred 25989 Reduction of a walk (as word) by removing the trailing edge/vertex. (Contributed by Alexander van der Vekens, 4-Aug-2018.)
(𝑁 ∈ ℕ0 → (𝑊 ∈ ((𝑉 WWalksN 𝐸)‘(𝑁 + 1)) → (𝑊 substr ⟨0, (𝑁 + 1)⟩) ∈ ((𝑉 WWalksN 𝐸)‘𝑁)))
 
Theoremwwlknext 25990 Extension of a walk (as word) by adding an edge/vertex. (Contributed by Alexander van der Vekens, 4-Aug-2018.)
((𝑇 ∈ ((𝑉 WWalksN 𝐸)‘𝑁) ∧ 𝑆𝑉 ∧ {( lastS ‘𝑇), 𝑆} ∈ ran 𝐸) → (𝑇 ++ ⟨“𝑆”⟩) ∈ ((𝑉 WWalksN 𝐸)‘(𝑁 + 1)))
 
Theoremwwlknextbi 25991 Extension of a walk (as word) by adding an edge/vertex. (Contributed by Alexander van der Vekens, 5-Aug-2018.)
(((𝑁 ∈ ℕ0𝑆𝑉) ∧ (𝑇 ∈ Word 𝑉𝑊 = (𝑇 ++ ⟨“𝑆”⟩) ∧ {( lastS ‘𝑇), 𝑆} ∈ ran 𝐸)) → (𝑊 ∈ ((𝑉 WWalksN 𝐸)‘(𝑁 + 1)) ↔ 𝑇 ∈ ((𝑉 WWalksN 𝐸)‘𝑁)))
 
Theoremwwlknredwwlkn 25992* For each walk (as word) of length at least 1 there is a shorter walk (as word). (Contributed by Alexander van der Vekens, 22-Aug-2018.)
(𝑁 ∈ ℕ0 → (𝑊 ∈ ((𝑉 WWalksN 𝐸)‘(𝑁 + 1)) → ∃𝑦 ∈ ((𝑉 WWalksN 𝐸)‘𝑁)((𝑊 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ {( lastS ‘𝑦), ( lastS ‘𝑊)} ∈ ran 𝐸)))
 
Theoremwwlknredwwlkn0 25993* For each walk (as word) of length at least 1 there is a shorter walk (as word) starting at the same vertex. (Contributed by Alexander van der Vekens, 22-Aug-2018.)
((𝑁 ∈ ℕ0𝑊 ∈ ((𝑉 WWalksN 𝐸)‘(𝑁 + 1))) → ((𝑊‘0) = 𝑃 ↔ ∃𝑦 ∈ ((𝑉 WWalksN 𝐸)‘𝑁)((𝑊 substr ⟨0, (𝑁 + 1)⟩) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {( lastS ‘𝑦), ( lastS ‘𝑊)} ∈ ran 𝐸)))
 
Theoremwwlkextwrd 25994* Lemma 0 for wwlkextbij 25999. (Contributed by Alexander van der Vekens, 5-Aug-2018.)
𝐷 = {𝑤 ∈ Word 𝑉 ∣ ((#‘𝑤) = (𝑁 + 2) ∧ (𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {( lastS ‘𝑊), ( lastS ‘𝑤)} ∈ ran 𝐸)}       (𝑊 ∈ ((𝑉 WWalksN 𝐸)‘𝑁) → 𝐷 = {𝑤 ∈ ((𝑉 WWalksN 𝐸)‘(𝑁 + 1)) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {( lastS ‘𝑊), ( lastS ‘𝑤)} ∈ ran 𝐸)})
 
Theoremwwlkextfun 25995* Lemma 1 for wwlkextbij 25999. (Contributed by Alexander van der Vekens, 7-Aug-2018.)
𝐷 = {𝑤 ∈ Word 𝑉 ∣ ((#‘𝑤) = (𝑁 + 2) ∧ (𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {( lastS ‘𝑊), ( lastS ‘𝑤)} ∈ ran 𝐸)}    &   𝑅 = {𝑛𝑉 ∣ {( lastS ‘𝑊), 𝑛} ∈ ran 𝐸}    &   𝐹 = (𝑡𝐷 ↦ ( lastS ‘𝑡))       (𝑁 ∈ ℕ0𝐹:𝐷𝑅)
 
Theoremwwlkextinj 25996* Lemma 2 for wwlkextbij 25999. (Contributed by Alexander van der Vekens, 7-Aug-2018.)
𝐷 = {𝑤 ∈ Word 𝑉 ∣ ((#‘𝑤) = (𝑁 + 2) ∧ (𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {( lastS ‘𝑊), ( lastS ‘𝑤)} ∈ ran 𝐸)}    &   𝑅 = {𝑛𝑉 ∣ {( lastS ‘𝑊), 𝑛} ∈ ran 𝐸}    &   𝐹 = (𝑡𝐷 ↦ ( lastS ‘𝑡))       (𝑁 ∈ ℕ0𝐹:𝐷1-1𝑅)
 
Theoremwwlkextsur 25997* Lemma 3 for wwlkextbij 25999. (Contributed by Alexander van der Vekens, 7-Aug-2018.)
𝐷 = {𝑤 ∈ Word 𝑉 ∣ ((#‘𝑤) = (𝑁 + 2) ∧ (𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {( lastS ‘𝑊), ( lastS ‘𝑤)} ∈ ran 𝐸)}    &   𝑅 = {𝑛𝑉 ∣ {( lastS ‘𝑊), 𝑛} ∈ ran 𝐸}    &   𝐹 = (𝑡𝐷 ↦ ( lastS ‘𝑡))       (𝑊 ∈ ((𝑉 WWalksN 𝐸)‘𝑁) → 𝐹:𝐷onto𝑅)
 
Theoremwwlkextbij0 25998* Lemma 4 for wwlkextbij 25999. (Contributed by Alexander van der Vekens, 7-Aug-2018.)
𝐷 = {𝑤 ∈ Word 𝑉 ∣ ((#‘𝑤) = (𝑁 + 2) ∧ (𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {( lastS ‘𝑊), ( lastS ‘𝑤)} ∈ ran 𝐸)}    &   𝑅 = {𝑛𝑉 ∣ {( lastS ‘𝑊), 𝑛} ∈ ran 𝐸}    &   𝐹 = (𝑡𝐷 ↦ ( lastS ‘𝑡))       (𝑊 ∈ ((𝑉 WWalksN 𝐸)‘𝑁) → 𝐹:𝐷1-1-onto𝑅)
 
Theoremwwlkextbij 25999* There is a bijection between the extensions of a walk (as word) by an edge and the set of vertices being connected to the trailing vertex of the walk. (Contributed by Alexander van der Vekens, 21-Aug-2018.)
(𝑊 ∈ ((𝑉 WWalksN 𝐸)‘𝑁) → ∃𝑓 𝑓:{𝑤 ∈ ((𝑉 WWalksN 𝐸)‘(𝑁 + 1)) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {( lastS ‘𝑊), ( lastS ‘𝑤)} ∈ ran 𝐸)}–1-1-onto→{𝑛𝑉 ∣ {( lastS ‘𝑊), 𝑛} ∈ ran 𝐸})
 
Theoremwwlkexthasheq 26000* The number of the extensions of a walk (as word) by an edge equals the number of vertices being connected to the trailing vertex of the walk. (Contributed by Alexander van der Vekens, 23-Aug-2018.) (Proof shortened by AV, 4-May-2021.)
(𝑊 ∈ ((𝑉 WWalksN 𝐸)‘𝑁) → (#‘{𝑤 ∈ ((𝑉 WWalksN 𝐸)‘(𝑁 + 1)) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {( lastS ‘𝑊), ( lastS ‘𝑤)} ∈ ran 𝐸)}) = (#‘{𝑛𝑉 ∣ {( lastS ‘𝑊), 𝑛} ∈ ran 𝐸}))
    < 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 >