| 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 30365. (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 3036 | . . . . 5 ⊢ (𝑌 ∉ 𝐷 ↔ ¬ 𝑌 ∈ 𝐷) | |
| 3 | frgrncvvdeq.nx | . . . . . 6 ⊢ 𝐷 = (𝐺 NeighbVtx 𝑋) | |
| 4 | 3 | eleq2i 2827 | . . . . 5 ⊢ (𝑌 ∈ 𝐷 ↔ 𝑌 ∈ (𝐺 NeighbVtx 𝑋)) |
| 5 | 2, 4 | xchbinx 334 | . . . 4 ⊢ (𝑌 ∉ 𝐷 ↔ ¬ 𝑌 ∈ (𝐺 NeighbVtx 𝑋)) |
| 6 | 1, 5 | sylib 218 | . . 3 ⊢ (𝜑 → ¬ 𝑌 ∈ (𝐺 NeighbVtx 𝑋)) |
| 7 | nbgrsym 29417 | . . 3 ⊢ (𝑋 ∈ (𝐺 NeighbVtx 𝑌) ↔ 𝑌 ∈ (𝐺 NeighbVtx 𝑋)) | |
| 8 | 6, 7 | sylnibr 329 | . 2 ⊢ (𝜑 → ¬ 𝑋 ∈ (𝐺 NeighbVtx 𝑌)) |
| 9 | frgrncvvdeq.ny | . . . 4 ⊢ 𝑁 = (𝐺 NeighbVtx 𝑌) | |
| 10 | neleq2 3042 | . . . 4 ⊢ (𝑁 = (𝐺 NeighbVtx 𝑌) → (𝑋 ∉ 𝑁 ↔ 𝑋 ∉ (𝐺 NeighbVtx 𝑌))) | |
| 11 | 9, 10 | ax-mp 5 | . . 3 ⊢ (𝑋 ∉ 𝑁 ↔ 𝑋 ∉ (𝐺 NeighbVtx 𝑌)) |
| 12 | df-nel 3036 | . . 3 ⊢ (𝑋 ∉ (𝐺 NeighbVtx 𝑌) ↔ ¬ 𝑋 ∈ (𝐺 NeighbVtx 𝑌)) | |
| 13 | 11, 12 | bitri 275 | . 2 ⊢ (𝑋 ∉ 𝑁 ↔ ¬ 𝑋 ∈ (𝐺 NeighbVtx 𝑌)) |
| 14 | 8, 13 | sylibr 234 | 1 ⊢ (𝜑 → 𝑋 ∉ 𝑁) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 = wceq 1542 ∈ wcel 2114 ≠ wne 2931 ∉ wnel 3035 {cpr 4581 ↦ cmpt 5178 ‘cfv 6491 ℩crio 7314 (class class class)co 7358 Vtxcvtx 29050 Edgcedg 29101 NeighbVtx cnbgr 29386 FriendGraph cfrgr 30314 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2183 ax-ext 2707 ax-sep 5240 ax-nul 5250 ax-pr 5376 ax-un 7680 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2932 df-nel 3036 df-ral 3051 df-rex 3060 df-rab 3399 df-v 3441 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-nul 4285 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-iun 4947 df-br 5098 df-opab 5160 df-mpt 5179 df-id 5518 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-iota 6447 df-fun 6493 df-fv 6499 df-ov 7361 df-oprab 7362 df-mpo 7363 df-1st 7933 df-2nd 7934 df-nbgr 29387 |
| This theorem is referenced by: frgrncvvdeqlem7 30361 frgrncvvdeqlem8 30362 frgrncvvdeqlem9 30363 |
| Copyright terms: Public domain | W3C validator |