Theorem umgr0e 27480

Description: The empty graph, with vertices but no edges, is a multigraph. (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by AV, 25-Nov-2020.)

Hypotheses

Ref	Expression
umgr0e.g	⊢ (𝜑 → 𝐺 ∈ 𝑊)
umgr0e.e	⊢ (𝜑 → (iEdg‘𝐺) = ∅)

Assertion

Ref	Expression
umgr0e	⊢ (𝜑 → 𝐺 ∈ UMGraph)

Proof of Theorem umgr0e

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		umgr0e.e	. . . 4 ⊢ (𝜑 → (iEdg‘𝐺) = ∅)
2	1	f10d 6750	. . 3 ⊢ (𝜑 → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2})
3		f1f 6670	. . 3 ⊢ ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2})
4	2, 3	syl 17	. 2 ⊢ (𝜑 → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2})
5		umgr0e.g	. . 3 ⊢ (𝜑 → 𝐺 ∈ 𝑊)
6		eqid 2738	. . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
7		eqid 2738	. . . 4 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺)
8	6, 7	isumgr 27465	. . 3 ⊢ (𝐺 ∈ 𝑊 → (𝐺 ∈ UMGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2}))
9	5, 8	syl 17	. 2 ⊢ (𝜑 → (𝐺 ∈ UMGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2}))
10	4, 9	mpbird 256	1 ⊢ (𝜑 → 𝐺 ∈ UMGraph)

Syntax hints:   → wi 4   ↔ wb 205   = wceq 1539   ∈ wcel 2106  {crab 3068   ∖ cdif 3884  ∅c0 4256  𝒫 cpw 4533  {csn 4561  dom cdm 5589  ⟶wf 6429  –1-1→wf1 6430  ‘cfv 6433  2c2 12028  ♯chash 14044  Vtxcvtx 27366  iEdgciedg 27367  UMGraphcumgr 27451

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-sbc 3717  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fv 6441  df-umgr 27453

This theorem is referenced by:  upgr0e  27481