| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 1hevtxdg0 | Structured version Visualization version GIF version | ||
| Description: The vertex degree of vertex 𝐷 in a graph 𝐺 with only one hyperedge 𝐸 is 0 if 𝐷 is not incident with the edge 𝐸. (Contributed by AV, 2-Mar-2021.) |
| Ref | Expression |
|---|---|
| 1hevtxdg0.i | ⊢ (𝜑 → (iEdg‘𝐺) = {〈𝐴, 𝐸〉}) |
| 1hevtxdg0.v | ⊢ (𝜑 → (Vtx‘𝐺) = 𝑉) |
| 1hevtxdg0.a | ⊢ (𝜑 → 𝐴 ∈ 𝑋) |
| 1hevtxdg0.d | ⊢ (𝜑 → 𝐷 ∈ 𝑉) |
| 1hevtxdg0.e | ⊢ (𝜑 → 𝐸 ∈ 𝑌) |
| 1hevtxdg0.n | ⊢ (𝜑 → 𝐷 ∉ 𝐸) |
| Ref | Expression |
|---|---|
| 1hevtxdg0 | ⊢ (𝜑 → ((VtxDeg‘𝐺)‘𝐷) = 0) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 1hevtxdg0.n | . . . . . . 7 ⊢ (𝜑 → 𝐷 ∉ 𝐸) | |
| 2 | df-nel 3039 | . . . . . . 7 ⊢ (𝐷 ∉ 𝐸 ↔ ¬ 𝐷 ∈ 𝐸) | |
| 3 | 1, 2 | sylib 219 | . . . . . 6 ⊢ (𝜑 → ¬ 𝐷 ∈ 𝐸) |
| 4 | 1hevtxdg0.i | . . . . . . . 8 ⊢ (𝜑 → (iEdg‘𝐺) = {〈𝐴, 𝐸〉}) | |
| 5 | 4 | fveq1d 6830 | . . . . . . 7 ⊢ (𝜑 → ((iEdg‘𝐺)‘𝐴) = ({〈𝐴, 𝐸〉}‘𝐴)) |
| 6 | 1hevtxdg0.a | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ 𝑋) | |
| 7 | 1hevtxdg0.e | . . . . . . . 8 ⊢ (𝜑 → 𝐸 ∈ 𝑌) | |
| 8 | fvsng 7125 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → ({〈𝐴, 𝐸〉}‘𝐴) = 𝐸) | |
| 9 | 6, 7, 8 | syl2anc 590 | . . . . . . 7 ⊢ (𝜑 → ({〈𝐴, 𝐸〉}‘𝐴) = 𝐸) |
| 10 | 5, 9 | eqtrd 2774 | . . . . . 6 ⊢ (𝜑 → ((iEdg‘𝐺)‘𝐴) = 𝐸) |
| 11 | 3, 10 | neleqtrrd 2862 | . . . . 5 ⊢ (𝜑 → ¬ 𝐷 ∈ ((iEdg‘𝐺)‘𝐴)) |
| 12 | fveq2 6828 | . . . . . . . . 9 ⊢ (𝑥 = 𝐴 → ((iEdg‘𝐺)‘𝑥) = ((iEdg‘𝐺)‘𝐴)) | |
| 13 | 12 | eleq2d 2825 | . . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝐷 ∈ ((iEdg‘𝐺)‘𝑥) ↔ 𝐷 ∈ ((iEdg‘𝐺)‘𝐴))) |
| 14 | 13 | notbid 319 | . . . . . . 7 ⊢ (𝑥 = 𝐴 → (¬ 𝐷 ∈ ((iEdg‘𝐺)‘𝑥) ↔ ¬ 𝐷 ∈ ((iEdg‘𝐺)‘𝐴))) |
| 15 | 14 | ralsng 4608 | . . . . . 6 ⊢ (𝐴 ∈ 𝑋 → (∀𝑥 ∈ {𝐴} ¬ 𝐷 ∈ ((iEdg‘𝐺)‘𝑥) ↔ ¬ 𝐷 ∈ ((iEdg‘𝐺)‘𝐴))) |
| 16 | 6, 15 | syl 17 | . . . . 5 ⊢ (𝜑 → (∀𝑥 ∈ {𝐴} ¬ 𝐷 ∈ ((iEdg‘𝐺)‘𝑥) ↔ ¬ 𝐷 ∈ ((iEdg‘𝐺)‘𝐴))) |
| 17 | 11, 16 | mpbird 258 | . . . 4 ⊢ (𝜑 → ∀𝑥 ∈ {𝐴} ¬ 𝐷 ∈ ((iEdg‘𝐺)‘𝑥)) |
| 18 | 4 | dmeqd 5848 | . . . . 5 ⊢ (𝜑 → dom (iEdg‘𝐺) = dom {〈𝐴, 𝐸〉}) |
| 19 | dmsnopg 6165 | . . . . . 6 ⊢ (𝐸 ∈ 𝑌 → dom {〈𝐴, 𝐸〉} = {𝐴}) | |
| 20 | 7, 19 | syl 17 | . . . . 5 ⊢ (𝜑 → dom {〈𝐴, 𝐸〉} = {𝐴}) |
| 21 | 18, 20 | eqtrd 2774 | . . . 4 ⊢ (𝜑 → dom (iEdg‘𝐺) = {𝐴}) |
| 22 | 17, 21 | raleqtrrdv 3301 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ dom (iEdg‘𝐺) ¬ 𝐷 ∈ ((iEdg‘𝐺)‘𝑥)) |
| 23 | ralnex 3065 | . . 3 ⊢ (∀𝑥 ∈ dom (iEdg‘𝐺) ¬ 𝐷 ∈ ((iEdg‘𝐺)‘𝑥) ↔ ¬ ∃𝑥 ∈ dom (iEdg‘𝐺)𝐷 ∈ ((iEdg‘𝐺)‘𝑥)) | |
| 24 | 22, 23 | sylib 219 | . 2 ⊢ (𝜑 → ¬ ∃𝑥 ∈ dom (iEdg‘𝐺)𝐷 ∈ ((iEdg‘𝐺)‘𝑥)) |
| 25 | 1hevtxdg0.d | . . . 4 ⊢ (𝜑 → 𝐷 ∈ 𝑉) | |
| 26 | 1hevtxdg0.v | . . . . 5 ⊢ (𝜑 → (Vtx‘𝐺) = 𝑉) | |
| 27 | 26 | eleq2d 2825 | . . . 4 ⊢ (𝜑 → (𝐷 ∈ (Vtx‘𝐺) ↔ 𝐷 ∈ 𝑉)) |
| 28 | 25, 27 | mpbird 258 | . . 3 ⊢ (𝜑 → 𝐷 ∈ (Vtx‘𝐺)) |
| 29 | eqid 2739 | . . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 30 | eqid 2739 | . . . 4 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
| 31 | eqid 2739 | . . . 4 ⊢ (VtxDeg‘𝐺) = (VtxDeg‘𝐺) | |
| 32 | 29, 30, 31 | vtxd0nedgb 29576 | . . 3 ⊢ (𝐷 ∈ (Vtx‘𝐺) → (((VtxDeg‘𝐺)‘𝐷) = 0 ↔ ¬ ∃𝑥 ∈ dom (iEdg‘𝐺)𝐷 ∈ ((iEdg‘𝐺)‘𝑥))) |
| 33 | 28, 32 | syl 17 | . 2 ⊢ (𝜑 → (((VtxDeg‘𝐺)‘𝐷) = 0 ↔ ¬ ∃𝑥 ∈ dom (iEdg‘𝐺)𝐷 ∈ ((iEdg‘𝐺)‘𝑥))) |
| 34 | 24, 33 | mpbird 258 | 1 ⊢ (𝜑 → ((VtxDeg‘𝐺)‘𝐷) = 0) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 207 = wceq 1547 ∈ wcel 2119 ∉ wnel 3038 ∀wral 3053 ∃wrex 3063 {csn 4556 〈cop 4562 dom cdm 5619 ‘cfv 6486 0cc0 11030 Vtxcvtx 29084 iEdgciedg 29085 VtxDegcvtxdg 29553 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-rep 5200 ax-sep 5219 ax-nul 5229 ax-pow 5295 ax-pr 5363 ax-un 7679 ax-cnex 11086 ax-resscn 11087 ax-1cn 11088 ax-icn 11089 ax-addcl 11090 ax-addrcl 11091 ax-mulcl 11092 ax-mulrcl 11093 ax-mulcom 11094 ax-addass 11095 ax-mulass 11096 ax-distr 11097 ax-i2m1 11098 ax-1ne0 11099 ax-1rid 11100 ax-rnegex 11101 ax-rrecex 11102 ax-cnre 11103 ax-pre-lttri 11104 ax-pre-lttrn 11105 ax-pre-ltadd 11106 ax-pre-mulgt0 11107 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-nel 3039 df-ral 3054 df-rex 3064 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4263 df-if 4456 df-pw 4532 df-sn 4557 df-pr 4559 df-op 4563 df-uni 4840 df-int 4879 df-iun 4924 df-br 5074 df-opab 5136 df-mpt 5155 df-tr 5181 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6253 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-riota 7314 df-ov 7360 df-oprab 7361 df-mpo 7362 df-om 7808 df-1st 7932 df-2nd 7933 df-frecs 8222 df-wrecs 8253 df-recs 8302 df-rdg 8340 df-1o 8396 df-er 8634 df-en 8885 df-dom 8886 df-sdom 8887 df-fin 8888 df-card 9855 df-pnf 11173 df-mnf 11174 df-xr 11175 df-ltxr 11176 df-le 11177 df-sub 11371 df-neg 11372 df-nn 12167 df-n0 12430 df-xnn0 12503 df-z 12517 df-uz 12781 df-xadd 13056 df-fz 13454 df-hash 14285 df-vtxdg 29554 |
| This theorem is referenced by: p1evtxdeq 29601 eupth2lem3lem6 30322 |
| Copyright terms: Public domain | W3C validator |