| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > frgrwopreglem3 | Structured version Visualization version GIF version | ||
| Description: Lemma 3 for frgrwopreg 30857. 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.) |
| Ref | Expression |
|---|---|
| frgrwopreg.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| frgrwopreg.d | ⊢ 𝐷 = (VtxDeg‘𝐺) |
| frgrwopreg.a | ⊢ 𝐴 = {𝑥 ∈ 𝑉 ∣ (𝐷‘𝑥) = 𝐾} |
| frgrwopreg.b | ⊢ 𝐵 = (𝑉 ∖ 𝐴) |
| Ref | Expression |
|---|---|
| frgrwopreglem3 | ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) → (𝐷‘𝑋) ≠ (𝐷‘𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fveqeq2 6882 | . . . . 5 ⊢ (𝑥 = 𝑌 → ((𝐷‘𝑥) = 𝐾 ↔ (𝐷‘𝑌) = 𝐾)) | |
| 2 | 1 | notbid 321 | . . . 4 ⊢ (𝑥 = 𝑌 → (¬ (𝐷‘𝑥) = 𝐾 ↔ ¬ (𝐷‘𝑌) = 𝐾)) |
| 3 | frgrwopreg.b | . . . . 5 ⊢ 𝐵 = (𝑉 ∖ 𝐴) | |
| 4 | frgrwopreg.a | . . . . . 6 ⊢ 𝐴 = {𝑥 ∈ 𝑉 ∣ (𝐷‘𝑥) = 𝐾} | |
| 5 | 4 | difeq2i 4070 | . . . . 5 ⊢ (𝑉 ∖ 𝐴) = (𝑉 ∖ {𝑥 ∈ 𝑉 ∣ (𝐷‘𝑥) = 𝐾}) |
| 6 | notrab 4267 | . . . . 5 ⊢ (𝑉 ∖ {𝑥 ∈ 𝑉 ∣ (𝐷‘𝑥) = 𝐾}) = {𝑥 ∈ 𝑉 ∣ ¬ (𝐷‘𝑥) = 𝐾} | |
| 7 | 3, 5, 6 | 3eqtri 2787 | . . . 4 ⊢ 𝐵 = {𝑥 ∈ 𝑉 ∣ ¬ (𝐷‘𝑥) = 𝐾} |
| 8 | 2, 7 | elrab2 3648 | . . 3 ⊢ (𝑌 ∈ 𝐵 ↔ (𝑌 ∈ 𝑉 ∧ ¬ (𝐷‘𝑌) = 𝐾)) |
| 9 | fveqeq2 6882 | . . . . . 6 ⊢ (𝑥 = 𝑋 → ((𝐷‘𝑥) = 𝐾 ↔ (𝐷‘𝑋) = 𝐾)) | |
| 10 | 9, 4 | elrab2 3648 | . . . . 5 ⊢ (𝑋 ∈ 𝐴 ↔ (𝑋 ∈ 𝑉 ∧ (𝐷‘𝑋) = 𝐾)) |
| 11 | eqeq2 2772 | . . . . . . 7 ⊢ ((𝐷‘𝑋) = 𝐾 → ((𝐷‘𝑌) = (𝐷‘𝑋) ↔ (𝐷‘𝑌) = 𝐾)) | |
| 12 | 11 | notbid 321 | . . . . . 6 ⊢ ((𝐷‘𝑋) = 𝐾 → (¬ (𝐷‘𝑌) = (𝐷‘𝑋) ↔ ¬ (𝐷‘𝑌) = 𝐾)) |
| 13 | neqne 2963 | . . . . . . 7 ⊢ (¬ (𝐷‘𝑌) = (𝐷‘𝑋) → (𝐷‘𝑌) ≠ (𝐷‘𝑋)) | |
| 14 | 13 | necomd 3010 | . . . . . 6 ⊢ (¬ (𝐷‘𝑌) = (𝐷‘𝑋) → (𝐷‘𝑋) ≠ (𝐷‘𝑌)) |
| 15 | 12, 14 | biimtrrdi 257 | . . . . 5 ⊢ ((𝐷‘𝑋) = 𝐾 → (¬ (𝐷‘𝑌) = 𝐾 → (𝐷‘𝑋) ≠ (𝐷‘𝑌))) |
| 16 | 10, 15 | simplbiim 514 | . . . 4 ⊢ (𝑋 ∈ 𝐴 → (¬ (𝐷‘𝑌) = 𝐾 → (𝐷‘𝑋) ≠ (𝐷‘𝑌))) |
| 17 | 16 | com12 33 | . . 3 ⊢ (¬ (𝐷‘𝑌) = 𝐾 → (𝑋 ∈ 𝐴 → (𝐷‘𝑋) ≠ (𝐷‘𝑌))) |
| 18 | 8, 17 | simplbiim 514 | . 2 ⊢ (𝑌 ∈ 𝐵 → (𝑋 ∈ 𝐴 → (𝐷‘𝑋) ≠ (𝐷‘𝑌))) |
| 19 | 18 | impcom 413 | 1 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) → (𝐷‘𝑋) ≠ (𝐷‘𝑌)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ≠ wne 2955 {crab 3412 ∖ cdif 3895 ‘cfv 6527 Vtxcvtx 29507 VtxDegcvtxdg 29979 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-12 2213 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-rab 3413 df-v 3452 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5103 df-iota 6483 df-fv 6535 |
| This theorem is used by: frgrwopreglem4 30849 frgrwopreglem5lem 30854 |
| Copyright terms: Public domain | W3C validator |