| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > 1hegrvtxdg1fi | GIF version | ||
| Description: The vertex degree of a multigraph with one edge, case 2: an edge from the given vertex to some other vertex contributes one to the vertex's degree. (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by Alexander van der Vekens, 22-Dec-2017.) (Revised by AV, 23-Feb-2021.) |
| Ref | Expression |
|---|---|
| 1hegrvtxdg1.a | ⊢ (𝜑 → 𝐴 ∈ 𝑋) |
| 1hegrvtxdg1.b | ⊢ (𝜑 → 𝐵 ∈ 𝑉) |
| 1hegrvtxdg1.c | ⊢ (𝜑 → 𝐶 ∈ 𝑉) |
| 1hegrvtxdg1.n | ⊢ (𝜑 → 𝐵 ≠ 𝐶) |
| 1hegrvtxdg1.x | ⊢ (𝜑 → 𝐸 ∈ 𝒫 𝑉) |
| 1hegrvtxdg1.i | ⊢ (𝜑 → (iEdg‘𝐺) = {〈𝐴, 𝐸〉}) |
| 1hegrvtxdg1.e | ⊢ (𝜑 → {𝐵, 𝐶} ⊆ 𝐸) |
| 1hegrvtxdg1.v | ⊢ (𝜑 → (Vtx‘𝐺) = 𝑉) |
| 1hegrvtxdg1fi.fi | ⊢ (𝜑 → 𝑉 ∈ Fin) |
| 1hegrvtxdg1fi.m | ⊢ (𝜑 → 𝐺 ∈ UMGraph) |
| Ref | Expression |
|---|---|
| 1hegrvtxdg1fi | ⊢ (𝜑 → ((VtxDeg‘𝐺)‘𝐵) = 1) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 1hegrvtxdg1.i | . 2 ⊢ (𝜑 → (iEdg‘𝐺) = {〈𝐴, 𝐸〉}) | |
| 2 | 1hegrvtxdg1.v | . 2 ⊢ (𝜑 → (Vtx‘𝐺) = 𝑉) | |
| 3 | 1hegrvtxdg1.a | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝑋) | |
| 4 | 1hegrvtxdg1.b | . 2 ⊢ (𝜑 → 𝐵 ∈ 𝑉) | |
| 5 | 1hegrvtxdg1fi.fi | . 2 ⊢ (𝜑 → 𝑉 ∈ Fin) | |
| 6 | 1hegrvtxdg1fi.m | . 2 ⊢ (𝜑 → 𝐺 ∈ UMGraph) | |
| 7 | 1hegrvtxdg1.x | . 2 ⊢ (𝜑 → 𝐸 ∈ 𝒫 𝑉) | |
| 8 | 1hegrvtxdg1.e | . . 3 ⊢ (𝜑 → {𝐵, 𝐶} ⊆ 𝐸) | |
| 9 | prid1g 3814 | . . . 4 ⊢ (𝐵 ∈ 𝑉 → 𝐵 ∈ {𝐵, 𝐶}) | |
| 10 | 4, 9 | syl 14 | . . 3 ⊢ (𝜑 → 𝐵 ∈ {𝐵, 𝐶}) |
| 11 | 8, 10 | sseldd 3249 | . 2 ⊢ (𝜑 → 𝐵 ∈ 𝐸) |
| 12 | 1 | fveq1d 5695 | . . . 4 ⊢ (𝜑 → ((iEdg‘𝐺)‘𝐴) = ({〈𝐴, 𝐸〉}‘𝐴)) |
| 13 | fvsng 5905 | . . . . 5 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐸 ∈ 𝒫 𝑉) → ({〈𝐴, 𝐸〉}‘𝐴) = 𝐸) | |
| 14 | 3, 7, 13 | syl2anc 415 | . . . 4 ⊢ (𝜑 → ({〈𝐴, 𝐸〉}‘𝐴) = 𝐸) |
| 15 | 12, 14 | eqtrd 2271 | . . 3 ⊢ (𝜑 → ((iEdg‘𝐺)‘𝐴) = 𝐸) |
| 16 | snidg 3737 | . . . . . 6 ⊢ (𝐴 ∈ 𝑋 → 𝐴 ∈ {𝐴}) | |
| 17 | 3, 16 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ {𝐴}) |
| 18 | 1 | dmeqd 4981 | . . . . . 6 ⊢ (𝜑 → dom (iEdg‘𝐺) = dom {〈𝐴, 𝐸〉}) |
| 19 | dmsnopg 5257 | . . . . . . 7 ⊢ (𝐸 ∈ 𝒫 𝑉 → dom {〈𝐴, 𝐸〉} = {𝐴}) | |
| 20 | 7, 19 | syl 14 | . . . . . 6 ⊢ (𝜑 → dom {〈𝐴, 𝐸〉} = {𝐴}) |
| 21 | 18, 20 | eqtrd 2271 | . . . . 5 ⊢ (𝜑 → dom (iEdg‘𝐺) = {𝐴}) |
| 22 | 17, 21 | eleqtrrd 2318 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ dom (iEdg‘𝐺)) |
| 23 | eqid 2238 | . . . . 5 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 24 | eqid 2238 | . . . . 5 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
| 25 | 23, 24 | umgredg2en 16333 | . . . 4 ⊢ ((𝐺 ∈ UMGraph ∧ 𝐴 ∈ dom (iEdg‘𝐺)) → ((iEdg‘𝐺)‘𝐴) ≈ 2o) |
| 26 | 6, 22, 25 | syl2anc 415 | . . 3 ⊢ (𝜑 → ((iEdg‘𝐺)‘𝐴) ≈ 2o) |
| 27 | 15, 26 | eqbrtrrd 4152 | . 2 ⊢ (𝜑 → 𝐸 ≈ 2o) |
| 28 | 1, 2, 3, 4, 5, 6, 7, 11, 27 | 1hevtxdg1en 16532 | 1 ⊢ (𝜑 → ((VtxDeg‘𝐺)‘𝐵) = 1) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1402 ∈ wcel 2209 ≠ wne 2420 ⊆ wss 3220 𝒫 cpw 3688 {csn 3708 {cpr 3709 〈cop 3711 class class class wbr 4128 dom cdm 4772 ‘cfv 5375 2oc2o 6675 ≈ cen 7014 Fincfn 7016 1c1 8174 Vtxcvtx 16236 iEdgciedg 16237 UMGraphcumgr 16316 VtxDegcvtxdg 16510 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4244 ax-sep 4247 ax-nul 4257 ax-pow 4309 ax-pr 4344 ax-un 4576 ax-setind 4682 ax-iinf 4733 ax-cnex 8264 ax-resscn 8265 ax-1cn 8266 ax-1re 8267 ax-icn 8268 ax-addcl 8269 ax-addrcl 8270 ax-mulcl 8271 ax-addcom 8273 ax-mulcom 8274 ax-addass 8275 ax-mulass 8276 ax-distr 8277 ax-i2m1 8278 ax-0lt1 8279 ax-1rid 8280 ax-0id 8281 ax-rnegex 8282 ax-cnre 8284 ax-pre-ltirr 8285 ax-pre-ltwlin 8286 ax-pre-lttrn 8287 ax-pre-apti 8288 ax-pre-ltadd 8289 |
| This theorem depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-int 3969 df-iun 4012 df-br 4129 df-opab 4191 df-mpt 4192 df-tr 4228 df-id 4436 df-iord 4509 df-on 4511 df-ilim 4512 df-suc 4514 df-iom 4736 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-ima 4785 df-iota 5335 df-fun 5377 df-fn 5378 df-f 5379 df-f1 5380 df-fo 5381 df-f1o 5382 df-fv 5383 df-riota 6032 df-ov 6082 df-oprab 6083 df-mpo 6084 df-1st 6368 df-2nd 6369 df-recs 6570 df-frec 6656 df-1o 6681 df-2o 6682 df-er 6801 df-en 7017 df-dom 7018 df-fin 7019 df-pnf 8356 df-mnf 8357 df-xr 8358 df-ltxr 8359 df-le 8360 df-sub 8493 df-neg 8494 df-inn 9288 df-2 9346 df-3 9347 df-4 9348 df-5 9349 df-6 9350 df-7 9351 df-8 9352 df-9 9353 df-n0 9547 df-z 9628 df-dec 9761 df-uz 9905 df-xadd 10158 df-fz 10395 df-ihash 11198 df-ndx 13338 df-slot 13339 df-base 13341 df-edgf 16229 df-vtx 16238 df-iedg 16239 df-upgren 16317 df-umgren 16318 df-vtxdg 16511 |
| This theorem is referenced by: 1hegrvtxdg1rfi 16534 eupth2lem3lem4fi 16697 |
| Copyright terms: Public domain | W3C validator |