| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > frgrncvvdeqlem1 | Structured version Visualization version GIF version | ||
| Description: Lemma 1 for frgrncvvdeq 30843. (Contributed by Alexander van der Vekens, 23-Dec-2017.) (Revised by AV, 8-May-2021.) (Proof shortened by AV, 12-Feb-2022.) |
| Ref | Expression |
|---|---|
| frgrncvvdeq.v1 | ⊢ 𝑉 = (Vtx‘𝐺) |
| frgrncvvdeq.e | ⊢ 𝐸 = (Edg‘𝐺) |
| frgrncvvdeq.nx | ⊢ 𝐷 = (𝐺 NeighbVtx 𝑋) |
| frgrncvvdeq.ny | ⊢ 𝑁 = (𝐺 NeighbVtx 𝑌) |
| frgrncvvdeq.x | ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
| frgrncvvdeq.y | ⊢ (𝜑 → 𝑌 ∈ 𝑉) |
| frgrncvvdeq.ne | ⊢ (𝜑 → 𝑋 ≠ 𝑌) |
| frgrncvvdeq.xy | ⊢ (𝜑 → 𝑌 ∉ 𝐷) |
| frgrncvvdeq.f | ⊢ (𝜑 → 𝐺 ∈ FriendGraph ) |
| frgrncvvdeq.a | ⊢ 𝐴 = (𝑥 ∈ 𝐷 ↦ (℩𝑦 ∈ 𝑁 {𝑥, 𝑦} ∈ 𝐸)) |
| Ref | Expression |
|---|---|
| frgrncvvdeqlem1 | ⊢ (𝜑 → 𝑋 ∉ 𝑁) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | frgrncvvdeq.xy | . . . 4 ⊢ (𝜑 → 𝑌 ∉ 𝐷) | |
| 2 | df-nel 3062 | . . . . 5 ⊢ (𝑌 ∉ 𝐷 ↔ ¬ 𝑌 ∈ 𝐷) | |
| 3 | frgrncvvdeq.nx | . . . . . 6 ⊢ 𝐷 = (𝐺 NeighbVtx 𝑋) | |
| 4 | 3 | eleq2i 2852 | . . . . 5 ⊢ (𝑌 ∈ 𝐷 ↔ 𝑌 ∈ (𝐺 NeighbVtx 𝑋)) |
| 5 | 2, 4 | xchbinx 337 | . . . 4 ⊢ (𝑌 ∉ 𝐷 ↔ ¬ 𝑌 ∈ (𝐺 NeighbVtx 𝑋)) |
| 6 | 1, 5 | sylib 221 | . . 3 ⊢ (𝜑 → ¬ 𝑌 ∈ (𝐺 NeighbVtx 𝑋)) |
| 7 | nbgrsym 29877 | . . 3 ⊢ (𝑋 ∈ (𝐺 NeighbVtx 𝑌) ↔ 𝑌 ∈ (𝐺 NeighbVtx 𝑋)) | |
| 8 | 6, 7 | sylnibr 332 | . 2 ⊢ (𝜑 → ¬ 𝑋 ∈ (𝐺 NeighbVtx 𝑌)) |
| 9 | frgrncvvdeq.ny | . . . 4 ⊢ 𝑁 = (𝐺 NeighbVtx 𝑌) | |
| 10 | neleq2 3068 | . . . 4 ⊢ (𝑁 = (𝐺 NeighbVtx 𝑌) → (𝑋 ∉ 𝑁 ↔ 𝑋 ∉ (𝐺 NeighbVtx 𝑌))) | |
| 11 | 9, 10 | ax-mp 5 | . . 3 ⊢ (𝑋 ∉ 𝑁 ↔ 𝑋 ∉ (𝐺 NeighbVtx 𝑌)) |
| 12 | df-nel 3062 | . . 3 ⊢ (𝑋 ∉ (𝐺 NeighbVtx 𝑌) ↔ ¬ 𝑋 ∈ (𝐺 NeighbVtx 𝑌)) | |
| 13 | 11, 12 | bitri 278 | . 2 ⊢ (𝑋 ∉ 𝑁 ↔ ¬ 𝑋 ∈ (𝐺 NeighbVtx 𝑌)) |
| 14 | 8, 13 | sylibr 237 | 1 ⊢ (𝜑 → 𝑋 ∉ 𝑁) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2145 ≠ wne 2955 ∉ wnel 3061 {cpr 4585 ↦ cmpt 5185 ‘cfv 6527 ℩crio 7364 (class class class)co 7408 Vtxcvtx 29507 Edgcedg 29558 NeighbVtx cnbgr 29846 FriendGraph cfrgr 30792 |
| 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-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5390 ax-un 7734 |
| 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-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-iota 6483 df-fun 6529 df-fv 6535 df-ov 7411 df-oprab 7412 df-mpo 7413 df-1st 7984 df-2nd 7985 df-nbgr 29847 |
| This theorem is used by: frgrncvvdeqlem7 30839 frgrncvvdeqlem8 30840 frgrncvvdeqlem9 30841 |
| Copyright terms: Public domain | W3C validator |