| 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 12278 | . . . 4 ⊢ 2 ∈ ℝ | |
| 2 | 1 | rexri 11226 | . . 3 ⊢ 2 ∈ ℝ* |
| 3 | 2 | a1i 11 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝐹(Cycles‘𝐺)𝑃 ∧ 𝐹 ≠ ∅) → 2 ∈ ℝ*) |
| 4 | cycliswlk 29933 | . . . 4 ⊢ (𝐹(Cycles‘𝐺)𝑃 → 𝐹(Walks‘𝐺)𝑃) | |
| 5 | wlkcl 29751 | . . . 4 ⊢ (𝐹(Walks‘𝐺)𝑃 → (♯‘𝐹) ∈ ℕ0) | |
| 6 | nn0xnn0 12544 | . . . 4 ⊢ ((♯‘𝐹) ∈ ℕ0 → (♯‘𝐹) ∈ ℕ0*) | |
| 7 | xnn0xr 12545 | . . . 4 ⊢ ((♯‘𝐹) ∈ ℕ0* → (♯‘𝐹) ∈ ℝ*) | |
| 8 | 4, 5, 6, 7 | 4syl 19 | . . 3 ⊢ (𝐹(Cycles‘𝐺)𝑃 → (♯‘𝐹) ∈ ℝ*) |
| 9 | 8 | 3ad2ant2 1143 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝐹(Cycles‘𝐺)𝑃 ∧ 𝐹 ≠ ∅) → (♯‘𝐹) ∈ ℝ*) |
| 10 | usgrcyclgt2v.1 | . . . . 5 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 11 | 10 | fvexi 6866 | . . . 4 ⊢ 𝑉 ∈ V |
| 12 | hashxnn0 14338 | . . . 4 ⊢ (𝑉 ∈ V → (♯‘𝑉) ∈ ℕ0*) | |
| 13 | xnn0xr 12545 | . . . 4 ⊢ ((♯‘𝑉) ∈ ℕ0* → (♯‘𝑉) ∈ ℝ*) | |
| 14 | 11, 12, 13 | mp2b 10 | . . 3 ⊢ (♯‘𝑉) ∈ ℝ* |
| 15 | 14 | a1i 11 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝐹(Cycles‘𝐺)𝑃 ∧ 𝐹 ≠ ∅) → (♯‘𝑉) ∈ ℝ*) |
| 16 | usgrgt2cycl 35418 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝐹(Cycles‘𝐺)𝑃 ∧ 𝐹 ≠ ∅) → 2 < (♯‘𝐹)) | |
| 17 | cyclispth 29932 | . . . 4 ⊢ (𝐹(Cycles‘𝐺)𝑃 → 𝐹(Paths‘𝐺)𝑃) | |
| 18 | 10 | pthhashvtx 35416 | . . . 4 ⊢ (𝐹(Paths‘𝐺)𝑃 → (♯‘𝐹) ≤ (♯‘𝑉)) |
| 19 | 17, 18 | syl 17 | . . 3 ⊢ (𝐹(Cycles‘𝐺)𝑃 → (♯‘𝐹) ≤ (♯‘𝑉)) |
| 20 | 19 | 3ad2ant2 1143 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝐹(Cycles‘𝐺)𝑃 ∧ 𝐹 ≠ ∅) → (♯‘𝐹) ≤ (♯‘𝑉)) |
| 21 | 3, 9, 15, 16, 20 | xrltletrd 13149 | 1 ⊢ ((𝐺 ∈ USGraph ∧ 𝐹(Cycles‘𝐺)𝑃 ∧ 𝐹 ≠ ∅) → 2 < (♯‘𝑉)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1095 = wceq 1550 ∈ wcel 2132 ≠ wne 2947 Vcvv 3444 ∅c0 4276 class class class wbr 5090 ‘cfv 6506 ℝ*cxr 11201 < clt 11202 ≤ cle 11203 2c2 12258 ℕ0cn0 12467 ℕ0*cxnn0 12540 ♯chash 14329 Vtxcvtx 29132 USGraphcusgr 29285 Walkscwlks 29732 Pathscpths 29845 Cyclesccycls 29920 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-10 2165 ax-11 2181 ax-12 2202 ax-ext 2724 ax-rep 5217 ax-sep 5236 ax-nul 5246 ax-pow 5312 ax-pr 5380 ax-un 7703 ax-cnex 11115 ax-resscn 11116 ax-1cn 11117 ax-icn 11118 ax-addcl 11119 ax-addrcl 11120 ax-mulcl 11121 ax-mulrcl 11122 ax-mulcom 11123 ax-addass 11124 ax-mulass 11125 ax-distr 11126 ax-i2m1 11127 ax-1ne0 11128 ax-1rid 11129 ax-rnegex 11130 ax-rrecex 11131 ax-cnre 11132 ax-pre-lttri 11133 ax-pre-lttrn 11134 ax-pre-ltadd 11135 ax-pre-mulgt0 11136 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-ifp 1072 df-3or 1096 df-3an 1097 df-tru 1553 df-fal 1563 df-ex 1790 df-nf 1794 df-sb 2081 df-mo 2556 df-eu 2586 df-clab 2731 df-cleq 2744 df-clel 2827 df-nfc 2901 df-ne 2948 df-nel 3052 df-ral 3067 df-rex 3077 df-reu 3358 df-rab 3405 df-v 3446 df-sbc 3736 df-csb 3844 df-dif 3898 df-un 3900 df-in 3902 df-ss 3912 df-pss 3915 df-nul 4277 df-if 4471 df-pw 4547 df-sn 4573 df-pr 4575 df-op 4579 df-uni 4856 df-int 4896 df-iun 4941 df-br 5091 df-opab 5153 df-mpt 5172 df-tr 5198 df-id 5531 df-eprel 5536 df-po 5544 df-so 5545 df-fr 5589 df-we 5591 df-xp 5642 df-rel 5643 df-cnv 5644 df-co 5645 df-dm 5646 df-rn 5647 df-res 5648 df-ima 5649 df-pred 6273 df-ord 6334 df-on 6335 df-lim 6336 df-suc 6337 df-iota 6462 df-fun 6508 df-fn 6509 df-f 6510 df-f1 6511 df-fo 6512 df-f1o 6513 df-fv 6514 df-riota 7338 df-ov 7384 df-oprab 7385 df-mpo 7386 df-om 7832 df-1st 7955 df-2nd 7956 df-frecs 8246 df-wrecs 8277 df-recs 8326 df-rdg 8365 df-1o 8421 df-2o 8422 df-oadd 8425 df-er 8662 df-map 8794 df-pm 8795 df-en 8913 df-dom 8914 df-sdom 8915 df-fin 8916 df-dju 9845 df-card 9883 df-pnf 11204 df-mnf 11205 df-xr 11206 df-ltxr 11207 df-le 11208 df-sub 11402 df-neg 11403 df-nn 12197 df-2 12266 df-n0 12468 df-xnn0 12541 df-z 12555 df-uz 12826 df-fz 13499 df-fzo 13646 df-hash 14330 df-word 14513 df-edg 29184 df-uhgr 29194 df-upgr 29218 df-umgr 29219 df-uspgr 29286 df-usgr 29287 df-wlks 29735 df-trls 29826 df-pths 29849 df-crcts 29921 df-cycls 29922 |
| This theorem is referenced by: acycgr2v 35438 cusgracyclt3v 35444 |
| Copyright terms: Public domain | W3C validator |