![]() |
Mathbox for BTernaryTau |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > usgrcyclgt2v | Structured version Visualization version GIF version |
Description: A simple graph with a non-trivial cycle must have at least 3 vertices. (Contributed by BTernaryTau, 5-Oct-2023.) |
Ref | Expression |
---|---|
usgrcyclgt2v.1 | ⊢ 𝑉 = (Vtx‘𝐺) |
Ref | Expression |
---|---|
usgrcyclgt2v | ⊢ ((𝐺 ∈ USGraph ∧ 𝐹(Cycles‘𝐺)𝑃 ∧ 𝐹 ≠ ∅) → 2 < (♯‘𝑉)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 2re 12330 | . . . 4 ⊢ 2 ∈ ℝ | |
2 | 1 | rexri 11311 | . . 3 ⊢ 2 ∈ ℝ* |
3 | 2 | a1i 11 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝐹(Cycles‘𝐺)𝑃 ∧ 𝐹 ≠ ∅) → 2 ∈ ℝ*) |
4 | cycliswlk 29730 | . . . 4 ⊢ (𝐹(Cycles‘𝐺)𝑃 → 𝐹(Walks‘𝐺)𝑃) | |
5 | wlkcl 29547 | . . . 4 ⊢ (𝐹(Walks‘𝐺)𝑃 → (♯‘𝐹) ∈ ℕ0) | |
6 | nn0xnn0 12592 | . . . 4 ⊢ ((♯‘𝐹) ∈ ℕ0 → (♯‘𝐹) ∈ ℕ0*) | |
7 | xnn0xr 12593 | . . . 4 ⊢ ((♯‘𝐹) ∈ ℕ0* → (♯‘𝐹) ∈ ℝ*) | |
8 | 4, 5, 6, 7 | 4syl 19 | . . 3 ⊢ (𝐹(Cycles‘𝐺)𝑃 → (♯‘𝐹) ∈ ℝ*) |
9 | 8 | 3ad2ant2 1131 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝐹(Cycles‘𝐺)𝑃 ∧ 𝐹 ≠ ∅) → (♯‘𝐹) ∈ ℝ*) |
10 | usgrcyclgt2v.1 | . . . . 5 ⊢ 𝑉 = (Vtx‘𝐺) | |
11 | 10 | fvexi 6905 | . . . 4 ⊢ 𝑉 ∈ V |
12 | hashxnn0 14349 | . . . 4 ⊢ (𝑉 ∈ V → (♯‘𝑉) ∈ ℕ0*) | |
13 | xnn0xr 12593 | . . . 4 ⊢ ((♯‘𝑉) ∈ ℕ0* → (♯‘𝑉) ∈ ℝ*) | |
14 | 11, 12, 13 | mp2b 10 | . . 3 ⊢ (♯‘𝑉) ∈ ℝ* |
15 | 14 | a1i 11 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝐹(Cycles‘𝐺)𝑃 ∧ 𝐹 ≠ ∅) → (♯‘𝑉) ∈ ℝ*) |
16 | usgrgt2cycl 34969 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝐹(Cycles‘𝐺)𝑃 ∧ 𝐹 ≠ ∅) → 2 < (♯‘𝐹)) | |
17 | cyclispth 29729 | . . . 4 ⊢ (𝐹(Cycles‘𝐺)𝑃 → 𝐹(Paths‘𝐺)𝑃) | |
18 | 10 | pthhashvtx 34966 | . . . 4 ⊢ (𝐹(Paths‘𝐺)𝑃 → (♯‘𝐹) ≤ (♯‘𝑉)) |
19 | 17, 18 | syl 17 | . . 3 ⊢ (𝐹(Cycles‘𝐺)𝑃 → (♯‘𝐹) ≤ (♯‘𝑉)) |
20 | 19 | 3ad2ant2 1131 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝐹(Cycles‘𝐺)𝑃 ∧ 𝐹 ≠ ∅) → (♯‘𝐹) ≤ (♯‘𝑉)) |
21 | 3, 9, 15, 16, 20 | xrltletrd 13186 | 1 ⊢ ((𝐺 ∈ USGraph ∧ 𝐹(Cycles‘𝐺)𝑃 ∧ 𝐹 ≠ ∅) → 2 < (♯‘𝑉)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1084 = wceq 1534 ∈ wcel 2099 ≠ wne 2930 Vcvv 3463 ∅c0 4323 class class class wbr 5144 ‘cfv 6544 ℝ*cxr 11286 < clt 11287 ≤ cle 11288 2c2 12311 ℕ0cn0 12516 ℕ0*cxnn0 12588 ♯chash 14340 Vtxcvtx 28927 USGraphcusgr 29080 Walkscwlks 29528 Pathscpths 29644 Cyclesccycls 29717 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2697 ax-rep 5281 ax-sep 5295 ax-nul 5302 ax-pow 5360 ax-pr 5424 ax-un 7736 ax-cnex 11203 ax-resscn 11204 ax-1cn 11205 ax-icn 11206 ax-addcl 11207 ax-addrcl 11208 ax-mulcl 11209 ax-mulrcl 11210 ax-mulcom 11211 ax-addass 11212 ax-mulass 11213 ax-distr 11214 ax-i2m1 11215 ax-1ne0 11216 ax-1rid 11217 ax-rnegex 11218 ax-rrecex 11219 ax-cnre 11220 ax-pre-lttri 11221 ax-pre-lttrn 11222 ax-pre-ltadd 11223 ax-pre-mulgt0 11224 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-ifp 1061 df-3or 1085 df-3an 1086 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2704 df-cleq 2718 df-clel 2803 df-nfc 2878 df-ne 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-reu 3366 df-rab 3421 df-v 3465 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3967 df-nul 4324 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4907 df-int 4948 df-iun 4996 df-br 5145 df-opab 5207 df-mpt 5228 df-tr 5262 df-id 5571 df-eprel 5577 df-po 5585 df-so 5586 df-fr 5628 df-we 5630 df-xp 5679 df-rel 5680 df-cnv 5681 df-co 5682 df-dm 5683 df-rn 5684 df-res 5685 df-ima 5686 df-pred 6303 df-ord 6369 df-on 6370 df-lim 6371 df-suc 6372 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7370 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7867 df-1st 7993 df-2nd 7994 df-frecs 8286 df-wrecs 8317 df-recs 8391 df-rdg 8430 df-1o 8486 df-2o 8487 df-oadd 8490 df-er 8724 df-map 8847 df-pm 8848 df-en 8965 df-dom 8966 df-sdom 8967 df-fin 8968 df-dju 9935 df-card 9973 df-pnf 11289 df-mnf 11290 df-xr 11291 df-ltxr 11292 df-le 11293 df-sub 11485 df-neg 11486 df-nn 12257 df-2 12319 df-n0 12517 df-xnn0 12589 df-z 12603 df-uz 12867 df-fz 13531 df-fzo 13674 df-hash 14341 df-word 14516 df-edg 28979 df-uhgr 28989 df-upgr 29013 df-umgr 29014 df-uspgr 29081 df-usgr 29082 df-wlks 29531 df-trls 29624 df-pths 29648 df-crcts 29718 df-cycls 29719 |
This theorem is referenced by: acycgr2v 34989 cusgracyclt3v 34995 |
Copyright terms: Public domain | W3C validator |