| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 1egrvtxdg1r | Structured version Visualization version GIF version | ||
| Description: The vertex degree of a one-edge graph, case 3: an edge from some other vertex to the given 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, 21-Feb-2021.) |
| Ref | Expression |
|---|---|
| 1egrvtxdg1.v | ⊢ (𝜑 → (Vtx‘𝐺) = 𝑉) |
| 1egrvtxdg1.a | ⊢ (𝜑 → 𝐴 ∈ 𝑋) |
| 1egrvtxdg1.b | ⊢ (𝜑 → 𝐵 ∈ 𝑉) |
| 1egrvtxdg1.c | ⊢ (𝜑 → 𝐶 ∈ 𝑉) |
| 1egrvtxdg1.n | ⊢ (𝜑 → 𝐵 ≠ 𝐶) |
| 1egrvtxdg1.i | ⊢ (𝜑 → (iEdg‘𝐺) = {〈𝐴, {𝐵, 𝐶}〉}) |
| Ref | Expression |
|---|---|
| 1egrvtxdg1r | ⊢ (𝜑 → ((VtxDeg‘𝐺)‘𝐶) = 1) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 1egrvtxdg1.v | . 2 ⊢ (𝜑 → (Vtx‘𝐺) = 𝑉) | |
| 2 | 1egrvtxdg1.a | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝑋) | |
| 3 | 1egrvtxdg1.c | . 2 ⊢ (𝜑 → 𝐶 ∈ 𝑉) | |
| 4 | 1egrvtxdg1.b | . 2 ⊢ (𝜑 → 𝐵 ∈ 𝑉) | |
| 5 | 1egrvtxdg1.n | . . 3 ⊢ (𝜑 → 𝐵 ≠ 𝐶) | |
| 6 | 5 | necomd 3010 | . 2 ⊢ (𝜑 → 𝐶 ≠ 𝐵) |
| 7 | 1egrvtxdg1.i | . . 3 ⊢ (𝜑 → (iEdg‘𝐺) = {〈𝐴, {𝐵, 𝐶}〉}) | |
| 8 | prcom 4692 | . . . . . 6 ⊢ {𝐵, 𝐶} = {𝐶, 𝐵} | |
| 9 | 8 | a1i 11 | . . . . 5 ⊢ (𝜑 → {𝐵, 𝐶} = {𝐶, 𝐵}) |
| 10 | 9 | opeq2d 4839 | . . . 4 ⊢ (𝜑 → 〈𝐴, {𝐵, 𝐶}〉 = 〈𝐴, {𝐶, 𝐵}〉) |
| 11 | 10 | sneqd 4595 | . . 3 ⊢ (𝜑 → {〈𝐴, {𝐵, 𝐶}〉} = {〈𝐴, {𝐶, 𝐵}〉}) |
| 12 | 7, 11 | eqtrd 2795 | . 2 ⊢ (𝜑 → (iEdg‘𝐺) = {〈𝐴, {𝐶, 𝐵}〉}) |
| 13 | 1, 2, 3, 4, 6, 12 | 1egrvtxdg1 30090 | 1 ⊢ (𝜑 → ((VtxDeg‘𝐺)‘𝐶) = 1) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 {csn 4583 {cpr 4585 〈cop 4589 ‘cfv 6538 1c1 11201 Vtxcvtx 29574 iEdgciedg 29575 VtxDegcvtxdg 30046 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-1o 8476 df-oadd 8480 df-er 8717 df-en 8974 df-dom 8975 df-sdom 8976 df-fin 8977 df-dju 9982 df-card 10020 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-nn 12336 df-2 12405 df-n0 12607 df-xnn0 12680 df-z 12694 df-uz 12966 df-xadd 13242 df-fz 13640 df-hash 14475 df-edg 29626 df-upgr 29660 df-umgr 29661 df-uspgr 29731 df-usgr 29732 df-vtxdg 30047 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |