Metamath Proof Explorer


Theorem upgredgssspr

Description: The set of edges of a pseudograph is a subset of the set of unordered pairs of vertices. (Contributed by AV, 24-Nov-2021)

Ref Expression
Assertion upgredgssspr ⊢ G ∈ UPGraph → Edg ⁡ G ⊆ Pairs ⁡ Vtx ⁡ G

Proof

Step Hyp Ref Expression
1 upgredgss ⊢ G ∈ UPGraph → Edg ⁡ G ⊆ p ∈ 𝒫 Vtx ⁡ G ∖ ∅ | p ≤ 2
2 fvex ⊢ Vtx ⁡ G ∈ V
3 sprvalpwle2 ⊢ Vtx ⁡ G ∈ V → Pairs ⁡ Vtx ⁡ G = p ∈ 𝒫 Vtx ⁡ G ∖ ∅ | p ≤ 2
4 2 3 ax-mp ⊢ Pairs ⁡ Vtx ⁡ G = p ∈ 𝒫 Vtx ⁡ G ∖ ∅ | p ≤ 2
5 1 4 sseqtrrdi ⊢ G ∈ UPGraph → Edg ⁡ G ⊆ Pairs ⁡ Vtx ⁡ G