| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > clwwlknonmpo | Structured version Visualization version GIF version | ||
| Description: (ClWWalksNOn‘𝐺) is an operator mapping a vertex 𝑣 and a nonnegative integer 𝑛 to the set of closed walks on 𝑣 of length 𝑛 as words over the set of vertices in a graph 𝐺. (Contributed by AV, 25-Feb-2022.) (Proof shortened by AV, 2-Mar-2024.) |
| Ref | Expression |
|---|---|
| clwwlknonmpo | ⊢ (ClWWalksNOn‘𝐺) = (𝑣 ∈ (Vtx‘𝐺), 𝑛 ∈ ℕ0 ↦ {𝑤 ∈ (𝑛 ClWWalksN 𝐺) ∣ (𝑤‘0) = 𝑣}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fveq2 6916 | . . . 4 ⊢ (𝑔 = 𝐺 → (Vtx‘𝑔) = (Vtx‘𝐺)) | |
| 2 | eqidd 2764 | . . . 4 ⊢ (𝑔 = 𝐺 → ℕ0 = ℕ0) | |
| 3 | oveq2 7459 | . . . . 5 ⊢ (𝑔 = 𝐺 → (𝑛 ClWWalksN 𝑔) = (𝑛 ClWWalksN 𝐺)) | |
| 4 | 3 | rabeqdv 3431 | . . . 4 ⊢ (𝑔 = 𝐺 → {𝑤 ∈ (𝑛 ClWWalksN 𝑔) ∣ (𝑤‘0) = 𝑣} = {𝑤 ∈ (𝑛 ClWWalksN 𝐺) ∣ (𝑤‘0) = 𝑣}) |
| 5 | 1, 2, 4 | mpoeq123dv 7526 | . . 3 ⊢ (𝑔 = 𝐺 → (𝑣 ∈ (Vtx‘𝑔), 𝑛 ∈ ℕ0 ↦ {𝑤 ∈ (𝑛 ClWWalksN 𝑔) ∣ (𝑤‘0) = 𝑣}) = (𝑣 ∈ (Vtx‘𝐺), 𝑛 ∈ ℕ0 ↦ {𝑤 ∈ (𝑛 ClWWalksN 𝐺) ∣ (𝑤‘0) = 𝑣})) |
| 6 | df-clwwlknon 30736 | . . 3 ⊢ ClWWalksNOn = (𝑔 ∈ V ↦ (𝑣 ∈ (Vtx‘𝑔), 𝑛 ∈ ℕ0 ↦ {𝑤 ∈ (𝑛 ClWWalksN 𝑔) ∣ (𝑤‘0) = 𝑣})) | |
| 7 | fvex 6929 | . . . 4 ⊢ (Vtx‘𝐺) ∈ V | |
| 8 | nn0ex 12652 | . . . 4 ⊢ ℕ0 ∈ V | |
| 9 | 7, 8 | mpoex 8127 | . . 3 ⊢ (𝑣 ∈ (Vtx‘𝐺), 𝑛 ∈ ℕ0 ↦ {𝑤 ∈ (𝑛 ClWWalksN 𝐺) ∣ (𝑤‘0) = 𝑣}) ∈ V |
| 10 | 5, 6, 9 | fvmpt 7024 | . 2 ⊢ (𝐺 ∈ V → (ClWWalksNOn‘𝐺) = (𝑣 ∈ (Vtx‘𝐺), 𝑛 ∈ ℕ0 ↦ {𝑤 ∈ (𝑛 ClWWalksN 𝐺) ∣ (𝑤‘0) = 𝑣})) |
| 11 | fvprc 6908 | . . 3 ⊢ (¬ 𝐺 ∈ V → (ClWWalksNOn‘𝐺) = ∅) | |
| 12 | fvprc 6908 | . . . . 5 ⊢ (¬ 𝐺 ∈ V → (Vtx‘𝐺) = ∅) | |
| 13 | 12 | orcd 887 | . . . 4 ⊢ (¬ 𝐺 ∈ V → ((Vtx‘𝐺) = ∅ ∨ ℕ0 = ∅)) |
| 14 | 0mpo0 7534 | . . . 4 ⊢ (((Vtx‘𝐺) = ∅ ∨ ℕ0 = ∅) → (𝑣 ∈ (Vtx‘𝐺), 𝑛 ∈ ℕ0 ↦ {𝑤 ∈ (𝑛 ClWWalksN 𝐺) ∣ (𝑤‘0) = 𝑣}) = ∅) | |
| 15 | 13, 14 | syl 18 | . . 3 ⊢ (¬ 𝐺 ∈ V → (𝑣 ∈ (Vtx‘𝐺), 𝑛 ∈ ℕ0 ↦ {𝑤 ∈ (𝑛 ClWWalksN 𝐺) ∣ (𝑤‘0) = 𝑣}) = ∅) |
| 16 | 11, 15 | eqtr4d 2801 | . 2 ⊢ (¬ 𝐺 ∈ V → (ClWWalksNOn‘𝐺) = (𝑣 ∈ (Vtx‘𝐺), 𝑛 ∈ ℕ0 ↦ {𝑤 ∈ (𝑛 ClWWalksN 𝐺) ∣ (𝑤‘0) = 𝑣})) |
| 17 | 10, 16 | pm2.61i 184 | 1 ⊢ (ClWWalksNOn‘𝐺) = (𝑣 ∈ (Vtx‘𝐺), 𝑛 ∈ ℕ0 ↦ {𝑤 ∈ (𝑛 ClWWalksN 𝐺) ∣ (𝑤‘0) = 𝑣}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ∨ wo 861 = wceq 1570 ∈ wcel 2147 {crab 3416 Vcvv 3454 ∅c0 4281 ‘cfv 6566 (class class class)co 7451 ∈ cmpo 7453 0cc0 11239 ℕ0cn0 12646 Vtxcvtx 29631 ClWWalksN cclwwlkn 30672 ClWWalksNOncclwwlknon 30735 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-1cn 11297 ax-addcl 11299 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-nn 12376 df-n0 12647 df-clwwlknon 30736 |
| This theorem is used by: clwwlknon 30738 clwwlk0on0 30740 clwwlknon0 30741 2clwwlk2clwwlklem 31004 |
| Copyright terms: Public domain | W3C validator |