| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > relsubgr | Structured version Visualization version GIF version | ||
| Description: The class of the subgraph relation is a relation. (Contributed by AV, 16-Nov-2020.) |
| Ref | Expression |
|---|---|
| relsubgr | ⊢ Rel SubGraph |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-subgr 29343 | . 2 ⊢ SubGraph = {〈𝑠, 𝑔〉 ∣ ((Vtx‘𝑠) ⊆ (Vtx‘𝑔) ∧ (iEdg‘𝑠) = ((iEdg‘𝑔) ↾ dom (iEdg‘𝑠)) ∧ (Edg‘𝑠) ⊆ 𝒫 (Vtx‘𝑠))} | |
| 2 | 1 | relopabiv 5769 | 1 ⊢ Rel SubGraph |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ w3a 1086 = wceq 1541 ⊆ wss 3901 𝒫 cpw 4554 dom cdm 5624 ↾ cres 5626 Rel wrel 5629 ‘cfv 6492 Vtxcvtx 29071 iEdgciedg 29072 Edgcedg 29122 SubGraph csubgr 29342 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1544 df-ex 1781 df-sb 2068 df-clab 2715 df-cleq 2728 df-clel 2811 df-v 3442 df-ss 3918 df-opab 5161 df-xp 5630 df-rel 5631 df-subgr 29343 |
| This theorem is referenced by: subgrv 29345 |
| Copyright terms: Public domain | W3C validator |