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 28574. (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 3049 | . . . . 5 ⊢ (𝑌 ∉ 𝐷 ↔ ¬ 𝑌 ∈ 𝐷) | |
3 | frgrncvvdeq.nx | . . . . . 6 ⊢ 𝐷 = (𝐺 NeighbVtx 𝑋) | |
4 | 3 | eleq2i 2830 | . . . . 5 ⊢ (𝑌 ∈ 𝐷 ↔ 𝑌 ∈ (𝐺 NeighbVtx 𝑋)) |
5 | 2, 4 | xchbinx 333 | . . . 4 ⊢ (𝑌 ∉ 𝐷 ↔ ¬ 𝑌 ∈ (𝐺 NeighbVtx 𝑋)) |
6 | 1, 5 | sylib 217 | . . 3 ⊢ (𝜑 → ¬ 𝑌 ∈ (𝐺 NeighbVtx 𝑋)) |
7 | nbgrsym 27633 | . . 3 ⊢ (𝑋 ∈ (𝐺 NeighbVtx 𝑌) ↔ 𝑌 ∈ (𝐺 NeighbVtx 𝑋)) | |
8 | 6, 7 | sylnibr 328 | . 2 ⊢ (𝜑 → ¬ 𝑋 ∈ (𝐺 NeighbVtx 𝑌)) |
9 | frgrncvvdeq.ny | . . . 4 ⊢ 𝑁 = (𝐺 NeighbVtx 𝑌) | |
10 | neleq2 3054 | . . . 4 ⊢ (𝑁 = (𝐺 NeighbVtx 𝑌) → (𝑋 ∉ 𝑁 ↔ 𝑋 ∉ (𝐺 NeighbVtx 𝑌))) | |
11 | 9, 10 | ax-mp 5 | . . 3 ⊢ (𝑋 ∉ 𝑁 ↔ 𝑋 ∉ (𝐺 NeighbVtx 𝑌)) |
12 | df-nel 3049 | . . 3 ⊢ (𝑋 ∉ (𝐺 NeighbVtx 𝑌) ↔ ¬ 𝑋 ∈ (𝐺 NeighbVtx 𝑌)) | |
13 | 11, 12 | bitri 274 | . 2 ⊢ (𝑋 ∉ 𝑁 ↔ ¬ 𝑋 ∈ (𝐺 NeighbVtx 𝑌)) |
14 | 8, 13 | sylibr 233 | 1 ⊢ (𝜑 → 𝑋 ∉ 𝑁) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 = wceq 1539 ∈ wcel 2108 ≠ wne 2942 ∉ wnel 3048 {cpr 4560 ↦ cmpt 5153 ‘cfv 6418 ℩crio 7211 (class class class)co 7255 Vtxcvtx 27269 Edgcedg 27320 NeighbVtx cnbgr 27602 FriendGraph cfrgr 28523 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-iota 6376 df-fun 6420 df-fv 6426 df-ov 7258 df-oprab 7259 df-mpo 7260 df-1st 7804 df-2nd 7805 df-nbgr 27603 |
This theorem is referenced by: frgrncvvdeqlem7 28570 frgrncvvdeqlem8 28571 frgrncvvdeqlem9 28572 |
Copyright terms: Public domain | W3C validator |