| 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 12342 | . . . 4 ⊢ 2 ∈ ℝ | |
| 2 | 1 | rexri 11294 | . . 3 ⊢ 2 ∈ ℝ* |
| 3 | 2 | a1i 11 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝐹(Cycles‘𝐺)𝑃 ∧ 𝐹 ≠ ∅) → 2 ∈ ℝ*) |
| 4 | cycliswlk 30251 | . . . 4 ⊢ (𝐹(Cycles‘𝐺)𝑃 → 𝐹(Walks‘𝐺)𝑃) | |
| 5 | wlkcl 30061 | . . . 4 ⊢ (𝐹(Walks‘𝐺)𝑃 → (♯‘𝐹) ∈ ℕ0) | |
| 6 | nn0xnn0 12608 | . . . 4 ⊢ ((♯‘𝐹) ∈ ℕ0 → (♯‘𝐹) ∈ ℕ0*) | |
| 7 | xnn0xr 12609 | . . . 4 ⊢ ((♯‘𝐹) ∈ ℕ0* → (♯‘𝐹) ∈ ℝ*) | |
| 8 | 4, 5, 6, 7 | 4syl 20 | . . 3 ⊢ (𝐹(Cycles‘𝐺)𝑃 → (♯‘𝐹) ∈ ℝ*) |
| 9 | 8 | 3ad2ant2 1152 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝐹(Cycles‘𝐺)𝑃 ∧ 𝐹 ≠ ∅) → (♯‘𝐹) ∈ ℝ*) |
| 10 | usgrcyclgt2v.1 | . . . . 5 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 11 | 10 | fvexi 6896 | . . . 4 ⊢ 𝑉 ∈ V |
| 12 | hashxnn0 14405 | . . . 4 ⊢ (𝑉 ∈ V → (♯‘𝑉) ∈ ℕ0*) | |
| 13 | xnn0xr 12609 | . . . 4 ⊢ ((♯‘𝑉) ∈ ℕ0* → (♯‘𝑉) ∈ ℝ*) | |
| 14 | 11, 12, 13 | mp2b 10 | . . 3 ⊢ (♯‘𝑉) ∈ ℝ* |
| 15 | 14 | a1i 11 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝐹(Cycles‘𝐺)𝑃 ∧ 𝐹 ≠ ∅) → (♯‘𝑉) ∈ ℝ*) |
| 16 | usgrgt2cycl 35710 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝐹(Cycles‘𝐺)𝑃 ∧ 𝐹 ≠ ∅) → 2 < (♯‘𝐹)) | |
| 17 | cyclispth 30249 | . . . 4 ⊢ (𝐹(Cycles‘𝐺)𝑃 → 𝐹(Paths‘𝐺)𝑃) | |
| 18 | 10 | pthhashvtx 30180 | . . . 4 ⊢ (𝐹(Paths‘𝐺)𝑃 → (♯‘𝐹) ≤ (♯‘𝑉)) |
| 19 | 17, 18 | syl 18 | . . 3 ⊢ (𝐹(Cycles‘𝐺)𝑃 → (♯‘𝐹) ≤ (♯‘𝑉)) |
| 20 | 19 | 3ad2ant2 1152 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝐹(Cycles‘𝐺)𝑃 ∧ 𝐹 ≠ ∅) → (♯‘𝐹) ≤ (♯‘𝑉)) |
| 21 | 3, 9, 15, 16, 20 | xrltletrd 13214 | 1 ⊢ ((𝐺 ∈ USGraph ∧ 𝐹(Cycles‘𝐺)𝑃 ∧ 𝐹 ≠ ∅) → 2 < (♯‘𝑉)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ≠ wne 2957 Vcvv 3453 ∅c0 4282 class class class wbr 5107 ‘cfv 6537 ℝ*cxr 11269 < clt 11270 ≤ cle 11271 2c2 12322 ℕ0cn0 12531 ℕ0*cxnn0 12604 ♯chash 14396 Vtxcvtx 29439 USGraphcusgr 29595 Walkscwlks 30042 Pathscpths 30160 Cyclesccycls 30237 |
| 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-ifp 1079 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-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-map 8831 df-pm 8832 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-fzo 13712 df-hash 14397 df-word 14581 df-edg 29491 df-uhgr 29501 df-upgr 29525 df-umgr 29526 df-uspgr 29596 df-usgr 29597 df-wlks 30045 df-trls 30140 df-pths 30164 df-crcts 30238 df-cycls 30239 |
| This theorem is used by: acycgr2v 35716 cusgracyclt3v 35722 |
| Copyright terms: Public domain | W3C validator |