MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  frgrwopreglem3 Structured version   Visualization version   GIF version

Theorem frgrwopreglem3 30974
Description: Lemma 3 for frgrwopreg 30983. The vertices in the sets 𝐴 and 𝐵 have different degrees. (Contributed by Alexander van der Vekens, 30-Dec-2017.) (Revised by AV, 10-May-2021.) (Proof shortened by AV, 2-Jan-2022.)
Hypotheses
Ref Expression
frgrwopreg.v 𝑉 = (Vtx‘𝐺)
frgrwopreg.d 𝐷 = (VtxDeg‘𝐺)
frgrwopreg.a 𝐴 = {𝑥 ∈ 𝑉 ∣ (𝐷‘𝑥) = 𝐾}
frgrwopreg.b 𝐵 = (𝑉 ∖ 𝐴)
Assertion
Ref Expression
frgrwopreglem3 ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) → (𝐷‘𝑋) ≠ (𝐷‘𝑌))
Distinct variable groups:   𝑥,𝑉   𝑥,𝐴   𝑥,𝐺   𝑥,𝐾   𝑥,𝐷   𝑥,𝑋   𝑥,𝑌
Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem frgrwopreglem3
StepHypRef Expression
1 fveqeq2 6924 . . . . 5 (𝑥 = 𝑌 → ((𝐷‘𝑥) = 𝐾 ↔ (𝐷‘𝑌) = 𝐾))
21notbid 321 . . . 4 (𝑥 = 𝑌 → (¬ (𝐷‘𝑥) = 𝐾 ↔ ¬ (𝐷‘𝑌) = 𝐾))
3 frgrwopreg.b . . . . 5 𝐵 = (𝑉 ∖ 𝐴)
4 frgrwopreg.a . . . . . 6 𝐴 = {𝑥 ∈ 𝑉 ∣ (𝐷‘𝑥) = 𝐾}
54difeq2i 4062 . . . . 5 (𝑉 ∖ 𝐴) = (𝑉 ∖ {𝑥 ∈ 𝑉 ∣ (𝐷‘𝑥) = 𝐾})
6 notrab 4269 . . . . 5 (𝑉 ∖ {𝑥 ∈ 𝑉 ∣ (𝐷‘𝑥) = 𝐾}) = {𝑥 ∈ 𝑉 ∣ ¬ (𝐷‘𝑥) = 𝐾}
73, 5, 63eqtri 2793 . . . 4 𝐵 = {𝑥 ∈ 𝑉 ∣ ¬ (𝐷‘𝑥) = 𝐾}
82, 7elrab2 3651 . . 3 (𝑌 ∈ 𝐵 ↔ (𝑌 ∈ 𝑉 ∧ ¬ (𝐷‘𝑌) = 𝐾))
9 fveqeq2 6924 . . . . . 6 (𝑥 = 𝑋 → ((𝐷‘𝑥) = 𝐾 ↔ (𝐷‘𝑋) = 𝐾))
109, 4elrab2 3651 . . . . 5 (𝑋 ∈ 𝐴 ↔ (𝑋 ∈ 𝑉 ∧ (𝐷‘𝑋) = 𝐾))
11 eqeq2 2778 . . . . . . 7 ((𝐷‘𝑋) = 𝐾 → ((𝐷‘𝑌) = (𝐷‘𝑋) ↔ (𝐷‘𝑌) = 𝐾))
1211notbid 321 . . . . . 6 ((𝐷‘𝑋) = 𝐾 → (¬ (𝐷‘𝑌) = (𝐷‘𝑋) ↔ ¬ (𝐷‘𝑌) = 𝐾))
13 neqne 2970 . . . . . . 7 (¬ (𝐷‘𝑌) = (𝐷‘𝑋) → (𝐷‘𝑌) ≠ (𝐷‘𝑋))
1413necomd 3017 . . . . . 6 (¬ (𝐷‘𝑌) = (𝐷‘𝑋) → (𝐷‘𝑋) ≠ (𝐷‘𝑌))
1512, 14biimtrrdi 257 . . . . 5 ((𝐷‘𝑋) = 𝐾 → (¬ (𝐷‘𝑌) = 𝐾 → (𝐷‘𝑋) ≠ (𝐷‘𝑌)))
1610, 15simplbiim 514 . . . 4 (𝑋 ∈ 𝐴 → (¬ (𝐷‘𝑌) = 𝐾 → (𝐷‘𝑋) ≠ (𝐷‘𝑌)))
1716com12 33 . . 3 (¬ (𝐷‘𝑌) = 𝐾 → (𝑋 ∈ 𝐴 → (𝐷‘𝑋) ≠ (𝐷‘𝑌)))
188, 17simplbiim 514 . 2 (𝑌 ∈ 𝐵 → (𝑋 ∈ 𝐴 → (𝐷‘𝑋) ≠ (𝐷‘𝑌)))
1918impcom 413 1 ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) → (𝐷‘𝑋) ≠ (𝐷‘𝑌))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1572   ∈ wcel 2150   ≠ wne 2962  {crab 3415   ∖ cdif 4047  ‘cfv 6565  Vtxcvtx 29633  VtxDegcvtxdg 30105
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-12 2219  ax-ext 2738
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-ne 2963  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-br 5108  df-iota 6519  df-fv 6573
This theorem is used by:  frgrwopreglem4  30975  frgrwopreglem5lem  30980
  Copyright terms: Public domain W3C validator