Theorem wlkson 30217

Description: The set of walks between two vertices. (Contributed by Alexander van der Vekens, 12-Dec-2017.) (Revised by AV, 30-Dec-2020.) (Revised by AV, 22-Mar-2021.)

Hypothesis

Ref	Expression
wlkson.v	⊢ 𝑉 = (Vtx‘𝐺)

Assertion

Ref	Expression
wlkson	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐴(WalksOn‘𝐺)𝐵) = {⟨𝑓, 𝑝⟩ ∣ (𝑓(Walks‘𝐺)𝑝 ∧ (𝑝‘0) = 𝐴 ∧ (𝑝‘(♯‘𝑓)) = 𝐵)})

Distinct variable groups:   𝐴,𝑓,𝑝   𝐵,𝑓,𝑝   𝑓,𝐺,𝑝   𝑓,𝑉,𝑝

Proof of Theorem wlkson

Dummy variables 𝑎 𝑏 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		wlkson.v	. . . . 5 ⊢ 𝑉 = (Vtx‘𝐺)
2	1	1vgrex 29562	. . . 4 ⊢ (𝐴 ∈ 𝑉 → 𝐺 ∈ V)
3	2	adantr 486	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → 𝐺 ∈ V)
4		simpl 488	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → 𝐴 ∈ 𝑉)
5	4, 1	eleqtrdi 2871	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → 𝐴 ∈ (Vtx‘𝐺))
6		simpr 490	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → 𝐵 ∈ 𝑉)
7	6, 1	eleqtrdi 2871	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → 𝐵 ∈ (Vtx‘𝐺))
8		eqeq2 2773	. . . 4 ⊢ (𝑎 = 𝐴 → ((𝑝‘0) = 𝑎 ↔ (𝑝‘0) = 𝐴))
9		eqeq2 2773	. . . 4 ⊢ (𝑏 = 𝐵 → ((𝑝‘(♯‘𝑓)) = 𝑏 ↔ (𝑝‘(♯‘𝑓)) = 𝐵))
10	8, 9	bi2anan9 650	. . 3 ⊢ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → (((𝑝‘0) = 𝑎 ∧ (𝑝‘(♯‘𝑓)) = 𝑏) ↔ ((𝑝‘0) = 𝐴 ∧ (𝑝‘(♯‘𝑓)) = 𝐵)))
11		biidd 265	. . 3 ⊢ (𝑔 = 𝐺 → (((𝑝‘0) = 𝑎 ∧ (𝑝‘(♯‘𝑓)) = 𝑏) ↔ ((𝑝‘0) = 𝑎 ∧ (𝑝‘(♯‘𝑓)) = 𝑏)))
12		df-wlkson 30163	. . . 4 ⊢ WalksOn = (𝑔 ∈ V ↦ (𝑎 ∈ (Vtx‘𝑔), 𝑏 ∈ (Vtx‘𝑔) ↦ {⟨𝑓, 𝑝⟩ ∣ (𝑓(Walks‘𝑔)𝑝 ∧ (𝑝‘0) = 𝑎 ∧ (𝑝‘(♯‘𝑓)) = 𝑏)}))
13		eqid 2761	. . . . . 6 ⊢ (Vtx‘𝑔) = (Vtx‘𝑔)
14		3anass 1111	. . . . . . . 8 ⊢ ((𝑓(Walks‘𝑔)𝑝 ∧ (𝑝‘0) = 𝑎 ∧ (𝑝‘(♯‘𝑓)) = 𝑏) ↔ (𝑓(Walks‘𝑔)𝑝 ∧ ((𝑝‘0) = 𝑎 ∧ (𝑝‘(♯‘𝑓)) = 𝑏)))
15	14	biancomi 468	. . . . . . 7 ⊢ ((𝑓(Walks‘𝑔)𝑝 ∧ (𝑝‘0) = 𝑎 ∧ (𝑝‘(♯‘𝑓)) = 𝑏) ↔ (((𝑝‘0) = 𝑎 ∧ (𝑝‘(♯‘𝑓)) = 𝑏) ∧ 𝑓(Walks‘𝑔)𝑝))
16	15	opabbii 5172	. . . . . 6 ⊢ {⟨𝑓, 𝑝⟩ ∣ (𝑓(Walks‘𝑔)𝑝 ∧ (𝑝‘0) = 𝑎 ∧ (𝑝‘(♯‘𝑓)) = 𝑏)} = {⟨𝑓, 𝑝⟩ ∣ (((𝑝‘0) = 𝑎 ∧ (𝑝‘(♯‘𝑓)) = 𝑏) ∧ 𝑓(Walks‘𝑔)𝑝)}
17	13, 13, 16	mpoeq123i 7488	. . . . 5 ⊢ (𝑎 ∈ (Vtx‘𝑔), 𝑏 ∈ (Vtx‘𝑔) ↦ {⟨𝑓, 𝑝⟩ ∣ (𝑓(Walks‘𝑔)𝑝 ∧ (𝑝‘0) = 𝑎 ∧ (𝑝‘(♯‘𝑓)) = 𝑏)}) = (𝑎 ∈ (Vtx‘𝑔), 𝑏 ∈ (Vtx‘𝑔) ↦ {⟨𝑓, 𝑝⟩ ∣ (((𝑝‘0) = 𝑎 ∧ (𝑝‘(♯‘𝑓)) = 𝑏) ∧ 𝑓(Walks‘𝑔)𝑝)})
18	17	mpteq2i 5201	. . . 4 ⊢ (𝑔 ∈ V ↦ (𝑎 ∈ (Vtx‘𝑔), 𝑏 ∈ (Vtx‘𝑔) ↦ {⟨𝑓, 𝑝⟩ ∣ (𝑓(Walks‘𝑔)𝑝 ∧ (𝑝‘0) = 𝑎 ∧ (𝑝‘(♯‘𝑓)) = 𝑏)})) = (𝑔 ∈ V ↦ (𝑎 ∈ (Vtx‘𝑔), 𝑏 ∈ (Vtx‘𝑔) ↦ {⟨𝑓, 𝑝⟩ ∣ (((𝑝‘0) = 𝑎 ∧ (𝑝‘(♯‘𝑓)) = 𝑏) ∧ 𝑓(Walks‘𝑔)𝑝)}))
19	12, 18	eqtri 2784	. . 3 ⊢ WalksOn = (𝑔 ∈ V ↦ (𝑎 ∈ (Vtx‘𝑔), 𝑏 ∈ (Vtx‘𝑔) ↦ {⟨𝑓, 𝑝⟩ ∣ (((𝑝‘0) = 𝑎 ∧ (𝑝‘(♯‘𝑓)) = 𝑏) ∧ 𝑓(Walks‘𝑔)𝑝)}))
20	3, 5, 7, 10, 11, 19	mptmpoopabbrd 8083	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐴(WalksOn‘𝐺)𝐵) = {⟨𝑓, 𝑝⟩ ∣ (((𝑝‘0) = 𝐴 ∧ (𝑝‘(♯‘𝑓)) = 𝐵) ∧ 𝑓(Walks‘𝐺)𝑝)})
21		ancom 466	. . . 4 ⊢ ((((𝑝‘0) = 𝐴 ∧ (𝑝‘(♯‘𝑓)) = 𝐵) ∧ 𝑓(Walks‘𝐺)𝑝) ↔ (𝑓(Walks‘𝐺)𝑝 ∧ ((𝑝‘0) = 𝐴 ∧ (𝑝‘(♯‘𝑓)) = 𝐵)))
22		3anass 1111	. . . 4 ⊢ ((𝑓(Walks‘𝐺)𝑝 ∧ (𝑝‘0) = 𝐴 ∧ (𝑝‘(♯‘𝑓)) = 𝐵) ↔ (𝑓(Walks‘𝐺)𝑝 ∧ ((𝑝‘0) = 𝐴 ∧ (𝑝‘(♯‘𝑓)) = 𝐵)))
23	21, 22	bitr4i 281	. . 3 ⊢ ((((𝑝‘0) = 𝐴 ∧ (𝑝‘(♯‘𝑓)) = 𝐵) ∧ 𝑓(Walks‘𝐺)𝑝) ↔ (𝑓(Walks‘𝐺)𝑝 ∧ (𝑝‘0) = 𝐴 ∧ (𝑝‘(♯‘𝑓)) = 𝐵))
24	23	opabbii 5172	. 2 ⊢ {⟨𝑓, 𝑝⟩ ∣ (((𝑝‘0) = 𝐴 ∧ (𝑝‘(♯‘𝑓)) = 𝐵) ∧ 𝑓(Walks‘𝐺)𝑝)} = {⟨𝑓, 𝑝⟩ ∣ (𝑓(Walks‘𝐺)𝑝 ∧ (𝑝‘0) = 𝐴 ∧ (𝑝‘(♯‘𝑓)) = 𝐵)}
25	20, 24	eqtrdi 2812	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐴(WalksOn‘𝐺)𝐵) = {⟨𝑓, 𝑝⟩ ∣ (𝑓(Walks‘𝐺)𝑝 ∧ (𝑝‘0) = 𝐴 ∧ (𝑝‘(♯‘𝑓)) = 𝐵)})

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  Vcvv 3451   class class class wbr 5103  {copab 5167   ↦ cmpt 5186  ‘cfv 6531  (class class class)co 7412   ∈ cmpo 7414  0cc0 11181  ♯chash 14454  Vtxcvtx 29556  Walkscwlks 30159  WalksOncwlkson 30160

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740

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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7990  df-2nd 7991  df-wlkson 30163

This theorem is used by:  iswlkon  30218  wlkonprop  30219