Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fusgrmaxsize | Structured version Visualization version GIF version |
Description: The maximum size of a finite simple graph with 𝑛 vertices is (((𝑛 − 1)∗𝑛) / 2). See statement in section I.1 of [Bollobas] p. 3 . (Contributed by Alexander van der Vekens, 13-Jan-2018.) (Revised by AV, 14-Nov-2020.) |
Ref | Expression |
---|---|
fusgrmaxsize.v | ⊢ 𝑉 = (Vtx‘𝐺) |
fusgrmaxsize.e | ⊢ 𝐸 = (Edg‘𝐺) |
Ref | Expression |
---|---|
fusgrmaxsize | ⊢ (𝐺 ∈ FinUSGraph → (♯‘𝐸) ≤ ((♯‘𝑉)C2)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fusgrmaxsize.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
2 | 1 | isfusgr 27094 | . 2 ⊢ (𝐺 ∈ FinUSGraph ↔ (𝐺 ∈ USGraph ∧ 𝑉 ∈ Fin)) |
3 | cusgrexg 27220 | . . . 4 ⊢ (𝑉 ∈ Fin → ∃𝑒〈𝑉, 𝑒〉 ∈ ComplUSGraph) | |
4 | 3 | adantl 484 | . . 3 ⊢ ((𝐺 ∈ USGraph ∧ 𝑉 ∈ Fin) → ∃𝑒〈𝑉, 𝑒〉 ∈ ComplUSGraph) |
5 | fusgrmaxsize.e | . . . . . 6 ⊢ 𝐸 = (Edg‘𝐺) | |
6 | 1 | fvexi 6678 | . . . . . . . 8 ⊢ 𝑉 ∈ V |
7 | vex 3497 | . . . . . . . 8 ⊢ 𝑒 ∈ V | |
8 | 6, 7 | opvtxfvi 26788 | . . . . . . 7 ⊢ (Vtx‘〈𝑉, 𝑒〉) = 𝑉 |
9 | 8 | eqcomi 2830 | . . . . . 6 ⊢ 𝑉 = (Vtx‘〈𝑉, 𝑒〉) |
10 | eqid 2821 | . . . . . 6 ⊢ (Edg‘〈𝑉, 𝑒〉) = (Edg‘〈𝑉, 𝑒〉) | |
11 | 1, 5, 9, 10 | sizusglecusg 27239 | . . . . 5 ⊢ ((𝐺 ∈ USGraph ∧ 〈𝑉, 𝑒〉 ∈ ComplUSGraph) → (♯‘𝐸) ≤ (♯‘(Edg‘〈𝑉, 𝑒〉))) |
12 | 11 | adantlr 713 | . . . 4 ⊢ (((𝐺 ∈ USGraph ∧ 𝑉 ∈ Fin) ∧ 〈𝑉, 𝑒〉 ∈ ComplUSGraph) → (♯‘𝐸) ≤ (♯‘(Edg‘〈𝑉, 𝑒〉))) |
13 | 9, 10 | cusgrsize 27230 | . . . . . . . 8 ⊢ ((〈𝑉, 𝑒〉 ∈ ComplUSGraph ∧ 𝑉 ∈ Fin) → (♯‘(Edg‘〈𝑉, 𝑒〉)) = ((♯‘𝑉)C2)) |
14 | breq2 5062 | . . . . . . . . 9 ⊢ ((♯‘(Edg‘〈𝑉, 𝑒〉)) = ((♯‘𝑉)C2) → ((♯‘𝐸) ≤ (♯‘(Edg‘〈𝑉, 𝑒〉)) ↔ (♯‘𝐸) ≤ ((♯‘𝑉)C2))) | |
15 | 14 | biimpd 231 | . . . . . . . 8 ⊢ ((♯‘(Edg‘〈𝑉, 𝑒〉)) = ((♯‘𝑉)C2) → ((♯‘𝐸) ≤ (♯‘(Edg‘〈𝑉, 𝑒〉)) → (♯‘𝐸) ≤ ((♯‘𝑉)C2))) |
16 | 13, 15 | syl 17 | . . . . . . 7 ⊢ ((〈𝑉, 𝑒〉 ∈ ComplUSGraph ∧ 𝑉 ∈ Fin) → ((♯‘𝐸) ≤ (♯‘(Edg‘〈𝑉, 𝑒〉)) → (♯‘𝐸) ≤ ((♯‘𝑉)C2))) |
17 | 16 | expcom 416 | . . . . . 6 ⊢ (𝑉 ∈ Fin → (〈𝑉, 𝑒〉 ∈ ComplUSGraph → ((♯‘𝐸) ≤ (♯‘(Edg‘〈𝑉, 𝑒〉)) → (♯‘𝐸) ≤ ((♯‘𝑉)C2)))) |
18 | 17 | adantl 484 | . . . . 5 ⊢ ((𝐺 ∈ USGraph ∧ 𝑉 ∈ Fin) → (〈𝑉, 𝑒〉 ∈ ComplUSGraph → ((♯‘𝐸) ≤ (♯‘(Edg‘〈𝑉, 𝑒〉)) → (♯‘𝐸) ≤ ((♯‘𝑉)C2)))) |
19 | 18 | imp 409 | . . . 4 ⊢ (((𝐺 ∈ USGraph ∧ 𝑉 ∈ Fin) ∧ 〈𝑉, 𝑒〉 ∈ ComplUSGraph) → ((♯‘𝐸) ≤ (♯‘(Edg‘〈𝑉, 𝑒〉)) → (♯‘𝐸) ≤ ((♯‘𝑉)C2))) |
20 | 12, 19 | mpd 15 | . . 3 ⊢ (((𝐺 ∈ USGraph ∧ 𝑉 ∈ Fin) ∧ 〈𝑉, 𝑒〉 ∈ ComplUSGraph) → (♯‘𝐸) ≤ ((♯‘𝑉)C2)) |
21 | 4, 20 | exlimddv 1932 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝑉 ∈ Fin) → (♯‘𝐸) ≤ ((♯‘𝑉)C2)) |
22 | 2, 21 | sylbi 219 | 1 ⊢ (𝐺 ∈ FinUSGraph → (♯‘𝐸) ≤ ((♯‘𝑉)C2)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1533 ∃wex 1776 ∈ wcel 2110 〈cop 4566 class class class wbr 5058 ‘cfv 6349 (class class class)co 7150 Fincfn 8503 ≤ cle 10670 2c2 11686 Ccbc 13656 ♯chash 13684 Vtxcvtx 26775 Edgcedg 26826 USGraphcusgr 26928 FinUSGraphcfusgr 27092 ComplUSGraphccusgr 27186 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5182 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-fal 1546 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-int 4869 df-iun 4913 df-br 5059 df-opab 5121 df-mpt 5139 df-tr 5165 df-id 5454 df-eprel 5459 df-po 5468 df-so 5469 df-fr 5508 df-we 5510 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-pred 6142 df-ord 6188 df-on 6189 df-lim 6190 df-suc 6191 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-1st 7683 df-2nd 7684 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-1o 8096 df-2o 8097 df-oadd 8100 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-fin 8507 df-dju 9324 df-card 9362 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-div 11292 df-nn 11633 df-2 11694 df-n0 11892 df-xnn0 11962 df-z 11976 df-uz 12238 df-rp 12384 df-fz 12887 df-seq 13364 df-fac 13628 df-bc 13657 df-hash 13685 df-vtx 26777 df-iedg 26778 df-edg 26827 df-uhgr 26837 df-upgr 26861 df-umgr 26862 df-uspgr 26929 df-usgr 26930 df-fusgr 27093 df-nbgr 27109 df-uvtx 27162 df-cplgr 27187 df-cusgr 27188 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |