| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > friendship | Structured version Visualization version GIF version | ||
| Description: The friendship theorem: In every finite (nonempty) friendship graph there is a vertex which is adjacent to all other vertices. This is Metamath 100 proof #83. (Contributed by Alexander van der Vekens, 9-Oct-2018.) |
| Ref | Expression |
|---|---|
| friendship.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| Ref | Expression |
|---|---|
| friendship | ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑉 ≠ ∅ ∧ 𝑉 ∈ Fin) → ∃𝑣 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑣}){𝑣, 𝑤} ∈ (Edg‘𝐺)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr1 1215 | . . . 4 ⊢ ((3 < (♯‘𝑉) ∧ (𝐺 ∈ FriendGraph ∧ 𝑉 ≠ ∅ ∧ 𝑉 ∈ Fin)) → 𝐺 ∈ FriendGraph ) | |
| 2 | simpr3 1217 | . . . 4 ⊢ ((3 < (♯‘𝑉) ∧ (𝐺 ∈ FriendGraph ∧ 𝑉 ≠ ∅ ∧ 𝑉 ∈ Fin)) → 𝑉 ∈ Fin) | |
| 3 | simpl 488 | . . . 4 ⊢ ((3 < (♯‘𝑉) ∧ (𝐺 ∈ FriendGraph ∧ 𝑉 ≠ ∅ ∧ 𝑉 ∈ Fin)) → 3 < (♯‘𝑉)) | |
| 4 | friendship.v | . . . . 5 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 5 | 4 | friendshipgt3 31058 | . . . 4 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑉 ∈ Fin ∧ 3 < (♯‘𝑉)) → ∃𝑣 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑣}){𝑣, 𝑤} ∈ (Edg‘𝐺)) |
| 6 | 1, 2, 3, 5 | syl3anc 1401 | . . 3 ⊢ ((3 < (♯‘𝑉) ∧ (𝐺 ∈ FriendGraph ∧ 𝑉 ≠ ∅ ∧ 𝑉 ∈ Fin)) → ∃𝑣 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑣}){𝑣, 𝑤} ∈ (Edg‘𝐺)) |
| 7 | 6 | ex 418 | . 2 ⊢ (3 < (♯‘𝑉) → ((𝐺 ∈ FriendGraph ∧ 𝑉 ≠ ∅ ∧ 𝑉 ∈ Fin) → ∃𝑣 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑣}){𝑣, 𝑤} ∈ (Edg‘𝐺))) |
| 8 | hashcl 14540 | . . . . . . . . 9 ⊢ (𝑉 ∈ Fin → (♯‘𝑉) ∈ ℕ0) | |
| 9 | simplr 781 | . . . . . . . . . . 11 ⊢ ((((♯‘𝑉) ∈ ℕ0 ∧ 𝑉 ∈ Fin) ∧ (¬ 3 < (♯‘𝑉) ∧ 𝑉 ≠ ∅)) → 𝑉 ∈ Fin) | |
| 10 | hashge1 14573 | . . . . . . . . . . . 12 ⊢ ((𝑉 ∈ Fin ∧ 𝑉 ≠ ∅) → 1 ≤ (♯‘𝑉)) | |
| 11 | 10 | ad2ant2l 759 | . . . . . . . . . . 11 ⊢ ((((♯‘𝑉) ∈ ℕ0 ∧ 𝑉 ∈ Fin) ∧ (¬ 3 < (♯‘𝑉) ∧ 𝑉 ≠ ∅)) → 1 ≤ (♯‘𝑉)) |
| 12 | nn0re 12654 | . . . . . . . . . . . . . . . . 17 ⊢ ((♯‘𝑉) ∈ ℕ0 → (♯‘𝑉) ∈ ℝ) | |
| 13 | 3re 12462 | . . . . . . . . . . . . . . . . 17 ⊢ 3 ∈ ℝ | |
| 14 | lenlt 11426 | . . . . . . . . . . . . . . . . 17 ⊢ (((♯‘𝑉) ∈ ℝ ∧ 3 ∈ ℝ) → ((♯‘𝑉) ≤ 3 ↔ ¬ 3 < (♯‘𝑉))) | |
| 15 | 12, 13, 14 | sylancl 598 | . . . . . . . . . . . . . . . 16 ⊢ ((♯‘𝑉) ∈ ℕ0 → ((♯‘𝑉) ≤ 3 ↔ ¬ 3 < (♯‘𝑉))) |
| 16 | 15 | biimprd 251 | . . . . . . . . . . . . . . 15 ⊢ ((♯‘𝑉) ∈ ℕ0 → (¬ 3 < (♯‘𝑉) → (♯‘𝑉) ≤ 3)) |
| 17 | 16 | adantr 486 | . . . . . . . . . . . . . 14 ⊢ (((♯‘𝑉) ∈ ℕ0 ∧ 𝑉 ∈ Fin) → (¬ 3 < (♯‘𝑉) → (♯‘𝑉) ≤ 3)) |
| 18 | 17 | com12 33 | . . . . . . . . . . . . 13 ⊢ (¬ 3 < (♯‘𝑉) → (((♯‘𝑉) ∈ ℕ0 ∧ 𝑉 ∈ Fin) → (♯‘𝑉) ≤ 3)) |
| 19 | 18 | adantr 486 | . . . . . . . . . . . 12 ⊢ ((¬ 3 < (♯‘𝑉) ∧ 𝑉 ≠ ∅) → (((♯‘𝑉) ∈ ℕ0 ∧ 𝑉 ∈ Fin) → (♯‘𝑉) ≤ 3)) |
| 20 | 19 | impcom 413 | . . . . . . . . . . 11 ⊢ ((((♯‘𝑉) ∈ ℕ0 ∧ 𝑉 ∈ Fin) ∧ (¬ 3 < (♯‘𝑉) ∧ 𝑉 ≠ ∅)) → (♯‘𝑉) ≤ 3) |
| 21 | 9, 11, 20 | 3jca 1147 | . . . . . . . . . 10 ⊢ ((((♯‘𝑉) ∈ ℕ0 ∧ 𝑉 ∈ Fin) ∧ (¬ 3 < (♯‘𝑉) ∧ 𝑉 ≠ ∅)) → (𝑉 ∈ Fin ∧ 1 ≤ (♯‘𝑉) ∧ (♯‘𝑉) ≤ 3)) |
| 22 | 21 | exp31 425 | . . . . . . . . 9 ⊢ ((♯‘𝑉) ∈ ℕ0 → (𝑉 ∈ Fin → ((¬ 3 < (♯‘𝑉) ∧ 𝑉 ≠ ∅) → (𝑉 ∈ Fin ∧ 1 ≤ (♯‘𝑉) ∧ (♯‘𝑉) ≤ 3)))) |
| 23 | 8, 22 | mpcom 39 | . . . . . . . 8 ⊢ (𝑉 ∈ Fin → ((¬ 3 < (♯‘𝑉) ∧ 𝑉 ≠ ∅) → (𝑉 ∈ Fin ∧ 1 ≤ (♯‘𝑉) ∧ (♯‘𝑉) ≤ 3))) |
| 24 | 23 | impcom 413 | . . . . . . 7 ⊢ (((¬ 3 < (♯‘𝑉) ∧ 𝑉 ≠ ∅) ∧ 𝑉 ∈ Fin) → (𝑉 ∈ Fin ∧ 1 ≤ (♯‘𝑉) ∧ (♯‘𝑉) ≤ 3)) |
| 25 | hash1to3 14677 | . . . . . . 7 ⊢ ((𝑉 ∈ Fin ∧ 1 ≤ (♯‘𝑉) ∧ (♯‘𝑉) ≤ 3) → ∃𝑎∃𝑏∃𝑐(𝑉 = {𝑎} ∨ 𝑉 = {𝑎, 𝑏} ∨ 𝑉 = {𝑎, 𝑏, 𝑐})) | |
| 26 | vex 3457 | . . . . . . . . . 10 ⊢ 𝑎 ∈ V | |
| 27 | eqid 2766 | . . . . . . . . . . 11 ⊢ (Edg‘𝐺) = (Edg‘𝐺) | |
| 28 | 4, 27 | 1to3vfriendship 30941 | . . . . . . . . . 10 ⊢ ((𝑎 ∈ V ∧ (𝑉 = {𝑎} ∨ 𝑉 = {𝑎, 𝑏} ∨ 𝑉 = {𝑎, 𝑏, 𝑐})) → (𝐺 ∈ FriendGraph → ∃𝑣 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑣}){𝑣, 𝑤} ∈ (Edg‘𝐺))) |
| 29 | 26, 28 | mpan 703 | . . . . . . . . 9 ⊢ ((𝑉 = {𝑎} ∨ 𝑉 = {𝑎, 𝑏} ∨ 𝑉 = {𝑎, 𝑏, 𝑐}) → (𝐺 ∈ FriendGraph → ∃𝑣 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑣}){𝑣, 𝑤} ∈ (Edg‘𝐺))) |
| 30 | 29 | exlimiv 1967 | . . . . . . . 8 ⊢ (∃𝑐(𝑉 = {𝑎} ∨ 𝑉 = {𝑎, 𝑏} ∨ 𝑉 = {𝑎, 𝑏, 𝑐}) → (𝐺 ∈ FriendGraph → ∃𝑣 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑣}){𝑣, 𝑤} ∈ (Edg‘𝐺))) |
| 31 | 30 | exlimivv 1969 | . . . . . . 7 ⊢ (∃𝑎∃𝑏∃𝑐(𝑉 = {𝑎} ∨ 𝑉 = {𝑎, 𝑏} ∨ 𝑉 = {𝑎, 𝑏, 𝑐}) → (𝐺 ∈ FriendGraph → ∃𝑣 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑣}){𝑣, 𝑤} ∈ (Edg‘𝐺))) |
| 32 | 24, 25, 31 | 3syl 19 | . . . . . 6 ⊢ (((¬ 3 < (♯‘𝑉) ∧ 𝑉 ≠ ∅) ∧ 𝑉 ∈ Fin) → (𝐺 ∈ FriendGraph → ∃𝑣 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑣}){𝑣, 𝑤} ∈ (Edg‘𝐺))) |
| 33 | 32 | exp31 425 | . . . . 5 ⊢ (¬ 3 < (♯‘𝑉) → (𝑉 ≠ ∅ → (𝑉 ∈ Fin → (𝐺 ∈ FriendGraph → ∃𝑣 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑣}){𝑣, 𝑤} ∈ (Edg‘𝐺))))) |
| 34 | 33 | com14 97 | . . . 4 ⊢ (𝐺 ∈ FriendGraph → (𝑉 ≠ ∅ → (𝑉 ∈ Fin → (¬ 3 < (♯‘𝑉) → ∃𝑣 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑣}){𝑣, 𝑤} ∈ (Edg‘𝐺))))) |
| 35 | 34 | 3imp 1129 | . . 3 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑉 ≠ ∅ ∧ 𝑉 ∈ Fin) → (¬ 3 < (♯‘𝑉) → ∃𝑣 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑣}){𝑣, 𝑤} ∈ (Edg‘𝐺))) |
| 36 | 35 | com12 33 | . 2 ⊢ (¬ 3 < (♯‘𝑉) → ((𝐺 ∈ FriendGraph ∧ 𝑉 ≠ ∅ ∧ 𝑉 ∈ Fin) → ∃𝑣 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑣}){𝑣, 𝑤} ∈ (Edg‘𝐺))) |
| 37 | 7, 36 | pm2.61i 184 | 1 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑉 ≠ ∅ ∧ 𝑉 ∈ Fin) → ∃𝑣 ∈ 𝑉 ∀𝑤 ∈ (𝑉 ∖ {𝑣}){𝑣, 𝑤} ∈ (Edg‘𝐺)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∨ w3o 1103 ∧ w3a 1104 = wceq 1572 ∃wex 1814 ∈ wcel 2150 ≠ wne 2962 ∀wral 3083 ∃wrex 3093 Vcvv 3453 ∖ cdif 4047 ∅c0 4280 {csn 4587 {cpr 4589 {ctp 4591 class class class wbr 5107 ‘cfv 6565 Fincfn 9010 ℝcr 11237 1c1 11239 < clt 11381 ≤ cle 11382 3c3 12437 ℕ0cn0 12645 ♯chash 14514 Vtxcvtx 29633 Edgcedg 29684 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-3o 8515 df-oadd 8517 df-er 8754 df-ec 8756 df-qs 8760 df-map 8886 df-pm 8887 df-en 9011 df-dom 9012 df-sdom 9013 df-fin 9014 df-sup 9470 df-inf 9471 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-xadd 13281 df-ico 13521 df-fz 13679 df-fzo 13828 df-fl 13971 df-mod 14049 df-seq 14184 df-exp 14244 df-hash 14515 df-word 14699 df-lsw 14748 df-concat 14756 df-s1 14783 df-substr 14830 df-pfx 14862 df-reps 14961 df-csh 14981 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-dvds 16465 df-gcd 16707 df-prm 16890 df-phi 16989 df-vtx 29635 df-iedg 29636 df-edg 29685 df-uhgr 29695 df-ushgr 29696 df-upgr 29719 df-umgr 29720 df-uspgr 29790 df-usgr 29791 df-fusgr 29957 df-nbgr 29973 df-vtxdg 30106 df-rgr 30197 df-rusgr 30198 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-clwwlk 30632 df-clwwlkn 30675 df-clwwlknon 30738 df-conngr 30847 df-frgr 30919 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |