| 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 2988 | . 2 ⊢ (𝜑 → 𝐶 ≠ 𝐵) |
| 7 | 1egrvtxdg1.i | . . 3 ⊢ (𝜑 → (iEdg‘𝐺) = {〈𝐴, {𝐵, 𝐶}〉}) | |
| 8 | prcom 4691 | . . . . . 6 ⊢ {𝐵, 𝐶} = {𝐶, 𝐵} | |
| 9 | 8 | a1i 11 | . . . . 5 ⊢ (𝜑 → {𝐵, 𝐶} = {𝐶, 𝐵}) |
| 10 | 9 | opeq2d 4838 | . . . 4 ⊢ (𝜑 → 〈𝐴, {𝐵, 𝐶}〉 = 〈𝐴, {𝐶, 𝐵}〉) |
| 11 | 10 | sneqd 4594 | . . 3 ⊢ (𝜑 → {〈𝐴, {𝐵, 𝐶}〉} = {〈𝐴, {𝐶, 𝐵}〉}) |
| 12 | 7, 11 | eqtrd 2772 | . 2 ⊢ (𝜑 → (iEdg‘𝐺) = {〈𝐴, {𝐶, 𝐵}〉}) |
| 13 | 1, 2, 3, 4, 6, 12 | 1egrvtxdg1 29601 | 1 ⊢ (𝜑 → ((VtxDeg‘𝐺)‘𝐶) = 1) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 {csn 4582 {cpr 4584 〈cop 4588 ‘cfv 6502 1c1 11041 Vtxcvtx 29087 iEdgciedg 29088 VtxDegcvtxdg 29557 |
| 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 5226 ax-sep 5245 ax-nul 5255 ax-pow 5314 ax-pr 5381 ax-un 7692 ax-cnex 11096 ax-resscn 11097 ax-1cn 11098 ax-icn 11099 ax-addcl 11100 ax-addrcl 11101 ax-mulcl 11102 ax-mulrcl 11103 ax-mulcom 11104 ax-addass 11105 ax-mulass 11106 ax-distr 11107 ax-i2m1 11108 ax-1ne0 11109 ax-1rid 11110 ax-rnegex 11111 ax-rrecex 11112 ax-cnre 11113 ax-pre-lttri 11114 ax-pre-lttrn 11115 ax-pre-ltadd 11116 ax-pre-mulgt0 11117 |
| 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 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5529 df-eprel 5534 df-po 5542 df-so 5543 df-fr 5587 df-we 5589 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-pred 6269 df-ord 6330 df-on 6331 df-lim 6332 df-suc 6333 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-f1 6507 df-fo 6508 df-f1o 6509 df-fv 6510 df-riota 7327 df-ov 7373 df-oprab 7374 df-mpo 7375 df-om 7821 df-1st 7945 df-2nd 7946 df-frecs 8235 df-wrecs 8266 df-recs 8315 df-rdg 8353 df-1o 8409 df-oadd 8413 df-er 8647 df-en 8898 df-dom 8899 df-sdom 8900 df-fin 8901 df-dju 9827 df-card 9865 df-pnf 11182 df-mnf 11183 df-xr 11184 df-ltxr 11185 df-le 11186 df-sub 11380 df-neg 11381 df-nn 12160 df-2 12222 df-n0 12416 df-xnn0 12489 df-z 12503 df-uz 12766 df-xadd 13041 df-fz 13438 df-hash 14268 df-edg 29139 df-upgr 29173 df-umgr 29174 df-uspgr 29241 df-usgr 29242 df-vtxdg 29558 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |