| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 0pthonv | Structured version Visualization version GIF version | ||
| Description: For each vertex there is a path of length 0 from the vertex to itself. (Contributed by Alexander van der Vekens, 3-Dec-2017.) (Revised by AV, 21-Jan-2021.) |
| Ref | Expression |
|---|---|
| 0pthon.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| Ref | Expression |
|---|---|
| 0pthonv | ⊢ (𝑁 ∈ 𝑉 → ∃𝑓∃𝑝 𝑓(𝑁(PathsOn‘𝐺)𝑁)𝑝) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0ex 5258 | . . 3 ⊢ ∅ ∈ V | |
| 2 | snex 5397 | . . 3 ⊢ {〈0, 𝑁〉} ∈ V | |
| 3 | 1, 2 | pm3.2i 474 | . 2 ⊢ (∅ ∈ V ∧ {〈0, 𝑁〉} ∈ V) |
| 4 | 0pthon.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 5 | 4 | 0pthon1 30331 | . 2 ⊢ (𝑁 ∈ 𝑉 → ∅(𝑁(PathsOn‘𝐺)𝑁){〈0, 𝑁〉}) |
| 6 | breq12 5106 | . . 3 ⊢ ((𝑓 = ∅ ∧ 𝑝 = {〈0, 𝑁〉}) → (𝑓(𝑁(PathsOn‘𝐺)𝑁)𝑝 ↔ ∅(𝑁(PathsOn‘𝐺)𝑁){〈0, 𝑁〉})) | |
| 7 | 6 | spc2egv 3559 | . 2 ⊢ ((∅ ∈ V ∧ {〈0, 𝑁〉} ∈ V) → (∅(𝑁(PathsOn‘𝐺)𝑁){〈0, 𝑁〉} → ∃𝑓∃𝑝 𝑓(𝑁(PathsOn‘𝐺)𝑁)𝑝)) |
| 8 | 3, 5, 7 | mpsyl 68 | 1 ⊢ (𝑁 ∈ 𝑉 → ∃𝑓∃𝑝 𝑓(𝑁(PathsOn‘𝐺)𝑁)𝑝) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1561 ∃wex 1800 ∈ wcel 2143 Vcvv 3455 ∅c0 4286 {csn 4583 〈cop 4589 class class class wbr 5101 ‘cfv 6522 (class class class)co 7397 0cc0 11074 Vtxcvtx 29198 PathsOncpthson 29913 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5228 ax-sep 5247 ax-nul 5257 ax-pow 5323 ax-pr 5391 ax-un 7719 ax-cnex 11130 ax-resscn 11131 ax-1cn 11132 ax-icn 11133 ax-addcl 11134 ax-addrcl 11135 ax-mulcl 11136 ax-mulrcl 11137 ax-mulcom 11138 ax-addass 11139 ax-mulass 11140 ax-distr 11141 ax-i2m1 11142 ax-1ne0 11143 ax-1rid 11144 ax-rnegex 11145 ax-rrecex 11146 ax-cnre 11147 ax-pre-lttri 11148 ax-pre-lttrn 11149 ax-pre-ltadd 11150 ax-pre-mulgt0 11151 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-ifp 1075 df-3or 1100 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-nf 1805 df-sb 2092 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3063 df-ral 3078 df-rex 3088 df-reu 3369 df-rab 3416 df-v 3457 df-sbc 3746 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-int 4907 df-iun 4952 df-br 5102 df-opab 5164 df-mpt 5183 df-tr 5209 df-id 5543 df-eprel 5548 df-po 5556 df-so 5557 df-fr 5601 df-we 5603 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-pred 6289 df-ord 6350 df-on 6351 df-lim 6352 df-suc 6353 df-iota 6478 df-fun 6524 df-fn 6525 df-f 6526 df-f1 6527 df-fo 6528 df-f1o 6529 df-fv 6530 df-riota 7354 df-ov 7400 df-oprab 7401 df-mpo 7402 df-om 7848 df-1st 7971 df-2nd 7972 df-frecs 8263 df-wrecs 8294 df-recs 8343 df-rdg 8382 df-1o 8438 df-er 8679 df-map 8811 df-pm 8812 df-en 8929 df-dom 8930 df-sdom 8931 df-fin 8932 df-card 9898 df-pnf 11219 df-mnf 11220 df-xr 11221 df-ltxr 11222 df-le 11223 df-sub 11417 df-neg 11418 df-nn 12212 df-n0 12483 df-z 12570 df-uz 12841 df-fz 13514 df-fzo 13661 df-hash 14345 df-word 14528 df-wlks 29801 df-wlkson 29802 df-trls 29892 df-trlson 29893 df-pths 29915 df-pthson 29917 |
| This theorem is referenced by: 1pthon2v 30356 dfconngr1 30391 1conngr 30397 |
| Copyright terms: Public domain | W3C validator |