Theorem frgrwopreglem1 30179

Description: Lemma 1 for frgrwopreg 30190: the classes 𝐴 and 𝐵 are sets. The definition of 𝐴 and 𝐵 corresponds to definition 3 in [Huneke] p. 2: "Let A be the set of all vertices of degree k, let B be the set of all vertices of degree different from k, ..." (Contributed by Alexander van der Vekens, 31-Dec-2017.) (Revised by AV, 10-May-2021.)

Hypotheses

Ref	Expression
frgrwopreg.v	⊢ 𝑉 = (Vtx‘𝐺)
frgrwopreg.d	⊢ 𝐷 = (VtxDeg‘𝐺)
frgrwopreg.a	⊢ 𝐴 = {𝑥 ∈ 𝑉 ∣ (𝐷‘𝑥) = 𝐾}
frgrwopreg.b	⊢ 𝐵 = (𝑉 ∖ 𝐴)

Assertion

Ref	Expression
frgrwopreglem1	⊢ (𝐴 ∈ V ∧ 𝐵 ∈ V)

Distinct variable group:   𝑥,𝑉

Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)   𝐷(𝑥)   𝐺(𝑥)   𝐾(𝑥)

Proof of Theorem frgrwopreglem1

Step	Hyp	Ref	Expression
1		frgrwopreg.v	. . 3 ⊢ 𝑉 = (Vtx‘𝐺)
2	1	fvexi 6908	. 2 ⊢ 𝑉 ∈ V
3		frgrwopreg.a	. . . 4 ⊢ 𝐴 = {𝑥 ∈ 𝑉 ∣ (𝐷‘𝑥) = 𝐾}
4		rabexg 5333	. . . 4 ⊢ (𝑉 ∈ V → {𝑥 ∈ 𝑉 ∣ (𝐷‘𝑥) = 𝐾} ∈ V)
5	3, 4	eqeltrid 2829	. . 3 ⊢ (𝑉 ∈ V → 𝐴 ∈ V)
6		frgrwopreg.b	. . . 4 ⊢ 𝐵 = (𝑉 ∖ 𝐴)
7		difexg 5329	. . . 4 ⊢ (𝑉 ∈ V → (𝑉 ∖ 𝐴) ∈ V)
8	6, 7	eqeltrid 2829	. . 3 ⊢ (𝑉 ∈ V → 𝐵 ∈ V)
9	5, 8	jca 510	. 2 ⊢ (𝑉 ∈ V → (𝐴 ∈ V ∧ 𝐵 ∈ V))
10	2, 9	ax-mp 5	1 ⊢ (𝐴 ∈ V ∧ 𝐵 ∈ V)

Syntax hints:   ∧ wa 394   = wceq 1533   ∈ wcel 2098  {crab 3419  Vcvv 3463   ∖ cdif 3942  ‘cfv 6547  Vtxcvtx 28866  VtxDegcvtxdg 29336

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-ext 2696  ax-sep 5299  ax-nul 5306

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-sb 2060  df-clab 2703  df-cleq 2717  df-clel 2802  df-ne 2931  df-rab 3420  df-v 3465  df-dif 3948  df-un 3950  df-in 3952  df-ss 3962  df-nul 4324  df-sn 4630  df-pr 4632  df-uni 4909  df-iota 6499  df-fv 6555

This theorem is referenced by:  frgrwopreg2  30186  frgrwopreglem5  30188  frgrwopreglem5ALT  30189  frgrwopreg  30190

Otomatik - 173.255.232.114 CloudFlare DNS Türk Telekom DNS Google DNS Open DNS

OSZAR »