Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 0spth | Structured version Visualization version GIF version |
Description: A pair of an empty set (of edges) and a second set (of vertices) is a simple path iff the second set contains exactly one vertex. (Contributed by Alexander van der Vekens, 30-Oct-2017.) (Revised by AV, 18-Jan-2021.) (Revised by AV, 30-Oct-2021.) |
Ref | Expression |
---|---|
0pth.v | ⊢ 𝑉 = (Vtx‘𝐺) |
Ref | Expression |
---|---|
0spth | ⊢ (𝐺 ∈ 𝑊 → (∅(SPaths‘𝐺)𝑃 ↔ 𝑃:(0...0)⟶𝑉)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0pth.v | . . . 4 ⊢ 𝑉 = (Vtx‘𝐺) | |
2 | 1 | 0trl 27885 | . . 3 ⊢ (𝐺 ∈ 𝑊 → (∅(Trails‘𝐺)𝑃 ↔ 𝑃:(0...0)⟶𝑉)) |
3 | 2 | anbi1d 631 | . 2 ⊢ (𝐺 ∈ 𝑊 → ((∅(Trails‘𝐺)𝑃 ∧ Fun ◡𝑃) ↔ (𝑃:(0...0)⟶𝑉 ∧ Fun ◡𝑃))) |
4 | isspth 27491 | . 2 ⊢ (∅(SPaths‘𝐺)𝑃 ↔ (∅(Trails‘𝐺)𝑃 ∧ Fun ◡𝑃)) | |
5 | fz0sn 12997 | . . . . 5 ⊢ (0...0) = {0} | |
6 | 5 | feq2i 6492 | . . . 4 ⊢ (𝑃:(0...0)⟶𝑉 ↔ 𝑃:{0}⟶𝑉) |
7 | c0ex 10621 | . . . . . 6 ⊢ 0 ∈ V | |
8 | 7 | fsn2 6884 | . . . . 5 ⊢ (𝑃:{0}⟶𝑉 ↔ ((𝑃‘0) ∈ 𝑉 ∧ 𝑃 = {〈0, (𝑃‘0)〉})) |
9 | funcnvsn 6390 | . . . . . 6 ⊢ Fun ◡{〈0, (𝑃‘0)〉} | |
10 | cnveq 5730 | . . . . . . 7 ⊢ (𝑃 = {〈0, (𝑃‘0)〉} → ◡𝑃 = ◡{〈0, (𝑃‘0)〉}) | |
11 | 10 | funeqd 6363 | . . . . . 6 ⊢ (𝑃 = {〈0, (𝑃‘0)〉} → (Fun ◡𝑃 ↔ Fun ◡{〈0, (𝑃‘0)〉})) |
12 | 9, 11 | mpbiri 260 | . . . . 5 ⊢ (𝑃 = {〈0, (𝑃‘0)〉} → Fun ◡𝑃) |
13 | 8, 12 | simplbiim 507 | . . . 4 ⊢ (𝑃:{0}⟶𝑉 → Fun ◡𝑃) |
14 | 6, 13 | sylbi 219 | . . 3 ⊢ (𝑃:(0...0)⟶𝑉 → Fun ◡𝑃) |
15 | 14 | pm4.71i 562 | . 2 ⊢ (𝑃:(0...0)⟶𝑉 ↔ (𝑃:(0...0)⟶𝑉 ∧ Fun ◡𝑃)) |
16 | 3, 4, 15 | 3bitr4g 316 | 1 ⊢ (𝐺 ∈ 𝑊 → (∅(SPaths‘𝐺)𝑃 ↔ 𝑃:(0...0)⟶𝑉)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ∅c0 4279 {csn 4553 〈cop 4559 class class class wbr 5052 ◡ccnv 5540 Fun wfun 6335 ⟶wf 6337 ‘cfv 6341 (class class class)co 7142 0cc0 10523 ...cfz 12882 Vtxcvtx 26767 Trailsctrls 27458 SPathscspths 27480 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5176 ax-sep 5189 ax-nul 5196 ax-pow 5252 ax-pr 5316 ax-un 7447 ax-cnex 10579 ax-resscn 10580 ax-1cn 10581 ax-icn 10582 ax-addcl 10583 ax-addrcl 10584 ax-mulcl 10585 ax-mulrcl 10586 ax-mulcom 10587 ax-addass 10588 ax-mulass 10589 ax-distr 10590 ax-i2m1 10591 ax-1ne0 10592 ax-1rid 10593 ax-rnegex 10594 ax-rrecex 10595 ax-cnre 10596 ax-pre-lttri 10597 ax-pre-lttrn 10598 ax-pre-ltadd 10599 ax-pre-mulgt0 10600 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-ifp 1058 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3488 df-sbc 3764 df-csb 3872 df-dif 3927 df-un 3929 df-in 3931 df-ss 3940 df-pss 3942 df-nul 4280 df-if 4454 df-pw 4527 df-sn 4554 df-pr 4556 df-tp 4558 df-op 4560 df-uni 4825 df-int 4863 df-iun 4907 df-br 5053 df-opab 5115 df-mpt 5133 df-tr 5159 df-id 5446 df-eprel 5451 df-po 5460 df-so 5461 df-fr 5500 df-we 5502 df-xp 5547 df-rel 5548 df-cnv 5549 df-co 5550 df-dm 5551 df-rn 5552 df-res 5553 df-ima 5554 df-pred 6134 df-ord 6180 df-on 6181 df-lim 6182 df-suc 6183 df-iota 6300 df-fun 6343 df-fn 6344 df-f 6345 df-f1 6346 df-fo 6347 df-f1o 6348 df-fv 6349 df-riota 7100 df-ov 7145 df-oprab 7146 df-mpo 7147 df-om 7567 df-1st 7675 df-2nd 7676 df-wrecs 7933 df-recs 7994 df-rdg 8032 df-1o 8088 df-er 8275 df-map 8394 df-pm 8395 df-en 8496 df-dom 8497 df-sdom 8498 df-fin 8499 df-card 9354 df-pnf 10663 df-mnf 10664 df-xr 10665 df-ltxr 10666 df-le 10667 df-sub 10858 df-neg 10859 df-nn 11625 df-n0 11885 df-z 11969 df-uz 12231 df-fz 12883 df-fzo 13024 df-hash 13681 df-word 13852 df-wlks 27367 df-trls 27460 df-spths 27484 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |