Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > wspthsn | Structured version Visualization version GIF version |
Description: The set of simple paths of a fixed length as word. (Contributed by Alexander van der Vekens, 1-Mar-2018.) (Revised by AV, 11-May-2021.) |
Ref | Expression |
---|---|
wspthsn | ⊢ (𝑁 WSPathsN 𝐺) = {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ ∃𝑓 𝑓(SPaths‘𝐺)𝑤} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | oveq12 7222 | . . . 4 ⊢ ((𝑛 = 𝑁 ∧ 𝑔 = 𝐺) → (𝑛 WWalksN 𝑔) = (𝑁 WWalksN 𝐺)) | |
2 | fveq2 6717 | . . . . . . 7 ⊢ (𝑔 = 𝐺 → (SPaths‘𝑔) = (SPaths‘𝐺)) | |
3 | 2 | breqd 5064 | . . . . . 6 ⊢ (𝑔 = 𝐺 → (𝑓(SPaths‘𝑔)𝑤 ↔ 𝑓(SPaths‘𝐺)𝑤)) |
4 | 3 | exbidv 1929 | . . . . 5 ⊢ (𝑔 = 𝐺 → (∃𝑓 𝑓(SPaths‘𝑔)𝑤 ↔ ∃𝑓 𝑓(SPaths‘𝐺)𝑤)) |
5 | 4 | adantl 485 | . . . 4 ⊢ ((𝑛 = 𝑁 ∧ 𝑔 = 𝐺) → (∃𝑓 𝑓(SPaths‘𝑔)𝑤 ↔ ∃𝑓 𝑓(SPaths‘𝐺)𝑤)) |
6 | 1, 5 | rabeqbidv 3396 | . . 3 ⊢ ((𝑛 = 𝑁 ∧ 𝑔 = 𝐺) → {𝑤 ∈ (𝑛 WWalksN 𝑔) ∣ ∃𝑓 𝑓(SPaths‘𝑔)𝑤} = {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ ∃𝑓 𝑓(SPaths‘𝐺)𝑤}) |
7 | df-wspthsn 27917 | . . 3 ⊢ WSPathsN = (𝑛 ∈ ℕ0, 𝑔 ∈ V ↦ {𝑤 ∈ (𝑛 WWalksN 𝑔) ∣ ∃𝑓 𝑓(SPaths‘𝑔)𝑤}) | |
8 | ovex 7246 | . . . 4 ⊢ (𝑁 WWalksN 𝐺) ∈ V | |
9 | 8 | rabex 5225 | . . 3 ⊢ {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ ∃𝑓 𝑓(SPaths‘𝐺)𝑤} ∈ V |
10 | 6, 7, 9 | ovmpoa 7364 | . 2 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V) → (𝑁 WSPathsN 𝐺) = {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ ∃𝑓 𝑓(SPaths‘𝐺)𝑤}) |
11 | 7 | mpondm0 7446 | . . 3 ⊢ (¬ (𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V) → (𝑁 WSPathsN 𝐺) = ∅) |
12 | df-wwlksn 27915 | . . . . . 6 ⊢ WWalksN = (𝑛 ∈ ℕ0, 𝑔 ∈ V ↦ {𝑤 ∈ (WWalks‘𝑔) ∣ (♯‘𝑤) = (𝑛 + 1)}) | |
13 | 12 | mpondm0 7446 | . . . . 5 ⊢ (¬ (𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V) → (𝑁 WWalksN 𝐺) = ∅) |
14 | 13 | rabeqdv 3395 | . . . 4 ⊢ (¬ (𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V) → {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ ∃𝑓 𝑓(SPaths‘𝐺)𝑤} = {𝑤 ∈ ∅ ∣ ∃𝑓 𝑓(SPaths‘𝐺)𝑤}) |
15 | rab0 4297 | . . . 4 ⊢ {𝑤 ∈ ∅ ∣ ∃𝑓 𝑓(SPaths‘𝐺)𝑤} = ∅ | |
16 | 14, 15 | eqtrdi 2794 | . . 3 ⊢ (¬ (𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V) → {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ ∃𝑓 𝑓(SPaths‘𝐺)𝑤} = ∅) |
17 | 11, 16 | eqtr4d 2780 | . 2 ⊢ (¬ (𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V) → (𝑁 WSPathsN 𝐺) = {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ ∃𝑓 𝑓(SPaths‘𝐺)𝑤}) |
18 | 10, 17 | pm2.61i 185 | 1 ⊢ (𝑁 WSPathsN 𝐺) = {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ ∃𝑓 𝑓(SPaths‘𝐺)𝑤} |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ↔ wb 209 ∧ wa 399 = wceq 1543 ∃wex 1787 ∈ wcel 2110 {crab 3065 Vcvv 3408 ∅c0 4237 class class class wbr 5053 ‘cfv 6380 (class class class)co 7213 1c1 10730 + caddc 10732 ℕ0cn0 12090 ♯chash 13896 SPathscspths 27800 WWalkscwwlks 27909 WWalksN cwwlksn 27910 WSPathsN cwwspthsn 27912 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2708 ax-sep 5192 ax-nul 5199 ax-pr 5322 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2886 df-ne 2941 df-ral 3066 df-rex 3067 df-rab 3070 df-v 3410 df-sbc 3695 df-dif 3869 df-un 3871 df-in 3873 df-ss 3883 df-nul 4238 df-if 4440 df-sn 4542 df-pr 4544 df-op 4548 df-uni 4820 df-br 5054 df-opab 5116 df-id 5455 df-xp 5557 df-rel 5558 df-cnv 5559 df-co 5560 df-dm 5561 df-iota 6338 df-fun 6382 df-fv 6388 df-ov 7216 df-oprab 7217 df-mpo 7218 df-wwlksn 27915 df-wspthsn 27917 |
This theorem is referenced by: iswspthn 27933 wspn0 28008 |
Copyright terms: Public domain | W3C validator |