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 27043

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 26540	. . . . . 6 ⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅) → (𝐺 ∈ UHGraph ↔ (iEdg‘𝐺) = ∅))
2	1	biimpd 230	. . . . 5 ⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅) → (𝐺 ∈ UHGraph → (iEdg‘𝐺) = ∅))
3	2	ex 413	. . . 4 ⊢ (𝐺 ∈ UHGraph → ((Vtx‘𝐺) = ∅ → (𝐺 ∈ UHGraph → (iEdg‘𝐺) = ∅)))
4	3	pm2.43a 54	. . 3 ⊢ (𝐺 ∈ UHGraph → ((Vtx‘𝐺) = ∅ → (iEdg‘𝐺) = ∅))
5	4	imp 407	. 2 ⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅) → (iEdg‘𝐺) = ∅)
6		0vtxrusgr 27042	. 2 ⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅ ∧ (iEdg‘𝐺) = ∅) → ∀𝑘 ∈ ℕ₀^* 𝐺RegUSGraph𝑘)
7	5, 6	mpd3an3 1454	1 ⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅) → ∀𝑘 ∈ ℕ₀^* 𝐺RegUSGraph𝑘)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 = wceq 1522 ∈ wcel 2080 ∀wral 3104 ∅c0 4213 class class class wbr 4964 ‘cfv 6228 ℕ₀^*cxnn0 11817 Vtxcvtx 26464 iEdgciedg 26465 UHGraphcuhgr 26524 RegUSGraphcrusgr 27021

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1778 ax-4 1792 ax-5 1889 ax-6 1948 ax-7 1993 ax-8 2082 ax-9 2090 ax-10 2111 ax-11 2125 ax-12 2140 ax-13 2343 ax-ext 2768 ax-sep 5097 ax-nul 5104 ax-pow 5160 ax-pr 5224 ax-un 7322 ax-resscn 10443 ax-1cn 10444 ax-icn 10445 ax-addcl 10446 ax-addrcl 10447 ax-mulcl 10448 ax-mulrcl 10449 ax-i2m1 10454 ax-1ne0 10455 ax-rrecex 10458 ax-cnre 10459 ax-pre-lttri 10460 ax-pre-lttrn 10461

This theorem depends on definitions: df-bi 208 df-an 397 df-or 843 df-3or 1081 df-3an 1082 df-tru 1525 df-ex 1763 df-nf 1767 df-sb 2042 df-mo 2575 df-eu 2611 df-clab 2775 df-cleq 2787 df-clel 2862 df-nfc 2934 df-ne 2984 df-nel 3090 df-ral 3109 df-rex 3110 df-rab 3113 df-v 3438 df-sbc 3708 df-csb 3814 df-dif 3864 df-un 3866 df-in 3868 df-ss 3876 df-nul 4214 df-if 4384 df-pw 4457 df-sn 4475 df-pr 4477 df-op 4481 df-uni 4748 df-br 4965 df-opab 5027 df-mpt 5044 df-id 5351 df-po 5365 df-so 5366 df-xp 5452 df-rel 5453 df-cnv 5454 df-co 5455 df-dm 5456 df-rn 5457 df-res 5458 df-ima 5459 df-iota 6192 df-fun 6230 df-fn 6231 df-f 6232 df-f1 6233 df-fo 6234 df-f1o 6235 df-fv 6236 df-ov 7022 df-er 8142 df-en 8361 df-dom 8362 df-sdom 8363 df-pnf 10526 df-mnf 10527 df-xr 10528 df-ltxr 10529 df-le 10530 df-2 11550 df-uhgr 26526 df-upgr 26550 df-uspgr 26618 df-usgr 26619 df-rgr 27022 df-rusgr 27023

This theorem is referenced by: (None)

W3C validator