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 29596

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 29259	. . . 4 ⊢ ((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅ ∧ (iEdg‘𝐺) = ∅) → 𝐺 ∈ USGraph)
2	1	adantr 480	. . 3 ⊢ (((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅ ∧ (iEdg‘𝐺) = ∅) ∧ 𝑘 ∈ ℕ₀^*) → 𝐺 ∈ USGraph)
3		0vtxrgr 29595	. . . . . 6 ⊢ ((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅) → ∀𝑣 ∈ ℕ₀^* 𝐺 RegGraph 𝑣)
4		breq2 5146	. . . . . . 7 ⊢ (𝑣 = 𝑘 → (𝐺 RegGraph 𝑣 ↔ 𝐺 RegGraph 𝑘))
5	4	rspccv 3618	. . . . . 6 ⊢ (∀𝑣 ∈ ℕ₀^* 𝐺 RegGraph 𝑣 → (𝑘 ∈ ℕ₀^* → 𝐺 RegGraph 𝑘))
6	3, 5	syl 17	. . . . 5 ⊢ ((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅) → (𝑘 ∈ ℕ₀^* → 𝐺 RegGraph 𝑘))
7	6	3adant3 1132	. . . 4 ⊢ ((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅ ∧ (iEdg‘𝐺) = ∅) → (𝑘 ∈ ℕ₀^* → 𝐺 RegGraph 𝑘))
8	7	imp 406	. . 3 ⊢ (((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅ ∧ (iEdg‘𝐺) = ∅) ∧ 𝑘 ∈ ℕ₀^*) → 𝐺 RegGraph 𝑘)
9		isrusgr 29580	. . . 4 ⊢ ((𝐺 ∈ 𝑊 ∧ 𝑘 ∈ ℕ₀^*) → (𝐺 RegUSGraph 𝑘 ↔ (𝐺 ∈ USGraph ∧ 𝐺 RegGraph 𝑘)))
10	9	3ad2antl1 1185	. . 3 ⊢ (((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅ ∧ (iEdg‘𝐺) = ∅) ∧ 𝑘 ∈ ℕ₀^*) → (𝐺 RegUSGraph 𝑘 ↔ (𝐺 ∈ USGraph ∧ 𝐺 RegGraph 𝑘)))
11	2, 8, 10	mpbir2and 713	. 2 ⊢ (((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅ ∧ (iEdg‘𝐺) = ∅) ∧ 𝑘 ∈ ℕ₀^*) → 𝐺 RegUSGraph 𝑘)
12	11	ralrimiva 3145	1 ⊢ ((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅ ∧ (iEdg‘𝐺) = ∅) → ∀𝑘 ∈ ℕ₀^* 𝐺 RegUSGraph 𝑘)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1539 ∈ wcel 2107 ∀wral 3060 ∅c0 4332 class class class wbr 5142 ‘cfv 6560 ℕ₀^*cxnn0 12601 Vtxcvtx 29014 iEdgciedg 29015 USGraphcusgr 29167 RegGraph crgr 29574 RegUSGraph crusgr 29575

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2707 ax-sep 5295 ax-nul 5305 ax-pow 5364 ax-pr 5431 ax-un 7756 ax-resscn 11213 ax-1cn 11214 ax-icn 11215 ax-addcl 11216 ax-addrcl 11217 ax-mulcl 11218 ax-mulrcl 11219 ax-i2m1 11224 ax-1ne0 11225 ax-rrecex 11228 ax-cnre 11229 ax-pre-lttri 11230 ax-pre-lttrn 11231

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2728 df-clel 2815 df-nfc 2891 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-rab 3436 df-v 3481 df-sbc 3788 df-csb 3899 df-dif 3953 df-un 3955 df-in 3957 df-ss 3967 df-nul 4333 df-if 4525 df-pw 4601 df-sn 4626 df-pr 4628 df-op 4632 df-uni 4907 df-br 5143 df-opab 5205 df-mpt 5225 df-id 5577 df-po 5591 df-so 5592 df-xp 5690 df-rel 5691 df-cnv 5692 df-co 5693 df-dm 5694 df-rn 5695 df-res 5696 df-ima 5697 df-iota 6513 df-fun 6562 df-fn 6563 df-f 6564 df-f1 6565 df-fo 6566 df-f1o 6567 df-fv 6568 df-ov 7435 df-er 8746 df-en 8987 df-dom 8988 df-sdom 8989 df-pnf 11298 df-mnf 11299 df-xr 11300 df-ltxr 11301 df-le 11302 df-2 12330 df-uhgr 29076 df-upgr 29100 df-uspgr 29168 df-usgr 29169 df-rgr 29576 df-rusgr 29577

This theorem is referenced by: 0uhgrrusgr 29597 0grrusgr 29598

W3C validator