| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > frgrhash2wsp | Structured version Visualization version GIF version | ||
| Description: The number of simple paths of length 2 is n*(n-1) in a friendship graph with n vertices. This corresponds to the proof of claim 3 in [Huneke] p. 2: "... the paths of length two in G: by assumption there are ( n 2 ) such paths.". However, Huneke counts undirected paths, so obtains the result ((𝑛C2) = ((𝑛 · (𝑛 − 1)) / 2)), whereas we count directed paths, obtaining twice that number. (Contributed by Alexander van der Vekens, 6-Mar-2018.) (Revised by AV, 10-Jan-2022.) |
| Ref | Expression |
|---|---|
| frgrhash2wsp.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| Ref | Expression |
|---|---|
| frgrhash2wsp | ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑉 ∈ Fin) → (♯‘(2 WSPathsN 𝐺)) = ((♯‘𝑉) · ((♯‘𝑉) − 1))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2nn 12455 | . . . . 5 ⊢ 2 ∈ ℕ | |
| 2 | frgrhash2wsp.v | . . . . . 6 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 3 | 2 | wspniunwspnon 30571 | . . . . 5 ⊢ ((2 ∈ ℕ ∧ 𝐺 ∈ FriendGraph ) → (2 WSPathsN 𝐺) = ∪ 𝑎 ∈ 𝑉 ∪ 𝑏 ∈ (𝑉 ∖ {𝑎})(𝑎(2 WSPathsNOn 𝐺)𝑏)) |
| 4 | 1, 3 | mpan 703 | . . . 4 ⊢ (𝐺 ∈ FriendGraph → (2 WSPathsN 𝐺) = ∪ 𝑎 ∈ 𝑉 ∪ 𝑏 ∈ (𝑉 ∖ {𝑎})(𝑎(2 WSPathsNOn 𝐺)𝑏)) |
| 5 | 4 | fveq2d 6919 | . . 3 ⊢ (𝐺 ∈ FriendGraph → (♯‘(2 WSPathsN 𝐺)) = (♯‘∪ 𝑎 ∈ 𝑉 ∪ 𝑏 ∈ (𝑉 ∖ {𝑎})(𝑎(2 WSPathsNOn 𝐺)𝑏))) |
| 6 | 5 | adantr 486 | . 2 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑉 ∈ Fin) → (♯‘(2 WSPathsN 𝐺)) = (♯‘∪ 𝑎 ∈ 𝑉 ∪ 𝑏 ∈ (𝑉 ∖ {𝑎})(𝑎(2 WSPathsNOn 𝐺)𝑏))) |
| 7 | simpr 490 | . . 3 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑉 ∈ Fin) → 𝑉 ∈ Fin) | |
| 8 | eqid 2766 | . . 3 ⊢ (𝑉 ∖ {𝑎}) = (𝑉 ∖ {𝑎}) | |
| 9 | 2 | eleq1i 2858 | . . . . . 6 ⊢ (𝑉 ∈ Fin ↔ (Vtx‘𝐺) ∈ Fin) |
| 10 | wspthnonfi 30570 | . . . . . 6 ⊢ ((Vtx‘𝐺) ∈ Fin → (𝑎(2 WSPathsNOn 𝐺)𝑏) ∈ Fin) | |
| 11 | 9, 10 | sylbi 220 | . . . . 5 ⊢ (𝑉 ∈ Fin → (𝑎(2 WSPathsNOn 𝐺)𝑏) ∈ Fin) |
| 12 | 11 | adantl 487 | . . . 4 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑉 ∈ Fin) → (𝑎(2 WSPathsNOn 𝐺)𝑏) ∈ Fin) |
| 13 | 12 | 3ad2ant1 1152 | . . 3 ⊢ (((𝐺 ∈ FriendGraph ∧ 𝑉 ∈ Fin) ∧ 𝑎 ∈ 𝑉 ∧ 𝑏 ∈ (𝑉 ∖ {𝑎})) → (𝑎(2 WSPathsNOn 𝐺)𝑏) ∈ Fin) |
| 14 | 2wspiundisj 30614 | . . . 4 ⊢ Disj 𝑎 ∈ 𝑉 ∪ 𝑏 ∈ (𝑉 ∖ {𝑎})(𝑎(2 WSPathsNOn 𝐺)𝑏) | |
| 15 | 14 | a1i 11 | . . 3 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑉 ∈ Fin) → Disj 𝑎 ∈ 𝑉 ∪ 𝑏 ∈ (𝑉 ∖ {𝑎})(𝑎(2 WSPathsNOn 𝐺)𝑏)) |
| 16 | 2wspdisj 30613 | . . . 4 ⊢ Disj 𝑏 ∈ (𝑉 ∖ {𝑎})(𝑎(2 WSPathsNOn 𝐺)𝑏) | |
| 17 | 16 | a1i 11 | . . 3 ⊢ (((𝐺 ∈ FriendGraph ∧ 𝑉 ∈ Fin) ∧ 𝑎 ∈ 𝑉) → Disj 𝑏 ∈ (𝑉 ∖ {𝑎})(𝑎(2 WSPathsNOn 𝐺)𝑏)) |
| 18 | simplll 787 | . . . . 5 ⊢ ((((𝐺 ∈ FriendGraph ∧ 𝑉 ∈ Fin) ∧ 𝑎 ∈ 𝑉) ∧ 𝑏 ∈ (𝑉 ∖ {𝑎})) → 𝐺 ∈ FriendGraph ) | |
| 19 | simpr 490 | . . . . . 6 ⊢ (((𝐺 ∈ FriendGraph ∧ 𝑉 ∈ Fin) ∧ 𝑎 ∈ 𝑉) → 𝑎 ∈ 𝑉) | |
| 20 | eldifi 4069 | . . . . . 6 ⊢ (𝑏 ∈ (𝑉 ∖ {𝑎}) → 𝑏 ∈ 𝑉) | |
| 21 | 19, 20 | anim12i 625 | . . . . 5 ⊢ ((((𝐺 ∈ FriendGraph ∧ 𝑉 ∈ Fin) ∧ 𝑎 ∈ 𝑉) ∧ 𝑏 ∈ (𝑉 ∖ {𝑎})) → (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) |
| 22 | eldifsni 4754 | . . . . . . 7 ⊢ (𝑏 ∈ (𝑉 ∖ {𝑎}) → 𝑏 ≠ 𝑎) | |
| 23 | 22 | necomd 3017 | . . . . . 6 ⊢ (𝑏 ∈ (𝑉 ∖ {𝑎}) → 𝑎 ≠ 𝑏) |
| 24 | 23 | adantl 487 | . . . . 5 ⊢ ((((𝐺 ∈ FriendGraph ∧ 𝑉 ∈ Fin) ∧ 𝑎 ∈ 𝑉) ∧ 𝑏 ∈ (𝑉 ∖ {𝑎})) → 𝑎 ≠ 𝑏) |
| 25 | 2 | frgr2wsp1 30990 | . . . . 5 ⊢ ((𝐺 ∈ FriendGraph ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ 𝑎 ≠ 𝑏) → (♯‘(𝑎(2 WSPathsNOn 𝐺)𝑏)) = 1) |
| 26 | 18, 21, 24, 25 | syl3anc 1401 | . . . 4 ⊢ ((((𝐺 ∈ FriendGraph ∧ 𝑉 ∈ Fin) ∧ 𝑎 ∈ 𝑉) ∧ 𝑏 ∈ (𝑉 ∖ {𝑎})) → (♯‘(𝑎(2 WSPathsNOn 𝐺)𝑏)) = 1) |
| 27 | 26 | 3impa 1128 | . . 3 ⊢ (((𝐺 ∈ FriendGraph ∧ 𝑉 ∈ Fin) ∧ 𝑎 ∈ 𝑉 ∧ 𝑏 ∈ (𝑉 ∖ {𝑎})) → (♯‘(𝑎(2 WSPathsNOn 𝐺)𝑏)) = 1) |
| 28 | 7, 8, 13, 15, 17, 27 | hash2iun1dif1 16034 | . 2 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑉 ∈ Fin) → (♯‘∪ 𝑎 ∈ 𝑉 ∪ 𝑏 ∈ (𝑉 ∖ {𝑎})(𝑎(2 WSPathsNOn 𝐺)𝑏)) = ((♯‘𝑉) · ((♯‘𝑉) − 1))) |
| 29 | 6, 28 | eqtrd 2801 | 1 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑉 ∈ Fin) → (♯‘(2 WSPathsN 𝐺)) = ((♯‘𝑉) · ((♯‘𝑉) − 1))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1572 ∈ wcel 2150 ≠ wne 2962 ∖ cdif 4047 {csn 4587 ∪ ciun 4955 Disj wdisj 5074 ‘cfv 6565 (class class class)co 7450 Fincfn 9010 1c1 11239 · cmul 11243 − cmin 11579 ℕcn 12374 2c2 12436 ♯chash 14514 Vtxcvtx 29633 WSPathsN cwwspthsn 30476 WSPathsNOn cwwspthsnon 30477 FriendGraph cfrgr 30918 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-rep 5237 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-inf2 9678 ax-cnex 11294 ax-resscn 11295 ax-1cn 11296 ax-icn 11297 ax-addcl 11298 ax-addrcl 11299 ax-mulcl 11300 ax-mulrcl 11301 ax-mulcom 11302 ax-addass 11303 ax-mulass 11304 ax-distr 11305 ax-i2m1 11306 ax-1ne0 11307 ax-1rid 11308 ax-rnegex 11309 ax-rrecex 11310 ax-cnre 11311 ax-pre-lttri 11312 ax-pre-lttrn 11313 ax-pre-ltadd 11314 ax-pre-mulgt0 11315 ax-pre-sup 11316 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-ifp 1080 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-nel 3069 df-ral 3084 df-rex 3094 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4840 df-uni 4872 df-int 4912 df-iun 4957 df-disj 5075 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-se 5611 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-ord 6390 df-on 6391 df-lim 6392 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-isom 6574 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-om 7911 df-1st 8034 df-2nd 8035 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-1o 8513 df-2o 8514 df-oadd 8517 df-er 8754 df-map 8886 df-pm 8887 df-en 9011 df-dom 9012 df-sdom 9013 df-fin 9014 df-sup 9470 df-oi 9540 df-dju 10018 df-card 10056 df-pnf 11383 df-mnf 11384 df-xr 11385 df-ltxr 11386 df-le 11387 df-sub 11581 df-neg 11582 df-div 12013 df-nn 12375 df-2 12444 df-3 12445 df-n0 12646 df-xnn0 12719 df-z 12733 df-uz 13005 df-rp 13160 df-fz 13679 df-fzo 13828 df-seq 14184 df-exp 14244 df-hash 14515 df-word 14699 df-concat 14756 df-s1 14783 df-s2 15040 df-s3 15041 df-cj 15308 df-re 15309 df-im 15310 df-sqrt 15444 df-abs 15445 df-clim 15698 df-sum 15897 df-edg 29685 df-uhgr 29695 df-upgr 29719 df-umgr 29720 df-uspgr 29790 df-usgr 29791 df-wlks 30239 df-wlkson 30240 df-trls 30334 df-trlson 30335 df-pths 30358 df-spths 30359 df-pthson 30360 df-spthson 30361 df-wwlks 30478 df-wwlksn 30479 df-wwlksnon 30480 df-wspthsn 30481 df-wspthsnon 30482 df-frgr 30919 |
| This theorem is used by: frrusgrord0 31000 |
| Copyright terms: Public domain | W3C validator |