| 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 30937. (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 3066 | . . . . 5 ⊢ (𝑌 ∉ 𝐷 ↔ ¬ 𝑌 ∈ 𝐷) | |
| 3 | frgrncvvdeq.nx | . . . . . 6 ⊢ 𝐷 = (𝐺 NeighbVtx 𝑋) | |
| 4 | 3 | eleq2i 2856 | . . . . 5 ⊢ (𝑌 ∈ 𝐷 ↔ 𝑌 ∈ (𝐺 NeighbVtx 𝑋)) |
| 5 | 2, 4 | xchbinx 337 | . . . 4 ⊢ (𝑌 ∉ 𝐷 ↔ ¬ 𝑌 ∈ (𝐺 NeighbVtx 𝑋)) |
| 6 | 1, 5 | sylib 221 | . . 3 ⊢ (𝜑 → ¬ 𝑌 ∈ (𝐺 NeighbVtx 𝑋)) |
| 7 | nbgrsym 29971 | . . 3 ⊢ (𝑋 ∈ (𝐺 NeighbVtx 𝑌) ↔ 𝑌 ∈ (𝐺 NeighbVtx 𝑋)) | |
| 8 | 6, 7 | sylnibr 332 | . 2 ⊢ (𝜑 → ¬ 𝑋 ∈ (𝐺 NeighbVtx 𝑌)) |
| 9 | frgrncvvdeq.ny | . . . 4 ⊢ 𝑁 = (𝐺 NeighbVtx 𝑌) | |
| 10 | neleq2 3072 | . . . 4 ⊢ (𝑁 = (𝐺 NeighbVtx 𝑌) → (𝑋 ∉ 𝑁 ↔ 𝑋 ∉ (𝐺 NeighbVtx 𝑌))) | |
| 11 | 9, 10 | ax-mp 5 | . . 3 ⊢ (𝑋 ∉ 𝑁 ↔ 𝑋 ∉ (𝐺 NeighbVtx 𝑌)) |
| 12 | df-nel 3066 | . . 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 2147 ≠ wne 2959 ∉ wnel 3065 {cpr 4590 ↦ cmpt 5189 ‘cfv 6555 ℩crio 7396 (class class class)co 7440 Vtxcvtx 29601 Edgcedg 29652 NeighbVtx cnbgr 29940 FriendGraph cfrgr 30886 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pr 5395 ax-un 7772 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6509 df-fun 6557 df-fv 6563 df-ov 7443 df-oprab 7444 df-mpo 7445 df-1st 8022 df-2nd 8023 df-nbgr 29941 |
| This theorem is used by: frgrncvvdeqlem7 30933 frgrncvvdeqlem8 30934 frgrncvvdeqlem9 30935 |
| Copyright terms: Public domain | W3C validator |