![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > 0vconngr | Structured version Visualization version GIF version |
Description: A graph without vertices is connected. (Contributed by Alexander van der Vekens, 2-Dec-2017.) (Revised by AV, 15-Feb-2021.) |
Ref | Expression |
---|---|
0vconngr | ⊢ ((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅) → 𝐺 ∈ ConnGraph) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rzal 4411 | . . 3 ⊢ ((Vtx‘𝐺) = ∅ → ∀𝑘 ∈ (Vtx‘𝐺)∀𝑛 ∈ (Vtx‘𝐺)∃𝑓∃𝑝 𝑓(𝑘(PathsOn‘𝐺)𝑛)𝑝) | |
2 | 1 | adantl 485 | . 2 ⊢ ((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅) → ∀𝑘 ∈ (Vtx‘𝐺)∀𝑛 ∈ (Vtx‘𝐺)∃𝑓∃𝑝 𝑓(𝑘(PathsOn‘𝐺)𝑛)𝑝) |
3 | eqid 2798 | . . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
4 | 3 | isconngr 27974 | . . 3 ⊢ (𝐺 ∈ 𝑊 → (𝐺 ∈ ConnGraph ↔ ∀𝑘 ∈ (Vtx‘𝐺)∀𝑛 ∈ (Vtx‘𝐺)∃𝑓∃𝑝 𝑓(𝑘(PathsOn‘𝐺)𝑛)𝑝)) |
5 | 4 | adantr 484 | . 2 ⊢ ((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅) → (𝐺 ∈ ConnGraph ↔ ∀𝑘 ∈ (Vtx‘𝐺)∀𝑛 ∈ (Vtx‘𝐺)∃𝑓∃𝑝 𝑓(𝑘(PathsOn‘𝐺)𝑛)𝑝)) |
6 | 2, 5 | mpbird 260 | 1 ⊢ ((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅) → 𝐺 ∈ ConnGraph) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1538 ∃wex 1781 ∈ wcel 2111 ∀wral 3106 ∅c0 4243 class class class wbr 5030 ‘cfv 6324 (class class class)co 7135 Vtxcvtx 26789 PathsOncpthson 27503 ConnGraphcconngr 27971 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-nul 5174 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-v 3443 df-sbc 3721 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-iota 6283 df-fv 6332 df-ov 7138 df-conngr 27972 |
This theorem is referenced by: 1conngr 27979 |
Copyright terms: Public domain | W3C validator |