Theorem frgrwopreglem5lem 28684

Description: Lemma for frgrwopreglem5 28685. (Contributed by AV, 5-Feb-2022.)

Hypotheses

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

Assertion

Ref	Expression
frgrwopreglem5lem	⊢ (((𝑎 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑏 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝐷‘𝑎) = (𝐷‘𝑥) ∧ (𝐷‘𝑎) ≠ (𝐷‘𝑏) ∧ (𝐷‘𝑥) ≠ (𝐷‘𝑦)))

Distinct variable groups:   𝑥,𝑉   𝑥,𝐴   𝑥,𝐺   𝑥,𝐾   𝑥,𝐷   𝐴,𝑏   𝑥,𝐵   𝑦,𝐷   𝐺,𝑎,𝑏,𝑦,𝑥   𝑦,𝑉

Allowed substitution hints:   𝐴(𝑦,𝑎)   𝐵(𝑦,𝑎,𝑏)   𝐷(𝑎,𝑏)   𝐸(𝑥,𝑦,𝑎,𝑏)   𝐾(𝑦,𝑎,𝑏)   𝑉(𝑎,𝑏)

Proof of Theorem frgrwopreglem5lem

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		frgrwopreg.a	. . . . . 6 ⊢ 𝐴 = {𝑥 ∈ 𝑉 ∣ (𝐷‘𝑥) = 𝐾}
2	1	rabeq2i 3422	. . . . 5 ⊢ (𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝑉 ∧ (𝐷‘𝑥) = 𝐾))
3		fveqeq2 6783	. . . . . . 7 ⊢ (𝑥 = 𝑎 → ((𝐷‘𝑥) = 𝐾 ↔ (𝐷‘𝑎) = 𝐾))
4	3, 1	elrab2 3627	. . . . . 6 ⊢ (𝑎 ∈ 𝐴 ↔ (𝑎 ∈ 𝑉 ∧ (𝐷‘𝑎) = 𝐾))
5		eqtr3 2764	. . . . . . . . 9 ⊢ (((𝐷‘𝑎) = 𝐾 ∧ (𝐷‘𝑥) = 𝐾) → (𝐷‘𝑎) = (𝐷‘𝑥))
6	5	expcom 414	. . . . . . . 8 ⊢ ((𝐷‘𝑥) = 𝐾 → ((𝐷‘𝑎) = 𝐾 → (𝐷‘𝑎) = (𝐷‘𝑥)))
7	6	adantl 482	. . . . . . 7 ⊢ ((𝑥 ∈ 𝑉 ∧ (𝐷‘𝑥) = 𝐾) → ((𝐷‘𝑎) = 𝐾 → (𝐷‘𝑎) = (𝐷‘𝑥)))
8	7	com12 32	. . . . . 6 ⊢ ((𝐷‘𝑎) = 𝐾 → ((𝑥 ∈ 𝑉 ∧ (𝐷‘𝑥) = 𝐾) → (𝐷‘𝑎) = (𝐷‘𝑥)))
9	4, 8	simplbiim 505	. . . . 5 ⊢ (𝑎 ∈ 𝐴 → ((𝑥 ∈ 𝑉 ∧ (𝐷‘𝑥) = 𝐾) → (𝐷‘𝑎) = (𝐷‘𝑥)))
10	2, 9	syl5bi 241	. . . 4 ⊢ (𝑎 ∈ 𝐴 → (𝑥 ∈ 𝐴 → (𝐷‘𝑎) = (𝐷‘𝑥)))
11	10	imp 407	. . 3 ⊢ ((𝑎 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝐷‘𝑎) = (𝐷‘𝑥))
12	11	adantr 481	. 2 ⊢ (((𝑎 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑏 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝐷‘𝑎) = (𝐷‘𝑥))
13		frgrwopreg.v	. . . 4 ⊢ 𝑉 = (Vtx‘𝐺)
14		frgrwopreg.d	. . . 4 ⊢ 𝐷 = (VtxDeg‘𝐺)
15		frgrwopreg.b	. . . 4 ⊢ 𝐵 = (𝑉 ∖ 𝐴)
16	13, 14, 1, 15	frgrwopreglem3 28678	. . 3 ⊢ ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) → (𝐷‘𝑎) ≠ (𝐷‘𝑏))
17	16	ad2ant2r 744	. 2 ⊢ (((𝑎 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑏 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝐷‘𝑎) ≠ (𝐷‘𝑏))
18		fveqeq2 6783	. . . . . 6 ⊢ (𝑥 = 𝑧 → ((𝐷‘𝑥) = 𝐾 ↔ (𝐷‘𝑧) = 𝐾))
19	18	cbvrabv 3426	. . . . 5 ⊢ {𝑥 ∈ 𝑉 ∣ (𝐷‘𝑥) = 𝐾} = {𝑧 ∈ 𝑉 ∣ (𝐷‘𝑧) = 𝐾}
20	1, 19	eqtri 2766	. . . 4 ⊢ 𝐴 = {𝑧 ∈ 𝑉 ∣ (𝐷‘𝑧) = 𝐾}
21	13, 14, 20, 15	frgrwopreglem3 28678	. . 3 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝐷‘𝑥) ≠ (𝐷‘𝑦))
22	21	ad2ant2l 743	. 2 ⊢ (((𝑎 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑏 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝐷‘𝑥) ≠ (𝐷‘𝑦))
23	12, 17, 22	3jca 1127	1 ⊢ (((𝑎 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑏 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝐷‘𝑎) = (𝐷‘𝑥) ∧ (𝐷‘𝑎) ≠ (𝐷‘𝑏) ∧ (𝐷‘𝑥) ≠ (𝐷‘𝑦)))

Syntax hints:   → wi 4   ∧ wa 396   ∧ w3a 1086   = wceq 1539   ∈ wcel 2106   ≠ wne 2943  {crab 3068   ∖ cdif 3884  ‘cfv 6433  Vtxcvtx 27366  Edgcedg 27417  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-12 2171  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-ne 2944  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-iota 6391  df-fv 6441

This theorem is referenced by:  frgrwopreglem5  28685