Metamath Proof Explorer


Theorem spthson

Description: The set of simple paths between two vertices (in an undirected graph). (Contributed by Alexander van der Vekens, 1-Mar-2018) (Revised by AV, 16-Jan-2021) (Revised by AV, 21-Mar-2021)

Ref Expression
Hypothesis pthsonfval.v 𝑉 = ( Vtx ‘ 𝐺 )
Assertion spthson ( ( 𝐴𝑉𝐵𝑉 ) → ( 𝐴 ( SPathsOn ‘ 𝐺 ) 𝐵 ) = { ⟨ 𝑓 , 𝑝 ⟩ ∣ ( 𝑓 ( 𝐴 ( TrailsOn ‘ 𝐺 ) 𝐵 ) 𝑝𝑓 ( SPaths ‘ 𝐺 ) 𝑝 ) } )

Proof

Step Hyp Ref Expression
1 pthsonfval.v 𝑉 = ( Vtx ‘ 𝐺 )
2 1 1vgrex ( 𝐴𝑉𝐺 ∈ V )
3 2 adantr ( ( 𝐴𝑉𝐵𝑉 ) → 𝐺 ∈ V )
4 simpl ( ( 𝐴𝑉𝐵𝑉 ) → 𝐴𝑉 )
5 4 1 eleqtrdi ( ( 𝐴𝑉𝐵𝑉 ) → 𝐴 ∈ ( Vtx ‘ 𝐺 ) )
6 simpr ( ( 𝐴𝑉𝐵𝑉 ) → 𝐵𝑉 )
7 6 1 eleqtrdi ( ( 𝐴𝑉𝐵𝑉 ) → 𝐵 ∈ ( Vtx ‘ 𝐺 ) )
8 df-spthson SPathsOn = ( 𝑔 ∈ V ↦ ( 𝑎 ∈ ( Vtx ‘ 𝑔 ) , 𝑏 ∈ ( Vtx ‘ 𝑔 ) ↦ { ⟨ 𝑓 , 𝑝 ⟩ ∣ ( 𝑓 ( 𝑎 ( TrailsOn ‘ 𝑔 ) 𝑏 ) 𝑝𝑓 ( SPaths ‘ 𝑔 ) 𝑝 ) } ) )
9 3 5 7 8 mptmpoopabovd ( ( 𝐴𝑉𝐵𝑉 ) → ( 𝐴 ( SPathsOn ‘ 𝐺 ) 𝐵 ) = { ⟨ 𝑓 , 𝑝 ⟩ ∣ ( 𝑓 ( 𝐴 ( TrailsOn ‘ 𝐺 ) 𝐵 ) 𝑝𝑓 ( SPaths ‘ 𝐺 ) 𝑝 ) } )