Theorem subgrv 29343

Description: If a class is a subgraph of another class, both classes are sets. (Contributed by AV, 16-Nov-2020.)

Assertion

Ref	Expression
subgrv	⊢ (𝑆 SubGraph 𝐺 → (𝑆 ∈ V ∧ 𝐺 ∈ V))

Proof of Theorem subgrv

Step	Hyp	Ref	Expression
1		relsubgr 29342	. 2 ⊢ Rel SubGraph
2	1	brrelex12i 5679	1 ⊢ (𝑆 SubGraph 𝐺 → (𝑆 ∈ V ∧ 𝐺 ∈ V))

Syntax hints:   → wi 4   ∧ wa 395   ∈ wcel 2113  Vcvv 3440   class class class wbr 5098   SubGraph csubgr 29340

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  ax-sep 5241  ax-nul 5251  ax-pr 5377

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-br 5099  df-opab 5161  df-xp 5630  df-rel 5631  df-subgr 29341

This theorem is referenced by:  subgrprop  29346  subgrprop3  29349  subuhgr  29359  subupgr  29360  subumgr  29361  subusgr  29362  subgrwlk  35326  acycgrsubgr  35352