Theorem relsubgr 29715

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.

Step	Hyp	Ref	Expression
1		df-subgr 29714	. 2 ⊢ SubGraph = {⟨𝑠, 𝑔⟩ ∣ ((Vtx‘𝑠) ⊆ (Vtx‘𝑔) ∧ (iEdg‘𝑠) = ((iEdg‘𝑔) ↾ dom (iEdg‘𝑠)) ∧ (Edg‘𝑠) ⊆ 𝒫 (Vtx‘𝑠))}
2	1	relopabiv 5805	1 ⊢ Rel SubGraph

This proof depends on syntax axioms:   ∧ w3a 1103   = wceq 1570   ⊆ wss 3902  𝒫 cpw 4560  dom cdm 5659   ↾ cres 5661  Rel wrel 5664  ‘cfv 6537  Vtxcvtx 29439  iEdgciedg 29440  Edgcedg 29490   SubGraph csubgr 29713

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-v 3455  df-ss 3919  df-opab 5172  df-xp 5665  df-rel 5666  df-subgr 29714

This theorem is used by:  subgrv  29716