| 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 3038 | . . . . . . 7 ⊢ (𝐷 ∉ 𝐸 ↔ ¬ 𝐷 ∈ 𝐸) | |
| 3 | 1, 2 | sylib 218 | . . . . . 6 ⊢ (𝜑 → ¬ 𝐷 ∈ 𝐸) |
| 4 | 1hevtxdg0.i | . . . . . . . 8 ⊢ (𝜑 → (iEdg‘𝐺) = {〈𝐴, 𝐸〉}) | |
| 5 | 4 | fveq1d 6836 | . . . . . . 7 ⊢ (𝜑 → ((iEdg‘𝐺)‘𝐴) = ({〈𝐴, 𝐸〉}‘𝐴)) |
| 6 | 1hevtxdg0.a | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ 𝑋) | |
| 7 | 1hevtxdg0.e | . . . . . . . 8 ⊢ (𝜑 → 𝐸 ∈ 𝑌) | |
| 8 | fvsng 7128 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → ({〈𝐴, 𝐸〉}‘𝐴) = 𝐸) | |
| 9 | 6, 7, 8 | syl2anc 585 | . . . . . . 7 ⊢ (𝜑 → ({〈𝐴, 𝐸〉}‘𝐴) = 𝐸) |
| 10 | 5, 9 | eqtrd 2772 | . . . . . 6 ⊢ (𝜑 → ((iEdg‘𝐺)‘𝐴) = 𝐸) |
| 11 | 3, 10 | neleqtrrd 2860 | . . . . 5 ⊢ (𝜑 → ¬ 𝐷 ∈ ((iEdg‘𝐺)‘𝐴)) |
| 12 | fveq2 6834 | . . . . . . . . 9 ⊢ (𝑥 = 𝐴 → ((iEdg‘𝐺)‘𝑥) = ((iEdg‘𝐺)‘𝐴)) | |
| 13 | 12 | eleq2d 2823 | . . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝐷 ∈ ((iEdg‘𝐺)‘𝑥) ↔ 𝐷 ∈ ((iEdg‘𝐺)‘𝐴))) |
| 14 | 13 | notbid 318 | . . . . . . 7 ⊢ (𝑥 = 𝐴 → (¬ 𝐷 ∈ ((iEdg‘𝐺)‘𝑥) ↔ ¬ 𝐷 ∈ ((iEdg‘𝐺)‘𝐴))) |
| 15 | 14 | ralsng 4620 | . . . . . 6 ⊢ (𝐴 ∈ 𝑋 → (∀𝑥 ∈ {𝐴} ¬ 𝐷 ∈ ((iEdg‘𝐺)‘𝑥) ↔ ¬ 𝐷 ∈ ((iEdg‘𝐺)‘𝐴))) |
| 16 | 6, 15 | syl 17 | . . . . 5 ⊢ (𝜑 → (∀𝑥 ∈ {𝐴} ¬ 𝐷 ∈ ((iEdg‘𝐺)‘𝑥) ↔ ¬ 𝐷 ∈ ((iEdg‘𝐺)‘𝐴))) |
| 17 | 11, 16 | mpbird 257 | . . . 4 ⊢ (𝜑 → ∀𝑥 ∈ {𝐴} ¬ 𝐷 ∈ ((iEdg‘𝐺)‘𝑥)) |
| 18 | 4 | dmeqd 5854 | . . . . 5 ⊢ (𝜑 → dom (iEdg‘𝐺) = dom {〈𝐴, 𝐸〉}) |
| 19 | dmsnopg 6171 | . . . . . 6 ⊢ (𝐸 ∈ 𝑌 → dom {〈𝐴, 𝐸〉} = {𝐴}) | |
| 20 | 7, 19 | syl 17 | . . . . 5 ⊢ (𝜑 → dom {〈𝐴, 𝐸〉} = {𝐴}) |
| 21 | 18, 20 | eqtrd 2772 | . . . 4 ⊢ (𝜑 → dom (iEdg‘𝐺) = {𝐴}) |
| 22 | 17, 21 | raleqtrrdv 3300 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ dom (iEdg‘𝐺) ¬ 𝐷 ∈ ((iEdg‘𝐺)‘𝑥)) |
| 23 | ralnex 3064 | . . 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 2823 | . . . 4 ⊢ (𝜑 → (𝐷 ∈ (Vtx‘𝐺) ↔ 𝐷 ∈ 𝑉)) |
| 28 | 25, 27 | mpbird 257 | . . 3 ⊢ (𝜑 → 𝐷 ∈ (Vtx‘𝐺)) |
| 29 | eqid 2737 | . . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 30 | eqid 2737 | . . . 4 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
| 31 | eqid 2737 | . . . 4 ⊢ (VtxDeg‘𝐺) = (VtxDeg‘𝐺) | |
| 32 | 29, 30, 31 | vtxd0nedgb 29572 | . . 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 1542 ∈ wcel 2114 ∉ wnel 3037 ∀wral 3052 ∃wrex 3062 {csn 4568 〈cop 4574 dom cdm 5624 ‘cfv 6492 0cc0 11029 Vtxcvtx 29079 iEdgciedg 29080 VtxDegcvtxdg 29549 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-1o 8398 df-er 8636 df-en 8887 df-dom 8888 df-sdom 8889 df-fin 8890 df-card 9854 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12166 df-n0 12429 df-xnn0 12502 df-z 12516 df-uz 12780 df-xadd 13055 df-fz 13453 df-hash 14284 df-vtxdg 29550 |
| This theorem is referenced by: p1evtxdeq 29597 eupth2lem3lem6 30318 |
| Copyright terms: Public domain | W3C validator |