| 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 12223 | . . . 4 ⊢ 2 ∈ ℝ | |
| 2 | 1 | rexri 11194 | . . 3 ⊢ 2 ∈ ℝ* |
| 3 | 2 | a1i 11 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝐹(Cycles‘𝐺)𝑃 ∧ 𝐹 ≠ ∅) → 2 ∈ ℝ*) |
| 4 | cycliswlk 29854 | . . . 4 ⊢ (𝐹(Cycles‘𝐺)𝑃 → 𝐹(Walks‘𝐺)𝑃) | |
| 5 | wlkcl 29672 | . . . 4 ⊢ (𝐹(Walks‘𝐺)𝑃 → (♯‘𝐹) ∈ ℕ0) | |
| 6 | nn0xnn0 12482 | . . . 4 ⊢ ((♯‘𝐹) ∈ ℕ0 → (♯‘𝐹) ∈ ℕ0*) | |
| 7 | xnn0xr 12483 | . . . 4 ⊢ ((♯‘𝐹) ∈ ℕ0* → (♯‘𝐹) ∈ ℝ*) | |
| 8 | 4, 5, 6, 7 | 4syl 19 | . . 3 ⊢ (𝐹(Cycles‘𝐺)𝑃 → (♯‘𝐹) ∈ ℝ*) |
| 9 | 8 | 3ad2ant2 1135 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝐹(Cycles‘𝐺)𝑃 ∧ 𝐹 ≠ ∅) → (♯‘𝐹) ∈ ℝ*) |
| 10 | usgrcyclgt2v.1 | . . . . 5 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 11 | 10 | fvexi 6849 | . . . 4 ⊢ 𝑉 ∈ V |
| 12 | hashxnn0 14266 | . . . 4 ⊢ (𝑉 ∈ V → (♯‘𝑉) ∈ ℕ0*) | |
| 13 | xnn0xr 12483 | . . . 4 ⊢ ((♯‘𝑉) ∈ ℕ0* → (♯‘𝑉) ∈ ℝ*) | |
| 14 | 11, 12, 13 | mp2b 10 | . . 3 ⊢ (♯‘𝑉) ∈ ℝ* |
| 15 | 14 | a1i 11 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝐹(Cycles‘𝐺)𝑃 ∧ 𝐹 ≠ ∅) → (♯‘𝑉) ∈ ℝ*) |
| 16 | usgrgt2cycl 35305 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝐹(Cycles‘𝐺)𝑃 ∧ 𝐹 ≠ ∅) → 2 < (♯‘𝐹)) | |
| 17 | cyclispth 29853 | . . . 4 ⊢ (𝐹(Cycles‘𝐺)𝑃 → 𝐹(Paths‘𝐺)𝑃) | |
| 18 | 10 | pthhashvtx 35303 | . . . 4 ⊢ (𝐹(Paths‘𝐺)𝑃 → (♯‘𝐹) ≤ (♯‘𝑉)) |
| 19 | 17, 18 | syl 17 | . . 3 ⊢ (𝐹(Cycles‘𝐺)𝑃 → (♯‘𝐹) ≤ (♯‘𝑉)) |
| 20 | 19 | 3ad2ant2 1135 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝐹(Cycles‘𝐺)𝑃 ∧ 𝐹 ≠ ∅) → (♯‘𝐹) ≤ (♯‘𝑉)) |
| 21 | 3, 9, 15, 16, 20 | xrltletrd 13079 | 1 ⊢ ((𝐺 ∈ USGraph ∧ 𝐹(Cycles‘𝐺)𝑃 ∧ 𝐹 ≠ ∅) → 2 < (♯‘𝑉)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 Vcvv 3441 ∅c0 4286 class class class wbr 5099 ‘cfv 6493 ℝ*cxr 11169 < clt 11170 ≤ cle 11171 2c2 12204 ℕ0cn0 12405 ℕ0*cxnn0 12478 ♯chash 14257 Vtxcvtx 29052 USGraphcusgr 29205 Walkscwlks 29653 Pathscpths 29766 Cyclesccycls 29841 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5225 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 ax-cnex 11086 ax-resscn 11087 ax-1cn 11088 ax-icn 11089 ax-addcl 11090 ax-addrcl 11091 ax-mulcl 11092 ax-mulrcl 11093 ax-mulcom 11094 ax-addass 11095 ax-mulass 11096 ax-distr 11097 ax-i2m1 11098 ax-1ne0 11099 ax-1rid 11100 ax-rnegex 11101 ax-rrecex 11102 ax-cnre 11103 ax-pre-lttri 11104 ax-pre-lttrn 11105 ax-pre-ltadd 11106 ax-pre-mulgt0 11107 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-ifp 1064 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-int 4904 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-2o 8400 df-oadd 8403 df-er 8637 df-map 8769 df-pm 8770 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-dju 9817 df-card 9855 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12150 df-2 12212 df-n0 12406 df-xnn0 12479 df-z 12493 df-uz 12756 df-fz 13428 df-fzo 13575 df-hash 14258 df-word 14441 df-edg 29104 df-uhgr 29114 df-upgr 29138 df-umgr 29139 df-uspgr 29206 df-usgr 29207 df-wlks 29656 df-trls 29747 df-pths 29770 df-crcts 29842 df-cycls 29843 |
| This theorem is referenced by: acycgr2v 35325 cusgracyclt3v 35331 |
| Copyright terms: Public domain | W3C validator |