0uhgrrusgr - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > 0uhgrrusgr		Structured version Visualization version GIF version

Theorem 0uhgrrusgr 29611

Description: The null graph as hypergraph is a k-regular simple graph for every k. (Contributed by Alexander van der Vekens, 10-Jul-2018.) (Revised by AV, 26-Dec-2020.)

**Assertion**
Ref	Expression
0uhgrrusgr	⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅) → ∀𝑘 ∈ ℕ₀^* 𝐺 RegUSGraph 𝑘)

Distinct variable group: 𝑘,𝐺

**Proof of Theorem 0uhgrrusgr**
Step	Hyp	Ref	Expression
1		uhgr0vb 29104	. . . . . 6 ⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅) → (𝐺 ∈ UHGraph ↔ (iEdg‘𝐺) = ∅))
2	1	biimpd 229	. . . . 5 ⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅) → (𝐺 ∈ UHGraph → (iEdg‘𝐺) = ∅))
3	2	ex 412	. . . 4 ⊢ (𝐺 ∈ UHGraph → ((Vtx‘𝐺) = ∅ → (𝐺 ∈ UHGraph → (iEdg‘𝐺) = ∅)))
4	3	pm2.43a 54	. . 3 ⊢ (𝐺 ∈ UHGraph → ((Vtx‘𝐺) = ∅ → (iEdg‘𝐺) = ∅))
5	4	imp 406	. 2 ⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅) → (iEdg‘𝐺) = ∅)
6		0vtxrusgr 29610	. 2 ⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅ ∧ (iEdg‘𝐺) = ∅) → ∀𝑘 ∈ ℕ₀^* 𝐺 RegUSGraph 𝑘)
7	5, 6	mpd3an3 1461	1 ⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅) → ∀𝑘 ∈ ℕ₀^* 𝐺 RegUSGraph 𝑘)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2106 ∀wral 3059 ∅c0 4339 class class class wbr 5148 ‘cfv 6563 ℕ₀^*cxnn0 12597 Vtxcvtx 29028 iEdgciedg 29029 UHGraphcuhgr 29088 RegUSGraph crusgr 29589

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-i2m1 11221 ax-1ne0 11222 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5583 df-po 5597 df-so 5598 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-ov 7434 df-er 8744 df-en 8985 df-dom 8986 df-sdom 8987 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-2 12327 df-uhgr 29090 df-upgr 29114 df-uspgr 29182 df-usgr 29183 df-rgr 29590 df-rusgr 29591

This theorem is referenced by: (None)

W3C validator