MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  relsubgr Structured version   Visualization version   GIF version

Theorem relsubgr 29850
Description: The class of the subgraph relation is a relation. (Contributed by AV, 16-Nov-2020.)
Assertion
Ref Expression
relsubgr Rel SubGraph

Proof of Theorem relsubgr
Dummy variables 𝑔 𝑠 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-subgr 29849 . 2 SubGraph = {⟨𝑠, 𝑔⟩ ∣ ((Vtx‘𝑠) ⊆ (Vtx‘𝑔) ∧ (iEdg‘𝑠) = ((iEdg‘𝑔) ↾ dom (iEdg‘𝑠)) ∧ (Edg‘𝑠) ⊆ 𝒫 (Vtx‘𝑠))}
21relopabiv 5797 1 Rel SubGraph
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∧ w3a 1103   = wceq 1569   ⊆ wss 3895  𝒫 cpw 4556  dom cdm 5650   ↾ cres 5652  Rel wrel 5655  ‘cfv 6538  Vtxcvtx 29574  iEdgciedg 29575  Edgcedg 29625   SubGraph csubgr 29848
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452  df-ss 3896  df-opab 5167  df-xp 5656  df-rel 5657  df-subgr 29849
This theorem is used by:  subgrv  29851
  Copyright terms: Public domain W3C validator