![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > 0pth | Structured version Visualization version GIF version |
Description: A pair of an empty set (of edges) and a second set (of vertices) is a path iff the second set contains exactly one vertex. (Contributed by Alexander van der Vekens, 30-Oct-2017.) (Revised by AV, 19-Jan-2021.) (Revised by AV, 30-Oct-2021.) |
Ref | Expression |
---|---|
0pth.v | ⊢ 𝑉 = (Vtx‘𝐺) |
Ref | Expression |
---|---|
0pth | ⊢ (𝐺 ∈ 𝑊 → (∅(Paths‘𝐺)𝑃 ↔ 𝑃:(0...0)⟶𝑉)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ispth 29756 | . . 3 ⊢ (∅(Paths‘𝐺)𝑃 ↔ (∅(Trails‘𝐺)𝑃 ∧ Fun ◡(𝑃 ↾ (1..^(♯‘∅))) ∧ ((𝑃 “ {0, (♯‘∅)}) ∩ (𝑃 “ (1..^(♯‘∅)))) = ∅)) | |
2 | 1 | a1i 11 | . 2 ⊢ (𝐺 ∈ 𝑊 → (∅(Paths‘𝐺)𝑃 ↔ (∅(Trails‘𝐺)𝑃 ∧ Fun ◡(𝑃 ↾ (1..^(♯‘∅))) ∧ ((𝑃 “ {0, (♯‘∅)}) ∩ (𝑃 “ (1..^(♯‘∅)))) = ∅))) |
3 | 3anass 1094 | . . . 4 ⊢ ((∅(Trails‘𝐺)𝑃 ∧ Fun ◡(𝑃 ↾ (1..^(♯‘∅))) ∧ ((𝑃 “ {0, (♯‘∅)}) ∩ (𝑃 “ (1..^(♯‘∅)))) = ∅) ↔ (∅(Trails‘𝐺)𝑃 ∧ (Fun ◡(𝑃 ↾ (1..^(♯‘∅))) ∧ ((𝑃 “ {0, (♯‘∅)}) ∩ (𝑃 “ (1..^(♯‘∅)))) = ∅))) | |
4 | 3 | a1i 11 | . . 3 ⊢ (𝐺 ∈ 𝑊 → ((∅(Trails‘𝐺)𝑃 ∧ Fun ◡(𝑃 ↾ (1..^(♯‘∅))) ∧ ((𝑃 “ {0, (♯‘∅)}) ∩ (𝑃 “ (1..^(♯‘∅)))) = ∅) ↔ (∅(Trails‘𝐺)𝑃 ∧ (Fun ◡(𝑃 ↾ (1..^(♯‘∅))) ∧ ((𝑃 “ {0, (♯‘∅)}) ∩ (𝑃 “ (1..^(♯‘∅)))) = ∅)))) |
5 | funcnv0 6634 | . . . . . 6 ⊢ Fun ◡∅ | |
6 | hash0 14403 | . . . . . . . . . . . 12 ⊢ (♯‘∅) = 0 | |
7 | 0le1 11784 | . . . . . . . . . . . 12 ⊢ 0 ≤ 1 | |
8 | 6, 7 | eqbrtri 5169 | . . . . . . . . . . 11 ⊢ (♯‘∅) ≤ 1 |
9 | 1z 12645 | . . . . . . . . . . . 12 ⊢ 1 ∈ ℤ | |
10 | 0z 12622 | . . . . . . . . . . . . 13 ⊢ 0 ∈ ℤ | |
11 | 6, 10 | eqeltri 2835 | . . . . . . . . . . . 12 ⊢ (♯‘∅) ∈ ℤ |
12 | fzon 13717 | . . . . . . . . . . . 12 ⊢ ((1 ∈ ℤ ∧ (♯‘∅) ∈ ℤ) → ((♯‘∅) ≤ 1 ↔ (1..^(♯‘∅)) = ∅)) | |
13 | 9, 11, 12 | mp2an 692 | . . . . . . . . . . 11 ⊢ ((♯‘∅) ≤ 1 ↔ (1..^(♯‘∅)) = ∅) |
14 | 8, 13 | mpbi 230 | . . . . . . . . . 10 ⊢ (1..^(♯‘∅)) = ∅ |
15 | 14 | reseq2i 5997 | . . . . . . . . 9 ⊢ (𝑃 ↾ (1..^(♯‘∅))) = (𝑃 ↾ ∅) |
16 | res0 6004 | . . . . . . . . 9 ⊢ (𝑃 ↾ ∅) = ∅ | |
17 | 15, 16 | eqtri 2763 | . . . . . . . 8 ⊢ (𝑃 ↾ (1..^(♯‘∅))) = ∅ |
18 | 17 | cnveqi 5888 | . . . . . . 7 ⊢ ◡(𝑃 ↾ (1..^(♯‘∅))) = ◡∅ |
19 | 18 | funeqi 6589 | . . . . . 6 ⊢ (Fun ◡(𝑃 ↾ (1..^(♯‘∅))) ↔ Fun ◡∅) |
20 | 5, 19 | mpbir 231 | . . . . 5 ⊢ Fun ◡(𝑃 ↾ (1..^(♯‘∅))) |
21 | 14 | imaeq2i 6078 | . . . . . . . 8 ⊢ (𝑃 “ (1..^(♯‘∅))) = (𝑃 “ ∅) |
22 | ima0 6097 | . . . . . . . 8 ⊢ (𝑃 “ ∅) = ∅ | |
23 | 21, 22 | eqtri 2763 | . . . . . . 7 ⊢ (𝑃 “ (1..^(♯‘∅))) = ∅ |
24 | 23 | ineq2i 4225 | . . . . . 6 ⊢ ((𝑃 “ {0, (♯‘∅)}) ∩ (𝑃 “ (1..^(♯‘∅)))) = ((𝑃 “ {0, (♯‘∅)}) ∩ ∅) |
25 | in0 4401 | . . . . . 6 ⊢ ((𝑃 “ {0, (♯‘∅)}) ∩ ∅) = ∅ | |
26 | 24, 25 | eqtri 2763 | . . . . 5 ⊢ ((𝑃 “ {0, (♯‘∅)}) ∩ (𝑃 “ (1..^(♯‘∅)))) = ∅ |
27 | 20, 26 | pm3.2i 470 | . . . 4 ⊢ (Fun ◡(𝑃 ↾ (1..^(♯‘∅))) ∧ ((𝑃 “ {0, (♯‘∅)}) ∩ (𝑃 “ (1..^(♯‘∅)))) = ∅) |
28 | 27 | biantru 529 | . . 3 ⊢ (∅(Trails‘𝐺)𝑃 ↔ (∅(Trails‘𝐺)𝑃 ∧ (Fun ◡(𝑃 ↾ (1..^(♯‘∅))) ∧ ((𝑃 “ {0, (♯‘∅)}) ∩ (𝑃 “ (1..^(♯‘∅)))) = ∅))) |
29 | 4, 28 | bitr4di 289 | . 2 ⊢ (𝐺 ∈ 𝑊 → ((∅(Trails‘𝐺)𝑃 ∧ Fun ◡(𝑃 ↾ (1..^(♯‘∅))) ∧ ((𝑃 “ {0, (♯‘∅)}) ∩ (𝑃 “ (1..^(♯‘∅)))) = ∅) ↔ ∅(Trails‘𝐺)𝑃)) |
30 | 0pth.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
31 | 30 | 0trl 30151 | . 2 ⊢ (𝐺 ∈ 𝑊 → (∅(Trails‘𝐺)𝑃 ↔ 𝑃:(0...0)⟶𝑉)) |
32 | 2, 29, 31 | 3bitrd 305 | 1 ⊢ (𝐺 ∈ 𝑊 → (∅(Paths‘𝐺)𝑃 ↔ 𝑃:(0...0)⟶𝑉)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1537 ∈ wcel 2106 ∩ cin 3962 ∅c0 4339 {cpr 4633 class class class wbr 5148 ◡ccnv 5688 ↾ cres 5691 “ cima 5692 Fun wfun 6557 ⟶wf 6559 ‘cfv 6563 (class class class)co 7431 0cc0 11153 1c1 11154 ≤ cle 11294 ℤcz 12611 ...cfz 13544 ..^cfzo 13691 ♯chash 14366 Vtxcvtx 29028 Trailsctrls 29723 Pathscpths 29745 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-ifp 1063 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-int 4952 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8013 df-2nd 8014 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-1o 8505 df-er 8744 df-map 8867 df-pm 8868 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 df-card 9977 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-nn 12265 df-n0 12525 df-z 12612 df-uz 12877 df-fz 13545 df-fzo 13692 df-hash 14367 df-word 14550 df-wlks 29632 df-trls 29725 df-pths 29749 |
This theorem is referenced by: 0pthon 30156 0cycl 30163 |
Copyright terms: Public domain | W3C validator |