| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dfnbgr3 | Structured version Visualization version GIF version | ||
| Description: Alternate definition of the neighbors of a vertex using the edge function instead of the edges themselves (see also nbgrval 29974). (Contributed by Alexander van der Vekens, 17-Dec-2017.) (Revised by AV, 25-Oct-2020.) (Revised by AV, 21-Mar-2021.) |
| Ref | Expression |
|---|---|
| dfnbgr3.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| dfnbgr3.i | ⊢ 𝐼 = (iEdg‘𝐺) |
| Ref | Expression |
|---|---|
| dfnbgr3 | ⊢ ((𝑁 ∈ 𝑉 ∧ Fun 𝐼) → (𝐺 NeighbVtx 𝑁) = {𝑛 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑖 ∈ dom 𝐼{𝑁, 𝑛} ⊆ (𝐼‘𝑖)}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfnbgr3.v | . . . 4 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 2 | eqid 2763 | . . . 4 ⊢ (Edg‘𝐺) = (Edg‘𝐺) | |
| 3 | 1, 2 | nbgrval 29974 | . . 3 ⊢ (𝑁 ∈ 𝑉 → (𝐺 NeighbVtx 𝑁) = {𝑛 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑒 ∈ (Edg‘𝐺){𝑁, 𝑛} ⊆ 𝑒}) |
| 4 | 3 | adantr 486 | . 2 ⊢ ((𝑁 ∈ 𝑉 ∧ Fun 𝐼) → (𝐺 NeighbVtx 𝑁) = {𝑛 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑒 ∈ (Edg‘𝐺){𝑁, 𝑛} ⊆ 𝑒}) |
| 5 | edgval 29684 | . . . . . 6 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺) | |
| 6 | dfnbgr3.i | . . . . . . . 8 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 7 | 6 | eqcomi 2772 | . . . . . . 7 ⊢ (iEdg‘𝐺) = 𝐼 |
| 8 | 7 | rneqi 5931 | . . . . . 6 ⊢ ran (iEdg‘𝐺) = ran 𝐼 |
| 9 | 5, 8 | eqtri 2786 | . . . . 5 ⊢ (Edg‘𝐺) = ran 𝐼 |
| 10 | 9 | rexeqi 3322 | . . . 4 ⊢ (∃𝑒 ∈ (Edg‘𝐺){𝑁, 𝑛} ⊆ 𝑒 ↔ ∃𝑒 ∈ ran 𝐼{𝑁, 𝑛} ⊆ 𝑒) |
| 11 | funfn 6598 | . . . . . 6 ⊢ (Fun 𝐼 ↔ 𝐼 Fn dom 𝐼) | |
| 12 | 11 | bilani 510 | . . . . 5 ⊢ ((𝑁 ∈ 𝑉 ∧ Fun 𝐼) → 𝐼 Fn dom 𝐼) |
| 13 | sseq2 3939 | . . . . . 6 ⊢ (𝑒 = (𝐼‘𝑖) → ({𝑁, 𝑛} ⊆ 𝑒 ↔ {𝑁, 𝑛} ⊆ (𝐼‘𝑖))) | |
| 14 | 13 | rexrn 7119 | . . . . 5 ⊢ (𝐼 Fn dom 𝐼 → (∃𝑒 ∈ ran 𝐼{𝑁, 𝑛} ⊆ 𝑒 ↔ ∃𝑖 ∈ dom 𝐼{𝑁, 𝑛} ⊆ (𝐼‘𝑖))) |
| 15 | 12, 14 | syl 18 | . . . 4 ⊢ ((𝑁 ∈ 𝑉 ∧ Fun 𝐼) → (∃𝑒 ∈ ran 𝐼{𝑁, 𝑛} ⊆ 𝑒 ↔ ∃𝑖 ∈ dom 𝐼{𝑁, 𝑛} ⊆ (𝐼‘𝑖))) |
| 16 | 10, 15 | bitrid 286 | . . 3 ⊢ ((𝑁 ∈ 𝑉 ∧ Fun 𝐼) → (∃𝑒 ∈ (Edg‘𝐺){𝑁, 𝑛} ⊆ 𝑒 ↔ ∃𝑖 ∈ dom 𝐼{𝑁, 𝑛} ⊆ (𝐼‘𝑖))) |
| 17 | 16 | rabbidv 3423 | . 2 ⊢ ((𝑁 ∈ 𝑉 ∧ Fun 𝐼) → {𝑛 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑒 ∈ (Edg‘𝐺){𝑁, 𝑛} ⊆ 𝑒} = {𝑛 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑖 ∈ dom 𝐼{𝑁, 𝑛} ⊆ (𝐼‘𝑖)}) |
| 18 | 4, 17 | eqtrd 2798 | 1 ⊢ ((𝑁 ∈ 𝑉 ∧ Fun 𝐼) → (𝐺 NeighbVtx 𝑁) = {𝑛 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑖 ∈ dom 𝐼{𝑁, 𝑛} ⊆ (𝐼‘𝑖)}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∃wrex 3090 {crab 3416 ⊆ wss 3900 ∖ cdif 4048 {csn 4588 {cpr 4590 dom cdm 5658 ran crn 5659 Fun wfun 6560 Fn wfn 6561 ‘cfv 6566 (class class class)co 7451 Vtxcvtx 29631 iEdgciedg 29632 Edgcedg 29682 NeighbVtx cnbgr 29970 |
| 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 5255 ax-nul 5266 ax-pr 5398 ax-un 7783 |
| 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-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 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 4841 df-uni 4873 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-iota 6520 df-fun 6568 df-fn 6569 df-fv 6574 df-ov 7454 df-oprab 7455 df-mpo 7456 df-edg 29683 df-nbgr 29971 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |