| 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 3031 | . . . . . . 7 ⊢ (𝐷 ∉ 𝐸 ↔ ¬ 𝐷 ∈ 𝐸) | |
| 3 | 1, 2 | sylib 218 | . . . . . 6 ⊢ (𝜑 → ¬ 𝐷 ∈ 𝐸) |
| 4 | 1hevtxdg0.i | . . . . . . . 8 ⊢ (𝜑 → (iEdg‘𝐺) = {〈𝐴, 𝐸〉}) | |
| 5 | 4 | fveq1d 6863 | . . . . . . 7 ⊢ (𝜑 → ((iEdg‘𝐺)‘𝐴) = ({〈𝐴, 𝐸〉}‘𝐴)) |
| 6 | 1hevtxdg0.a | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ 𝑋) | |
| 7 | 1hevtxdg0.e | . . . . . . . 8 ⊢ (𝜑 → 𝐸 ∈ 𝑌) | |
| 8 | fvsng 7157 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → ({〈𝐴, 𝐸〉}‘𝐴) = 𝐸) | |
| 9 | 6, 7, 8 | syl2anc 584 | . . . . . . 7 ⊢ (𝜑 → ({〈𝐴, 𝐸〉}‘𝐴) = 𝐸) |
| 10 | 5, 9 | eqtrd 2765 | . . . . . 6 ⊢ (𝜑 → ((iEdg‘𝐺)‘𝐴) = 𝐸) |
| 11 | 3, 10 | neleqtrrd 2852 | . . . . 5 ⊢ (𝜑 → ¬ 𝐷 ∈ ((iEdg‘𝐺)‘𝐴)) |
| 12 | fveq2 6861 | . . . . . . . . 9 ⊢ (𝑥 = 𝐴 → ((iEdg‘𝐺)‘𝑥) = ((iEdg‘𝐺)‘𝐴)) | |
| 13 | 12 | eleq2d 2815 | . . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝐷 ∈ ((iEdg‘𝐺)‘𝑥) ↔ 𝐷 ∈ ((iEdg‘𝐺)‘𝐴))) |
| 14 | 13 | notbid 318 | . . . . . . 7 ⊢ (𝑥 = 𝐴 → (¬ 𝐷 ∈ ((iEdg‘𝐺)‘𝑥) ↔ ¬ 𝐷 ∈ ((iEdg‘𝐺)‘𝐴))) |
| 15 | 14 | ralsng 4642 | . . . . . 6 ⊢ (𝐴 ∈ 𝑋 → (∀𝑥 ∈ {𝐴} ¬ 𝐷 ∈ ((iEdg‘𝐺)‘𝑥) ↔ ¬ 𝐷 ∈ ((iEdg‘𝐺)‘𝐴))) |
| 16 | 6, 15 | syl 17 | . . . . 5 ⊢ (𝜑 → (∀𝑥 ∈ {𝐴} ¬ 𝐷 ∈ ((iEdg‘𝐺)‘𝑥) ↔ ¬ 𝐷 ∈ ((iEdg‘𝐺)‘𝐴))) |
| 17 | 11, 16 | mpbird 257 | . . . 4 ⊢ (𝜑 → ∀𝑥 ∈ {𝐴} ¬ 𝐷 ∈ ((iEdg‘𝐺)‘𝑥)) |
| 18 | 4 | dmeqd 5872 | . . . . 5 ⊢ (𝜑 → dom (iEdg‘𝐺) = dom {〈𝐴, 𝐸〉}) |
| 19 | dmsnopg 6189 | . . . . . 6 ⊢ (𝐸 ∈ 𝑌 → dom {〈𝐴, 𝐸〉} = {𝐴}) | |
| 20 | 7, 19 | syl 17 | . . . . 5 ⊢ (𝜑 → dom {〈𝐴, 𝐸〉} = {𝐴}) |
| 21 | 18, 20 | eqtrd 2765 | . . . 4 ⊢ (𝜑 → dom (iEdg‘𝐺) = {𝐴}) |
| 22 | 17, 21 | raleqtrrdv 3305 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ dom (iEdg‘𝐺) ¬ 𝐷 ∈ ((iEdg‘𝐺)‘𝑥)) |
| 23 | ralnex 3056 | . . 3 ⊢ (∀𝑥 ∈ dom (iEdg‘𝐺) ¬ 𝐷 ∈ ((iEdg‘𝐺)‘𝑥) ↔ ¬ ∃𝑥 ∈ dom (iEdg‘𝐺)𝐷 ∈ ((iEdg‘𝐺)‘𝑥)) | |
| 24 | 22, 23 | sylib 218 | . 2 ⊢ (𝜑 → ¬ ∃𝑥 ∈ dom (iEdg‘𝐺)𝐷 ∈ ((iEdg‘𝐺)‘𝑥)) |
| 25 | 1hevtxdg0.d | . . . 4 ⊢ (𝜑 → 𝐷 ∈ 𝑉) | |
| 26 | 1hevtxdg0.v | . . . . 5 ⊢ (𝜑 → (Vtx‘𝐺) = 𝑉) | |
| 27 | 26 | eleq2d 2815 | . . . 4 ⊢ (𝜑 → (𝐷 ∈ (Vtx‘𝐺) ↔ 𝐷 ∈ 𝑉)) |
| 28 | 25, 27 | mpbird 257 | . . 3 ⊢ (𝜑 → 𝐷 ∈ (Vtx‘𝐺)) |
| 29 | eqid 2730 | . . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 30 | eqid 2730 | . . . 4 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
| 31 | eqid 2730 | . . . 4 ⊢ (VtxDeg‘𝐺) = (VtxDeg‘𝐺) | |
| 32 | 29, 30, 31 | vtxd0nedgb 29423 | . . 3 ⊢ (𝐷 ∈ (Vtx‘𝐺) → (((VtxDeg‘𝐺)‘𝐷) = 0 ↔ ¬ ∃𝑥 ∈ dom (iEdg‘𝐺)𝐷 ∈ ((iEdg‘𝐺)‘𝑥))) |
| 33 | 28, 32 | syl 17 | . 2 ⊢ (𝜑 → (((VtxDeg‘𝐺)‘𝐷) = 0 ↔ ¬ ∃𝑥 ∈ dom (iEdg‘𝐺)𝐷 ∈ ((iEdg‘𝐺)‘𝑥))) |
| 34 | 24, 33 | mpbird 257 | 1 ⊢ (𝜑 → ((VtxDeg‘𝐺)‘𝐷) = 0) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 = wceq 1540 ∈ wcel 2109 ∉ wnel 3030 ∀wral 3045 ∃wrex 3054 {csn 4592 〈cop 4598 dom cdm 5641 ‘cfv 6514 0cc0 11075 Vtxcvtx 28930 iEdgciedg 28931 VtxDegcvtxdg 29400 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-rep 5237 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-pss 3937 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-int 4914 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5536 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-we 5596 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7846 df-1st 7971 df-2nd 7972 df-frecs 8263 df-wrecs 8294 df-recs 8343 df-rdg 8381 df-1o 8437 df-er 8674 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-card 9899 df-pnf 11217 df-mnf 11218 df-xr 11219 df-ltxr 11220 df-le 11221 df-sub 11414 df-neg 11415 df-nn 12194 df-n0 12450 df-xnn0 12523 df-z 12537 df-uz 12801 df-xadd 13080 df-fz 13476 df-hash 14303 df-vtxdg 29401 |
| This theorem is referenced by: p1evtxdeq 29448 eupth2lem3lem6 30169 |
| Copyright terms: Public domain | W3C validator |