![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > numclwwlkovhOLD | Structured version Visualization version GIF version |
Description: Obsolete version of numclwwlkovh0 27563 as of 1-May-2022. (Contributed by Alexander van der Vekens, 26-Aug-2018.) (Revised by AV, 30-May-2021.) (New usage is discouraged.) (Proof modification is discouraged.) |
Ref | Expression |
---|---|
numclwwlkOLD.v | ⊢ 𝑉 = (Vtx‘𝐺) |
numclwwlkOLD.q | ⊢ 𝑄 = (𝑣 ∈ 𝑉, 𝑛 ∈ ℕ ↦ {𝑤 ∈ (𝑛 WWalksN 𝐺) ∣ ((𝑤‘0) = 𝑣 ∧ (lastS‘𝑤) ≠ 𝑣)}) |
numclwwlkOLD.h | ⊢ 𝐻 = (𝑣 ∈ 𝑉, 𝑛 ∈ ℕ ↦ {𝑤 ∈ (𝑛 ClWWalksN 𝐺) ∣ ((𝑤‘0) = 𝑣 ∧ (𝑤‘(𝑛 − 2)) ≠ (𝑤‘0))}) |
Ref | Expression |
---|---|
numclwwlkovhOLD | ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑋𝐻𝑁) = {𝑤 ∈ (𝑁 ClWWalksN 𝐺) ∣ ((𝑤‘0) = 𝑋 ∧ (𝑤‘(𝑁 − 2)) ≠ (𝑤‘0))}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | oveq1 6803 | . . . 4 ⊢ (𝑛 = 𝑁 → (𝑛 ClWWalksN 𝐺) = (𝑁 ClWWalksN 𝐺)) | |
2 | 1 | adantl 467 | . . 3 ⊢ ((𝑣 = 𝑋 ∧ 𝑛 = 𝑁) → (𝑛 ClWWalksN 𝐺) = (𝑁 ClWWalksN 𝐺)) |
3 | eqeq2 2782 | . . . 4 ⊢ (𝑣 = 𝑋 → ((𝑤‘0) = 𝑣 ↔ (𝑤‘0) = 𝑋)) | |
4 | oveq1 6803 | . . . . . 6 ⊢ (𝑛 = 𝑁 → (𝑛 − 2) = (𝑁 − 2)) | |
5 | 4 | fveq2d 6337 | . . . . 5 ⊢ (𝑛 = 𝑁 → (𝑤‘(𝑛 − 2)) = (𝑤‘(𝑁 − 2))) |
6 | 5 | neeq1d 3002 | . . . 4 ⊢ (𝑛 = 𝑁 → ((𝑤‘(𝑛 − 2)) ≠ (𝑤‘0) ↔ (𝑤‘(𝑁 − 2)) ≠ (𝑤‘0))) |
7 | 3, 6 | bi2anan9 620 | . . 3 ⊢ ((𝑣 = 𝑋 ∧ 𝑛 = 𝑁) → (((𝑤‘0) = 𝑣 ∧ (𝑤‘(𝑛 − 2)) ≠ (𝑤‘0)) ↔ ((𝑤‘0) = 𝑋 ∧ (𝑤‘(𝑁 − 2)) ≠ (𝑤‘0)))) |
8 | 2, 7 | rabeqbidv 3345 | . 2 ⊢ ((𝑣 = 𝑋 ∧ 𝑛 = 𝑁) → {𝑤 ∈ (𝑛 ClWWalksN 𝐺) ∣ ((𝑤‘0) = 𝑣 ∧ (𝑤‘(𝑛 − 2)) ≠ (𝑤‘0))} = {𝑤 ∈ (𝑁 ClWWalksN 𝐺) ∣ ((𝑤‘0) = 𝑋 ∧ (𝑤‘(𝑁 − 2)) ≠ (𝑤‘0))}) |
9 | numclwwlkOLD.h | . 2 ⊢ 𝐻 = (𝑣 ∈ 𝑉, 𝑛 ∈ ℕ ↦ {𝑤 ∈ (𝑛 ClWWalksN 𝐺) ∣ ((𝑤‘0) = 𝑣 ∧ (𝑤‘(𝑛 − 2)) ≠ (𝑤‘0))}) | |
10 | ovex 6827 | . . 3 ⊢ (𝑁 ClWWalksN 𝐺) ∈ V | |
11 | 10 | rabex 4947 | . 2 ⊢ {𝑤 ∈ (𝑁 ClWWalksN 𝐺) ∣ ((𝑤‘0) = 𝑋 ∧ (𝑤‘(𝑁 − 2)) ≠ (𝑤‘0))} ∈ V |
12 | 8, 9, 11 | ovmpt2a 6942 | 1 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑋𝐻𝑁) = {𝑤 ∈ (𝑁 ClWWalksN 𝐺) ∣ ((𝑤‘0) = 𝑋 ∧ (𝑤‘(𝑁 − 2)) ≠ (𝑤‘0))}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 382 = wceq 1631 ∈ wcel 2145 ≠ wne 2943 {crab 3065 ‘cfv 6030 (class class class)co 6796 ↦ cmpt2 6798 0cc0 10142 − cmin 10472 ℕcn 11226 2c2 11276 lastSclsw 13488 Vtxcvtx 26095 WWalksN cwwlksn 26954 ClWWalksN cclwwlkn 27174 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1870 ax-4 1885 ax-5 1991 ax-6 2057 ax-7 2093 ax-9 2154 ax-10 2174 ax-11 2190 ax-12 2203 ax-13 2408 ax-ext 2751 ax-sep 4916 ax-nul 4924 ax-pr 5035 |
This theorem depends on definitions: df-bi 197 df-an 383 df-or 837 df-3an 1073 df-tru 1634 df-ex 1853 df-nf 1858 df-sb 2050 df-eu 2622 df-mo 2623 df-clab 2758 df-cleq 2764 df-clel 2767 df-nfc 2902 df-ne 2944 df-ral 3066 df-rex 3067 df-rab 3070 df-v 3353 df-sbc 3588 df-dif 3726 df-un 3728 df-in 3730 df-ss 3737 df-nul 4064 df-if 4227 df-sn 4318 df-pr 4320 df-op 4324 df-uni 4576 df-br 4788 df-opab 4848 df-id 5158 df-xp 5256 df-rel 5257 df-cnv 5258 df-co 5259 df-dm 5260 df-iota 5993 df-fun 6032 df-fv 6038 df-ov 6799 df-oprab 6800 df-mpt2 6801 |
This theorem is referenced by: numclwwlk2lem1OLD 27574 numclwlk2lem2fOLD 27575 numclwlk2lem2f1oOLD 27577 numclwwlk3lemOLD 27580 |
Copyright terms: Public domain | W3C validator |