Theorem usgr0eop 29562

Description: The empty graph, with vertices but no edges, is a simple graph. (Contributed by Alexander van der Vekens, 10-Aug-2017.) (Revised by AV, 16-Oct-2020.)

Assertion

Ref	Expression
usgr0eop	⊢ (𝑉 ∈ 𝑊 → ⟨𝑉, ∅⟩ ∈ USGraph)

Proof of Theorem usgr0eop

Step	Hyp	Ref	Expression
1		opex 5445	. . 3 ⊢ ⟨𝑉, ∅⟩ ∈ V
2	1	a1i 11	. 2 ⊢ (𝑉 ∈ 𝑊 → ⟨𝑉, ∅⟩ ∈ V)
3		0ex 5269	. . 3 ⊢ ∅ ∈ V
4		opiedgfv 29323	. . 3 ⊢ ((𝑉 ∈ 𝑊 ∧ ∅ ∈ V) → (iEdg‘⟨𝑉, ∅⟩) = ∅)
5	3, 4	mpan2 703	. 2 ⊢ (𝑉 ∈ 𝑊 → (iEdg‘⟨𝑉, ∅⟩) = ∅)
6	2, 5	usgr0e 29552	1 ⊢ (𝑉 ∈ 𝑊 → ⟨𝑉, ∅⟩ ∈ USGraph)

Syntax hints:   → wi 4   = wceq 1568   ∈ wcel 2141  Vcvv 3453  ∅c0 4285  ⟨cop 4594  ‘cfv 6536  iEdgciedg 29313  USGraphcusgr 29465

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5256  ax-nul 5268  ax-pr 5404  ax-un 7732

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-nf 1812  df-sb 2095  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3415  df-v 3455  df-sbc 3744  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fv 6544  df-2nd 7986  df-iedg 29315  df-usgr 29467

This theorem is referenced by:  rgrusgrprc  29905