Theorem 0vtxrgr 29670

Description: A null graph (with no vertices) is k-regular for every k. (Contributed by Alexander van der Vekens, 10-Jul-2018.) (Revised by AV, 26-Dec-2020.)

Assertion

Ref	Expression
0vtxrgr	⊢ ((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅) → ∀𝑘 ∈ ℕ0* 𝐺 RegGraph 𝑘)

Distinct variable groups:   𝑘,𝐺   𝑘,𝑊

Proof of Theorem 0vtxrgr

Dummy variable 𝑣 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr 485	. . 3 ⊢ (((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅) ∧ 𝑘 ∈ ℕ0*) → 𝑘 ∈ ℕ0*)
2		rzal 4429	. . . 4 ⊢ ((Vtx‘𝐺) = ∅ → ∀𝑣 ∈ (Vtx‘𝐺)((VtxDeg‘𝐺)‘𝑣) = 𝑘)
3	2	ad2antlr 733	. . 3 ⊢ (((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅) ∧ 𝑘 ∈ ℕ0*) → ∀𝑣 ∈ (Vtx‘𝐺)((VtxDeg‘𝐺)‘𝑣) = 𝑘)
4		eqid 2740	. . . . 5 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
5		eqid 2740	. . . . 5 ⊢ (VtxDeg‘𝐺) = (VtxDeg‘𝐺)
6	4, 5	isrgr 29653	. . . 4 ⊢ ((𝐺 ∈ 𝑊 ∧ 𝑘 ∈ ℕ0*) → (𝐺 RegGraph 𝑘 ↔ (𝑘 ∈ ℕ0* ∧ ∀𝑣 ∈ (Vtx‘𝐺)((VtxDeg‘𝐺)‘𝑣) = 𝑘)))
7	6	adantlr 721	. . 3 ⊢ (((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅) ∧ 𝑘 ∈ ℕ0*) → (𝐺 RegGraph 𝑘 ↔ (𝑘 ∈ ℕ0* ∧ ∀𝑣 ∈ (Vtx‘𝐺)((VtxDeg‘𝐺)‘𝑣) = 𝑘)))
8	1, 3, 7	mpbir2and 719	. 2 ⊢ (((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅) ∧ 𝑘 ∈ ℕ0*) → 𝐺 RegGraph 𝑘)
9	8	ralrimiva 3132	1 ⊢ ((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅) → ∀𝑘 ∈ ℕ0* 𝐺 RegGraph 𝑘)

Syntax hints:   → wi 4   ↔ wb 207   ∧ wa 396   = wceq 1547   ∈ wcel 2119  ∀wral 3054  ∅c0 4268   class class class wbr 5079  ‘cfv 6492  ℕ₀^*cxnn0 12508  Vtxcvtx 29090  VtxDegcvtxdg 29559   RegGraph crgr 29649

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2712  ax-sep 5225  ax-pr 5369

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2719  df-cleq 2732  df-clel 2815  df-ral 3055  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-br 5080  df-opab 5142  df-iota 6448  df-fv 6500  df-rgr 29651

This theorem is referenced by:  0vtxrusgr  29671