0vtxrusgr - Metamath Proof Explorer

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

Theorem 0vtxrusgr 29101

Description: A graph with no vertices and an empty edge function 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
0vtxrusgr	⊢ ((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅ ∧ (iEdg‘𝐺) = ∅) → ∀𝑘 ∈ ℕ₀^* 𝐺 RegUSGraph 𝑘)

Distinct variable groups: 𝑘,𝐺 𝑘,𝑊

Proof of Theorem 0vtxrusgr Dummy variable 𝑣 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		usgr0v 28765	. . . 4 ⊢ ((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅ ∧ (iEdg‘𝐺) = ∅) → 𝐺 ∈ USGraph)
2	1	adantr 479	. . 3 ⊢ (((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅ ∧ (iEdg‘𝐺) = ∅) ∧ 𝑘 ∈ ℕ₀^*) → 𝐺 ∈ USGraph)
3		0vtxrgr 29100	. . . . . 6 ⊢ ((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅) → ∀𝑣 ∈ ℕ₀^* 𝐺 RegGraph 𝑣)
4		breq2 5151	. . . . . . 7 ⊢ (𝑣 = 𝑘 → (𝐺 RegGraph 𝑣 ↔ 𝐺 RegGraph 𝑘))
5	4	rspccv 3608	. . . . . 6 ⊢ (∀𝑣 ∈ ℕ₀^* 𝐺 RegGraph 𝑣 → (𝑘 ∈ ℕ₀^* → 𝐺 RegGraph 𝑘))
6	3, 5	syl 17	. . . . 5 ⊢ ((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅) → (𝑘 ∈ ℕ₀^* → 𝐺 RegGraph 𝑘))
7	6	3adant3 1130	. . . 4 ⊢ ((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅ ∧ (iEdg‘𝐺) = ∅) → (𝑘 ∈ ℕ₀^* → 𝐺 RegGraph 𝑘))
8	7	imp 405	. . 3 ⊢ (((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅ ∧ (iEdg‘𝐺) = ∅) ∧ 𝑘 ∈ ℕ₀^*) → 𝐺 RegGraph 𝑘)
9		isrusgr 29085	. . . 4 ⊢ ((𝐺 ∈ 𝑊 ∧ 𝑘 ∈ ℕ₀^*) → (𝐺 RegUSGraph 𝑘 ↔ (𝐺 ∈ USGraph ∧ 𝐺 RegGraph 𝑘)))
10	9	3ad2antl1 1183	. . 3 ⊢ (((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅ ∧ (iEdg‘𝐺) = ∅) ∧ 𝑘 ∈ ℕ₀^*) → (𝐺 RegUSGraph 𝑘 ↔ (𝐺 ∈ USGraph ∧ 𝐺 RegGraph 𝑘)))
11	2, 8, 10	mpbir2and 709	. 2 ⊢ (((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅ ∧ (iEdg‘𝐺) = ∅) ∧ 𝑘 ∈ ℕ₀^*) → 𝐺 RegUSGraph 𝑘)
12	11	ralrimiva 3144	1 ⊢ ((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅ ∧ (iEdg‘𝐺) = ∅) → ∀𝑘 ∈ ℕ₀^* 𝐺 RegUSGraph 𝑘)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 ∧ w3a 1085 = wceq 1539 ∈ wcel 2104 ∀wral 3059 ∅c0 4321 class class class wbr 5147 ‘cfv 6542 ℕ₀^*cxnn0 12548 Vtxcvtx 28523 iEdgciedg 28524 USGraphcusgr 28676 RegGraph crgr 29079 RegUSGraph crusgr 29080

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7727 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-i2m1 11180 ax-1ne0 11181 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187

This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-nfc 2883 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rab 3431 df-v 3474 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-br 5148 df-opab 5210 df-mpt 5231 df-id 5573 df-po 5587 df-so 5588 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-ov 7414 df-er 8705 df-en 8942 df-dom 8943 df-sdom 8944 df-pnf 11254 df-mnf 11255 df-xr 11256 df-ltxr 11257 df-le 11258 df-2 12279 df-uhgr 28585 df-upgr 28609 df-uspgr 28677 df-usgr 28678 df-rgr 29081 df-rusgr 29082

This theorem is referenced by: 0uhgrrusgr 29102 0grrusgr 29103

W3C validator