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

Theorem frgrwopreglem3 28087
Description: Lemma 3 for frgrwopreg 28096. 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 6673 . . . . 5 (𝑥 = 𝑌 → ((𝐷𝑥) = 𝐾 ↔ (𝐷𝑌) = 𝐾))
21notbid 320 . . . 4 (𝑥 = 𝑌 → (¬ (𝐷𝑥) = 𝐾 ↔ ¬ (𝐷𝑌) = 𝐾))
3 frgrwopreg.b . . . . 5 𝐵 = (𝑉𝐴)
4 frgrwopreg.a . . . . . 6 𝐴 = {𝑥𝑉 ∣ (𝐷𝑥) = 𝐾}
54difeq2i 4095 . . . . 5 (𝑉𝐴) = (𝑉 ∖ {𝑥𝑉 ∣ (𝐷𝑥) = 𝐾})
6 notrab 4279 . . . . 5 (𝑉 ∖ {𝑥𝑉 ∣ (𝐷𝑥) = 𝐾}) = {𝑥𝑉 ∣ ¬ (𝐷𝑥) = 𝐾}
73, 5, 63eqtri 2848 . . . 4 𝐵 = {𝑥𝑉 ∣ ¬ (𝐷𝑥) = 𝐾}
82, 7elrab2 3682 . . 3 (𝑌𝐵 ↔ (𝑌𝑉 ∧ ¬ (𝐷𝑌) = 𝐾))
9 fveqeq2 6673 . . . . . 6 (𝑥 = 𝑋 → ((𝐷𝑥) = 𝐾 ↔ (𝐷𝑋) = 𝐾))
109, 4elrab2 3682 . . . . 5 (𝑋𝐴 ↔ (𝑋𝑉 ∧ (𝐷𝑋) = 𝐾))
11 eqeq2 2833 . . . . . . 7 ((𝐷𝑋) = 𝐾 → ((𝐷𝑌) = (𝐷𝑋) ↔ (𝐷𝑌) = 𝐾))
1211notbid 320 . . . . . 6 ((𝐷𝑋) = 𝐾 → (¬ (𝐷𝑌) = (𝐷𝑋) ↔ ¬ (𝐷𝑌) = 𝐾))
13 neqne 3024 . . . . . . 7 (¬ (𝐷𝑌) = (𝐷𝑋) → (𝐷𝑌) ≠ (𝐷𝑋))
1413necomd 3071 . . . . . 6 (¬ (𝐷𝑌) = (𝐷𝑋) → (𝐷𝑋) ≠ (𝐷𝑌))
1512, 14syl6bir 256 . . . . 5 ((𝐷𝑋) = 𝐾 → (¬ (𝐷𝑌) = 𝐾 → (𝐷𝑋) ≠ (𝐷𝑌)))
1610, 15simplbiim 507 . . . 4 (𝑋𝐴 → (¬ (𝐷𝑌) = 𝐾 → (𝐷𝑋) ≠ (𝐷𝑌)))
1716com12 32 . . 3 (¬ (𝐷𝑌) = 𝐾 → (𝑋𝐴 → (𝐷𝑋) ≠ (𝐷𝑌)))
188, 17simplbiim 507 . 2 (𝑌𝐵 → (𝑋𝐴 → (𝐷𝑋) ≠ (𝐷𝑌)))
1918impcom 410 1 ((𝑋𝐴𝑌𝐵) → (𝐷𝑋) ≠ (𝐷𝑌))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 398   = wceq 1533  wcel 2110  wne 3016  {crab 3142  cdif 3932  cfv 6349  Vtxcvtx 26775  VtxDegcvtxdg 27241
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-rex 3144  df-rab 3147  df-v 3496  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4561  df-pr 4563  df-op 4567  df-uni 4832  df-br 5059  df-iota 6308  df-fv 6357
This theorem is referenced by:  frgrwopreglem4  28088  frgrwopreglem5lem  28093
  Copyright terms: Public domain W3C validator