Theorem frgrwopreglem1 28676

Description: Lemma 1 for frgrwopreg 28687: 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 6788	. 2 ⊢ 𝑉 ∈ V
3		frgrwopreg.a	. . . 4 ⊢ 𝐴 = {𝑥 ∈ 𝑉 ∣ (𝐷‘𝑥) = 𝐾}
4		rabexg 5255	. . . 4 ⊢ (𝑉 ∈ V → {𝑥 ∈ 𝑉 ∣ (𝐷‘𝑥) = 𝐾} ∈ V)
5	3, 4	eqeltrid 2843	. . 3 ⊢ (𝑉 ∈ V → 𝐴 ∈ V)
6		frgrwopreg.b	. . . 4 ⊢ 𝐵 = (𝑉 ∖ 𝐴)
7		difexg 5251	. . . 4 ⊢ (𝑉 ∈ V → (𝑉 ∖ 𝐴) ∈ V)
8	6, 7	eqeltrid 2843	. . 3 ⊢ (𝑉 ∈ V → 𝐵 ∈ V)
9	5, 8	jca 512	. 2 ⊢ (𝑉 ∈ V → (𝐴 ∈ V ∧ 𝐵 ∈ V))
10	2, 9	ax-mp 5	1 ⊢ (𝐴 ∈ V ∧ 𝐵 ∈ V)

Syntax hints:   ∧ wa 396   = wceq 1539   ∈ wcel 2106  {crab 3068  Vcvv 3432   ∖ cdif 3884  ‘cfv 6433  Vtxcvtx 27366  VtxDegcvtxdg 27832

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-sn 4562  df-pr 4564  df-uni 4840  df-iota 6391  df-fv 6441

This theorem is referenced by:  frgrwopreg2  28683  frgrwopreglem5  28685  frgrwopreglem5ALT  28686  frgrwopreg  28687