Theorem usgr0eop 27843

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 5403	. . 3 ⊢ ⟨𝑉, ∅⟩ ∈ V
2	1	a1i 11	. 2 ⊢ (𝑉 ∈ 𝑊 → ⟨𝑉, ∅⟩ ∈ V)
3		0ex 5248	. . 3 ⊢ ∅ ∈ V
4		opiedgfv 27607	. . 3 ⊢ ((𝑉 ∈ 𝑊 ∧ ∅ ∈ V) → (iEdg‘⟨𝑉, ∅⟩) = ∅)
5	3, 4	mpan2 688	. 2 ⊢ (𝑉 ∈ 𝑊 → (iEdg‘⟨𝑉, ∅⟩) = ∅)
6	2, 5	usgr0e 27833	1 ⊢ (𝑉 ∈ 𝑊 → ⟨𝑉, ∅⟩ ∈ USGraph)

Syntax hints:   → wi 4   = wceq 1540   ∈ wcel 2105  Vcvv 3441  ∅c0 4268  ⟨cop 4578  ‘cfv 6473  iEdgciedg 27597  USGraphcusgr 27749

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 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2707  ax-sep 5240  ax-nul 5247  ax-pr 5369  ax-un 7642

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2886  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3404  df-v 3443  df-sbc 3727  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4269  df-if 4473  df-pw 4548  df-sn 4573  df-pr 4575  df-op 4579  df-uni 4852  df-br 5090  df-opab 5152  df-mpt 5173  df-id 5512  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-iota 6425  df-fun 6475  df-fn 6476  df-f 6477  df-f1 6478  df-fv 6481  df-2nd 7892  df-iedg 27599  df-usgr 27751

This theorem is referenced by:  rgrusgrprc  28186