| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cusgrsizeindslem | Structured version Visualization version GIF version | ||
| Description: Lemma for cusgrsizeinds 29898. (Contributed by Alexander van der Vekens, 11-Jan-2018.) (Revised by AV, 9-Nov-2020.) |
| Ref | Expression |
|---|---|
| cusgrsizeindb0.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| cusgrsizeindb0.e | ⊢ 𝐸 = (Edg‘𝐺) |
| Ref | Expression |
|---|---|
| cusgrsizeindslem | ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑉 ∈ Fin ∧ 𝑁 ∈ 𝑉) → (♯‘{𝑒 ∈ 𝐸 ∣ 𝑁 ∈ 𝑒}) = ((♯‘𝑉) − 1)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cusgrcplgr 29866 | . . . . 5 ⊢ (𝐺 ∈ ComplUSGraph → 𝐺 ∈ ComplGraph) | |
| 2 | cusgrsizeindb0.v | . . . . . 6 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 3 | 2 | nbcplgr 29880 | . . . . 5 ⊢ ((𝐺 ∈ ComplGraph ∧ 𝑁 ∈ 𝑉) → (𝐺 NeighbVtx 𝑁) = (𝑉 ∖ {𝑁})) |
| 4 | 1, 3 | sylan 592 | . . . 4 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑁 ∈ 𝑉) → (𝐺 NeighbVtx 𝑁) = (𝑉 ∖ {𝑁})) |
| 5 | 4 | 3adant2 1149 | . . 3 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑉 ∈ Fin ∧ 𝑁 ∈ 𝑉) → (𝐺 NeighbVtx 𝑁) = (𝑉 ∖ {𝑁})) |
| 6 | 5 | fveq2d 6886 | . 2 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑉 ∈ Fin ∧ 𝑁 ∈ 𝑉) → (♯‘(𝐺 NeighbVtx 𝑁)) = (♯‘(𝑉 ∖ {𝑁}))) |
| 7 | cusgrusgr 29865 | . . . . . 6 ⊢ (𝐺 ∈ ComplUSGraph → 𝐺 ∈ USGraph) | |
| 8 | 7 | anim1i 627 | . . . . 5 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑁 ∈ 𝑉) → (𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉)) |
| 9 | 8 | 3adant2 1149 | . . . 4 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑉 ∈ Fin ∧ 𝑁 ∈ 𝑉) → (𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉)) |
| 10 | cusgrsizeindb0.e | . . . . 5 ⊢ 𝐸 = (Edg‘𝐺) | |
| 11 | 2, 10 | nbusgrf1o 29817 | . . . 4 ⊢ ((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) → ∃𝑓 𝑓:(𝐺 NeighbVtx 𝑁)–1-1-onto→{𝑒 ∈ 𝐸 ∣ 𝑁 ∈ 𝑒}) |
| 12 | 9, 11 | syl 18 | . . 3 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑉 ∈ Fin ∧ 𝑁 ∈ 𝑉) → ∃𝑓 𝑓:(𝐺 NeighbVtx 𝑁)–1-1-onto→{𝑒 ∈ 𝐸 ∣ 𝑁 ∈ 𝑒}) |
| 13 | 2, 10 | nbusgr 29795 | . . . . . . . 8 ⊢ (𝐺 ∈ USGraph → (𝐺 NeighbVtx 𝑁) = {𝑛 ∈ 𝑉 ∣ {𝑁, 𝑛} ∈ 𝐸}) |
| 14 | 7, 13 | syl 18 | . . . . . . 7 ⊢ (𝐺 ∈ ComplUSGraph → (𝐺 NeighbVtx 𝑁) = {𝑛 ∈ 𝑉 ∣ {𝑁, 𝑛} ∈ 𝐸}) |
| 15 | 14 | adantr 486 | . . . . . 6 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑉 ∈ Fin) → (𝐺 NeighbVtx 𝑁) = {𝑛 ∈ 𝑉 ∣ {𝑁, 𝑛} ∈ 𝐸}) |
| 16 | rabfi 9244 | . . . . . . 7 ⊢ (𝑉 ∈ Fin → {𝑛 ∈ 𝑉 ∣ {𝑁, 𝑛} ∈ 𝐸} ∈ Fin) | |
| 17 | 16 | adantl 487 | . . . . . 6 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑉 ∈ Fin) → {𝑛 ∈ 𝑉 ∣ {𝑁, 𝑛} ∈ 𝐸} ∈ Fin) |
| 18 | 15, 17 | eqeltrd 2862 | . . . . 5 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑉 ∈ Fin) → (𝐺 NeighbVtx 𝑁) ∈ Fin) |
| 19 | 18 | 3adant3 1150 | . . . 4 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑉 ∈ Fin ∧ 𝑁 ∈ 𝑉) → (𝐺 NeighbVtx 𝑁) ∈ Fin) |
| 20 | 7 | anim1i 627 | . . . . . . 7 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑉 ∈ Fin) → (𝐺 ∈ USGraph ∧ 𝑉 ∈ Fin)) |
| 21 | 2 | isfusgr 29764 | . . . . . . 7 ⊢ (𝐺 ∈ FinUSGraph ↔ (𝐺 ∈ USGraph ∧ 𝑉 ∈ Fin)) |
| 22 | 20, 21 | sylibr 237 | . . . . . 6 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑉 ∈ Fin) → 𝐺 ∈ FinUSGraph) |
| 23 | fusgrfis 29776 | . . . . . . . 8 ⊢ (𝐺 ∈ FinUSGraph → (Edg‘𝐺) ∈ Fin) | |
| 24 | 10, 23 | eqeltrid 2866 | . . . . . . 7 ⊢ (𝐺 ∈ FinUSGraph → 𝐸 ∈ Fin) |
| 25 | rabfi 9244 | . . . . . . 7 ⊢ (𝐸 ∈ Fin → {𝑒 ∈ 𝐸 ∣ 𝑁 ∈ 𝑒} ∈ Fin) | |
| 26 | 24, 25 | syl 18 | . . . . . 6 ⊢ (𝐺 ∈ FinUSGraph → {𝑒 ∈ 𝐸 ∣ 𝑁 ∈ 𝑒} ∈ Fin) |
| 27 | 22, 26 | syl 18 | . . . . 5 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑉 ∈ Fin) → {𝑒 ∈ 𝐸 ∣ 𝑁 ∈ 𝑒} ∈ Fin) |
| 28 | 27 | 3adant3 1150 | . . . 4 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑉 ∈ Fin ∧ 𝑁 ∈ 𝑉) → {𝑒 ∈ 𝐸 ∣ 𝑁 ∈ 𝑒} ∈ Fin) |
| 29 | hasheqf1o 14415 | . . . 4 ⊢ (((𝐺 NeighbVtx 𝑁) ∈ Fin ∧ {𝑒 ∈ 𝐸 ∣ 𝑁 ∈ 𝑒} ∈ Fin) → ((♯‘(𝐺 NeighbVtx 𝑁)) = (♯‘{𝑒 ∈ 𝐸 ∣ 𝑁 ∈ 𝑒}) ↔ ∃𝑓 𝑓:(𝐺 NeighbVtx 𝑁)–1-1-onto→{𝑒 ∈ 𝐸 ∣ 𝑁 ∈ 𝑒})) | |
| 30 | 19, 28, 29 | syl2anc 596 | . . 3 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑉 ∈ Fin ∧ 𝑁 ∈ 𝑉) → ((♯‘(𝐺 NeighbVtx 𝑁)) = (♯‘{𝑒 ∈ 𝐸 ∣ 𝑁 ∈ 𝑒}) ↔ ∃𝑓 𝑓:(𝐺 NeighbVtx 𝑁)–1-1-onto→{𝑒 ∈ 𝐸 ∣ 𝑁 ∈ 𝑒})) |
| 31 | 12, 30 | mpbird 260 | . 2 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑉 ∈ Fin ∧ 𝑁 ∈ 𝑉) → (♯‘(𝐺 NeighbVtx 𝑁)) = (♯‘{𝑒 ∈ 𝐸 ∣ 𝑁 ∈ 𝑒})) |
| 32 | hashdifsn 14481 | . . 3 ⊢ ((𝑉 ∈ Fin ∧ 𝑁 ∈ 𝑉) → (♯‘(𝑉 ∖ {𝑁})) = ((♯‘𝑉) − 1)) | |
| 33 | 32 | 3adant1 1148 | . 2 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑉 ∈ Fin ∧ 𝑁 ∈ 𝑉) → (♯‘(𝑉 ∖ {𝑁})) = ((♯‘𝑉) − 1)) |
| 34 | 6, 31, 33 | 3eqtr3d 2805 | 1 ⊢ ((𝐺 ∈ ComplUSGraph ∧ 𝑉 ∈ Fin ∧ 𝑁 ∈ 𝑉) → (♯‘{𝑒 ∈ 𝐸 ∣ 𝑁 ∈ 𝑒}) = ((♯‘𝑉) − 1)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∃wex 1812 ∈ wcel 2145 {crab 3414 ∖ cdif 3899 {csn 4587 {cpr 4589 –1-1-onto→wf1o 6536 ‘cfv 6537 (class class class)co 7416 Fincfn 8955 1c1 11128 − cmin 11468 ♯chash 14396 Vtxcvtx 29439 Edgcedg 29490 USGraphcusgr 29595 FinUSGraphcfusgr 29762 NeighbVtx cnbgr 29778 ComplGraphccplgr 29855 ComplUSGraphccusgr 29856 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-int 4911 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7866 df-1st 7989 df-2nd 7990 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8458 df-2o 8459 df-oadd 8462 df-er 8699 df-en 8956 df-dom 8957 df-sdom 8958 df-fin 8959 df-dju 9909 df-card 9947 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-nn 12261 df-2 12330 df-n0 12532 df-xnn0 12605 df-z 12619 df-uz 12891 df-fz 13564 df-hash 14397 df-vtx 29441 df-iedg 29442 df-edg 29491 df-uhgr 29501 df-upgr 29525 df-umgr 29526 df-uspgr 29596 df-usgr 29597 df-fusgr 29763 df-nbgr 29779 df-uvtx 29832 df-cplgr 29857 df-cusgr 29858 |
| This theorem is used by: cusgrsizeinds 29898 |
| Copyright terms: Public domain | W3C validator |