Theorem uhgr0vusgr 29315

Description: The null graph, with no vertices, represented by a hypergraph, is a simple graph. (Contributed by AV, 5-Dec-2020.)

Assertion

Ref	Expression
uhgr0vusgr	⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅) → 𝐺 ∈ USGraph)

Proof of Theorem uhgr0vusgr

Step	Hyp	Ref	Expression
1		simpl 482	. 2 ⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅) → 𝐺 ∈ UHGraph)
2		eqid 2736	. . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
3		eqid 2736	. . . 4 ⊢ (Edg‘𝐺) = (Edg‘𝐺)
4	2, 3	uhgr0v0e 29311	. . 3 ⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅) → (Edg‘𝐺) = ∅)
5		uhgriedg0edg0 29200	. . . 4 ⊢ (𝐺 ∈ UHGraph → ((Edg‘𝐺) = ∅ ↔ (iEdg‘𝐺) = ∅))
6	5	adantr 480	. . 3 ⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅) → ((Edg‘𝐺) = ∅ ↔ (iEdg‘𝐺) = ∅))
7	4, 6	mpbid 232	. 2 ⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅) → (iEdg‘𝐺) = ∅)
8	1, 7	usgr0e 29309	1 ⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅) → 𝐺 ∈ USGraph)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1541   ∈ wcel 2113  ∅c0 4285  ‘cfv 6492  Vtxcvtx 29069  iEdgciedg 29070  Edgcedg 29120  UHGraphcuhgr 29129  USGraphcusgr 29222

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-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377  ax-un 7680

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-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-sbc 3741  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fv 6500  df-edg 29121  df-uhgr 29131  df-usgr 29224

This theorem is referenced by: (None)