Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > rusgrnumwwlklem | Structured version Visualization version GIF version |
Description: Lemma for rusgrnumwwlk 28241 etc. (Contributed by Alexander van der Vekens, 21-Jul-2018.) (Revised by AV, 7-May-2021.) |
Ref | Expression |
---|---|
rusgrnumwwlk.v | ⊢ 𝑉 = (Vtx‘𝐺) |
rusgrnumwwlk.l | ⊢ 𝐿 = (𝑣 ∈ 𝑉, 𝑛 ∈ ℕ0 ↦ (♯‘{𝑤 ∈ (𝑛 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑣})) |
Ref | Expression |
---|---|
rusgrnumwwlklem | ⊢ ((𝑃 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0) → (𝑃𝐿𝑁) = (♯‘{𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑃})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | oveq1 7262 | . . . . 5 ⊢ (𝑛 = 𝑁 → (𝑛 WWalksN 𝐺) = (𝑁 WWalksN 𝐺)) | |
2 | 1 | adantl 481 | . . . 4 ⊢ ((𝑣 = 𝑃 ∧ 𝑛 = 𝑁) → (𝑛 WWalksN 𝐺) = (𝑁 WWalksN 𝐺)) |
3 | eqeq2 2750 | . . . . 5 ⊢ (𝑣 = 𝑃 → ((𝑤‘0) = 𝑣 ↔ (𝑤‘0) = 𝑃)) | |
4 | 3 | adantr 480 | . . . 4 ⊢ ((𝑣 = 𝑃 ∧ 𝑛 = 𝑁) → ((𝑤‘0) = 𝑣 ↔ (𝑤‘0) = 𝑃)) |
5 | 2, 4 | rabeqbidv 3410 | . . 3 ⊢ ((𝑣 = 𝑃 ∧ 𝑛 = 𝑁) → {𝑤 ∈ (𝑛 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑣} = {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑃}) |
6 | 5 | fveq2d 6760 | . 2 ⊢ ((𝑣 = 𝑃 ∧ 𝑛 = 𝑁) → (♯‘{𝑤 ∈ (𝑛 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑣}) = (♯‘{𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑃})) |
7 | rusgrnumwwlk.l | . 2 ⊢ 𝐿 = (𝑣 ∈ 𝑉, 𝑛 ∈ ℕ0 ↦ (♯‘{𝑤 ∈ (𝑛 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑣})) | |
8 | fvex 6769 | . 2 ⊢ (♯‘{𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑃}) ∈ V | |
9 | 6, 7, 8 | ovmpoa 7406 | 1 ⊢ ((𝑃 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0) → (𝑃𝐿𝑁) = (♯‘{𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑃})) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1539 ∈ wcel 2108 {crab 3067 ‘cfv 6418 (class class class)co 7255 ∈ cmpo 7257 0cc0 10802 ℕ0cn0 12163 ♯chash 13972 Vtxcvtx 27269 WWalksN cwwlksn 28092 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-sbc 3712 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-iota 6376 df-fun 6420 df-fv 6426 df-ov 7258 df-oprab 7259 df-mpo 7260 |
This theorem is referenced by: rusgrnumwwlkb0 28237 rusgrnumwwlkb1 28238 rusgr0edg 28239 rusgrnumwwlks 28240 rusgrnumwwlkg 28242 |
Copyright terms: Public domain | W3C validator |