Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > usgrav | Structured version Visualization version GIF version |
Description: The classes of vertices and edges of an undirected simple graph without loops are sets. (Contributed by Alexander van der Vekens, 19-Aug-2017.) |
Ref | Expression |
---|---|
usgrav | ⊢ (𝑉 USGrph 𝐸 → (𝑉 ∈ V ∧ 𝐸 ∈ V)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | relusgra 25864 | . . 3 ⊢ Rel USGrph | |
2 | 1 | brrelexi 5082 | . 2 ⊢ (𝑉 USGrph 𝐸 → 𝑉 ∈ V) |
3 | 1 | brrelex2i 5083 | . 2 ⊢ (𝑉 USGrph 𝐸 → 𝐸 ∈ V) |
4 | 2, 3 | jca 553 | 1 ⊢ (𝑉 USGrph 𝐸 → (𝑉 ∈ V ∧ 𝐸 ∈ V)) |
Copyright terms: Public domain | W3C validator |