Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > wspthnp | Structured version Visualization version GIF version |
Description: Properties of a set being a simple path of a fixed length as word. (Contributed by AV, 18-May-2021.) |
Ref | Expression |
---|---|
wspthnp | ⊢ (𝑊 ∈ (𝑁 WSPathsN 𝐺) → ((𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V) ∧ 𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ ∃𝑓 𝑓(SPaths‘𝐺)𝑊)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-wspthsn 27538 | . . 3 ⊢ WSPathsN = (𝑛 ∈ ℕ0, 𝑔 ∈ V ↦ {𝑤 ∈ (𝑛 WWalksN 𝑔) ∣ ∃𝑓 𝑓(SPaths‘𝑔)𝑤}) | |
2 | 1 | elmpocl 7376 | . 2 ⊢ (𝑊 ∈ (𝑁 WSPathsN 𝐺) → (𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V)) |
3 | simpl 483 | . . 3 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V) ∧ 𝑊 ∈ (𝑁 WSPathsN 𝐺)) → (𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V)) | |
4 | iswspthn 27554 | . . . . 5 ⊢ (𝑊 ∈ (𝑁 WSPathsN 𝐺) ↔ (𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ ∃𝑓 𝑓(SPaths‘𝐺)𝑊)) | |
5 | 4 | a1i 11 | . . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V) → (𝑊 ∈ (𝑁 WSPathsN 𝐺) ↔ (𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ ∃𝑓 𝑓(SPaths‘𝐺)𝑊))) |
6 | 5 | biimpa 477 | . . 3 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V) ∧ 𝑊 ∈ (𝑁 WSPathsN 𝐺)) → (𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ ∃𝑓 𝑓(SPaths‘𝐺)𝑊)) |
7 | 3anass 1087 | . . 3 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V) ∧ 𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ ∃𝑓 𝑓(SPaths‘𝐺)𝑊) ↔ ((𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V) ∧ (𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ ∃𝑓 𝑓(SPaths‘𝐺)𝑊))) | |
8 | 3, 6, 7 | sylanbrc 583 | . 2 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V) ∧ 𝑊 ∈ (𝑁 WSPathsN 𝐺)) → ((𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V) ∧ 𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ ∃𝑓 𝑓(SPaths‘𝐺)𝑊)) |
9 | 2, 8 | mpancom 684 | 1 ⊢ (𝑊 ∈ (𝑁 WSPathsN 𝐺) → ((𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V) ∧ 𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ ∃𝑓 𝑓(SPaths‘𝐺)𝑊)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∧ w3a 1079 ∃wex 1771 ∈ wcel 2105 {crab 3139 Vcvv 3492 class class class wbr 5057 ‘cfv 6348 (class class class)co 7145 ℕ0cn0 11885 SPathscspths 27421 WWalksN cwwlksn 27531 WSPathsN cwwspthsn 27533 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ral 3140 df-rex 3141 df-rab 3144 df-v 3494 df-sbc 3770 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-nul 4289 df-if 4464 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4831 df-br 5058 df-opab 5120 df-id 5453 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-iota 6307 df-fun 6350 df-fv 6356 df-ov 7148 df-oprab 7149 df-mpo 7150 df-wwlksn 27536 df-wspthsn 27538 |
This theorem is referenced by: wspthsswwlkn 27624 |
Copyright terms: Public domain | W3C validator |