| 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 30402. (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 3038 | . . . . 5 ⊢ (𝑌 ∉ 𝐷 ↔ ¬ 𝑌 ∈ 𝐷) | |
| 3 | frgrncvvdeq.nx | . . . . . 6 ⊢ 𝐷 = (𝐺 NeighbVtx 𝑋) | |
| 4 | 3 | eleq2i 2829 | . . . . 5 ⊢ (𝑌 ∈ 𝐷 ↔ 𝑌 ∈ (𝐺 NeighbVtx 𝑋)) |
| 5 | 2, 4 | xchbinx 334 | . . . 4 ⊢ (𝑌 ∉ 𝐷 ↔ ¬ 𝑌 ∈ (𝐺 NeighbVtx 𝑋)) |
| 6 | 1, 5 | sylib 218 | . . 3 ⊢ (𝜑 → ¬ 𝑌 ∈ (𝐺 NeighbVtx 𝑋)) |
| 7 | nbgrsym 29454 | . . 3 ⊢ (𝑋 ∈ (𝐺 NeighbVtx 𝑌) ↔ 𝑌 ∈ (𝐺 NeighbVtx 𝑋)) | |
| 8 | 6, 7 | sylnibr 329 | . 2 ⊢ (𝜑 → ¬ 𝑋 ∈ (𝐺 NeighbVtx 𝑌)) |
| 9 | frgrncvvdeq.ny | . . . 4 ⊢ 𝑁 = (𝐺 NeighbVtx 𝑌) | |
| 10 | neleq2 3044 | . . . 4 ⊢ (𝑁 = (𝐺 NeighbVtx 𝑌) → (𝑋 ∉ 𝑁 ↔ 𝑋 ∉ (𝐺 NeighbVtx 𝑌))) | |
| 11 | 9, 10 | ax-mp 5 | . . 3 ⊢ (𝑋 ∉ 𝑁 ↔ 𝑋 ∉ (𝐺 NeighbVtx 𝑌)) |
| 12 | df-nel 3038 | . . 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 2933 ∉ wnel 3037 {cpr 4584 ↦ cmpt 5181 ‘cfv 6502 ℩crio 7326 (class class class)co 7370 Vtxcvtx 29087 Edgcedg 29138 NeighbVtx cnbgr 29423 FriendGraph cfrgr 30351 |
| 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 2185 ax-ext 2709 ax-sep 5245 ax-nul 5255 ax-pr 5381 ax-un 7692 |
| 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 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5529 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-iota 6458 df-fun 6504 df-fv 6510 df-ov 7373 df-oprab 7374 df-mpo 7375 df-1st 7945 df-2nd 7946 df-nbgr 29424 |
| This theorem is referenced by: frgrncvvdeqlem7 30398 frgrncvvdeqlem8 30399 frgrncvvdeqlem9 30400 |
| Copyright terms: Public domain | W3C validator |