Proof of Theorem rusgrnumwwlkb0
Step | Hyp | Ref
| Expression |
1 | | simpr 476 |
. . 3
⊢ ((𝐺 ∈ USPGraph ∧ 𝑃 ∈ 𝑉) → 𝑃 ∈ 𝑉) |
2 | | 0nn0 11184 |
. . 3
⊢ 0 ∈
ℕ0 |
3 | | rusgrnumwwlk.v |
. . . 4
⊢ 𝑉 = (Vtx‘𝐺) |
4 | | rusgrnumwwlk.l |
. . . 4
⊢ 𝐿 = (𝑣 ∈ 𝑉, 𝑛 ∈ ℕ0 ↦
(#‘{𝑤 ∈ (𝑛 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑣})) |
5 | 3, 4 | rusgrnumwwlklem 41173 |
. . 3
⊢ ((𝑃 ∈ 𝑉 ∧ 0 ∈ ℕ0) →
(𝑃𝐿0) = (#‘{𝑤 ∈ (0 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃})) |
6 | 1, 2, 5 | sylancl 693 |
. 2
⊢ ((𝐺 ∈ USPGraph ∧ 𝑃 ∈ 𝑉) → (𝑃𝐿0) = (#‘{𝑤 ∈ (0 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃})) |
7 | | df-rab 2905 |
. . . . 5
⊢ {𝑤 ∈ (0 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃} = {𝑤 ∣ (𝑤 ∈ (0 WWalkSN 𝐺) ∧ (𝑤‘0) = 𝑃)} |
8 | 7 | a1i 11 |
. . . 4
⊢ ((𝐺 ∈ USPGraph ∧ 𝑃 ∈ 𝑉) → {𝑤 ∈ (0 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃} = {𝑤 ∣ (𝑤 ∈ (0 WWalkSN 𝐺) ∧ (𝑤‘0) = 𝑃)}) |
9 | | wwlksn0s 41057 |
. . . . . . . . 9
⊢ (0
WWalkSN 𝐺) = {𝑤 ∈ Word (Vtx‘𝐺) ∣ (#‘𝑤) = 1} |
10 | 9 | a1i 11 |
. . . . . . . 8
⊢ ((𝐺 ∈ USPGraph ∧ 𝑃 ∈ 𝑉) → (0 WWalkSN 𝐺) = {𝑤 ∈ Word (Vtx‘𝐺) ∣ (#‘𝑤) = 1}) |
11 | 10 | eleq2d 2673 |
. . . . . . 7
⊢ ((𝐺 ∈ USPGraph ∧ 𝑃 ∈ 𝑉) → (𝑤 ∈ (0 WWalkSN 𝐺) ↔ 𝑤 ∈ {𝑤 ∈ Word (Vtx‘𝐺) ∣ (#‘𝑤) = 1})) |
12 | | rabid 3095 |
. . . . . . 7
⊢ (𝑤 ∈ {𝑤 ∈ Word (Vtx‘𝐺) ∣ (#‘𝑤) = 1} ↔ (𝑤 ∈ Word (Vtx‘𝐺) ∧ (#‘𝑤) = 1)) |
13 | 11, 12 | syl6bb 275 |
. . . . . 6
⊢ ((𝐺 ∈ USPGraph ∧ 𝑃 ∈ 𝑉) → (𝑤 ∈ (0 WWalkSN 𝐺) ↔ (𝑤 ∈ Word (Vtx‘𝐺) ∧ (#‘𝑤) = 1))) |
14 | 13 | anbi1d 737 |
. . . . 5
⊢ ((𝐺 ∈ USPGraph ∧ 𝑃 ∈ 𝑉) → ((𝑤 ∈ (0 WWalkSN 𝐺) ∧ (𝑤‘0) = 𝑃) ↔ ((𝑤 ∈ Word (Vtx‘𝐺) ∧ (#‘𝑤) = 1) ∧ (𝑤‘0) = 𝑃))) |
15 | 14 | abbidv 2728 |
. . . 4
⊢ ((𝐺 ∈ USPGraph ∧ 𝑃 ∈ 𝑉) → {𝑤 ∣ (𝑤 ∈ (0 WWalkSN 𝐺) ∧ (𝑤‘0) = 𝑃)} = {𝑤 ∣ ((𝑤 ∈ Word (Vtx‘𝐺) ∧ (#‘𝑤) = 1) ∧ (𝑤‘0) = 𝑃)}) |
16 | | wrdl1s1 13247 |
. . . . . . . . 9
⊢ (𝑃 ∈ (Vtx‘𝐺) → (𝑣 = 〈“𝑃”〉 ↔ (𝑣 ∈ Word (Vtx‘𝐺) ∧ (#‘𝑣) = 1 ∧ (𝑣‘0) = 𝑃))) |
17 | | df-3an 1033 |
. . . . . . . . 9
⊢ ((𝑣 ∈ Word (Vtx‘𝐺) ∧ (#‘𝑣) = 1 ∧ (𝑣‘0) = 𝑃) ↔ ((𝑣 ∈ Word (Vtx‘𝐺) ∧ (#‘𝑣) = 1) ∧ (𝑣‘0) = 𝑃)) |
18 | 16, 17 | syl6rbb 276 |
. . . . . . . 8
⊢ (𝑃 ∈ (Vtx‘𝐺) → (((𝑣 ∈ Word (Vtx‘𝐺) ∧ (#‘𝑣) = 1) ∧ (𝑣‘0) = 𝑃) ↔ 𝑣 = 〈“𝑃”〉)) |
19 | | vex 3176 |
. . . . . . . . 9
⊢ 𝑣 ∈ V |
20 | | eleq1 2676 |
. . . . . . . . . . 11
⊢ (𝑤 = 𝑣 → (𝑤 ∈ Word (Vtx‘𝐺) ↔ 𝑣 ∈ Word (Vtx‘𝐺))) |
21 | | fveq2 6103 |
. . . . . . . . . . . 12
⊢ (𝑤 = 𝑣 → (#‘𝑤) = (#‘𝑣)) |
22 | 21 | eqeq1d 2612 |
. . . . . . . . . . 11
⊢ (𝑤 = 𝑣 → ((#‘𝑤) = 1 ↔ (#‘𝑣) = 1)) |
23 | 20, 22 | anbi12d 743 |
. . . . . . . . . 10
⊢ (𝑤 = 𝑣 → ((𝑤 ∈ Word (Vtx‘𝐺) ∧ (#‘𝑤) = 1) ↔ (𝑣 ∈ Word (Vtx‘𝐺) ∧ (#‘𝑣) = 1))) |
24 | | fveq1 6102 |
. . . . . . . . . . 11
⊢ (𝑤 = 𝑣 → (𝑤‘0) = (𝑣‘0)) |
25 | 24 | eqeq1d 2612 |
. . . . . . . . . 10
⊢ (𝑤 = 𝑣 → ((𝑤‘0) = 𝑃 ↔ (𝑣‘0) = 𝑃)) |
26 | 23, 25 | anbi12d 743 |
. . . . . . . . 9
⊢ (𝑤 = 𝑣 → (((𝑤 ∈ Word (Vtx‘𝐺) ∧ (#‘𝑤) = 1) ∧ (𝑤‘0) = 𝑃) ↔ ((𝑣 ∈ Word (Vtx‘𝐺) ∧ (#‘𝑣) = 1) ∧ (𝑣‘0) = 𝑃))) |
27 | 19, 26 | elab 3319 |
. . . . . . . 8
⊢ (𝑣 ∈ {𝑤 ∣ ((𝑤 ∈ Word (Vtx‘𝐺) ∧ (#‘𝑤) = 1) ∧ (𝑤‘0) = 𝑃)} ↔ ((𝑣 ∈ Word (Vtx‘𝐺) ∧ (#‘𝑣) = 1) ∧ (𝑣‘0) = 𝑃)) |
28 | | velsn 4141 |
. . . . . . . 8
⊢ (𝑣 ∈ {〈“𝑃”〉} ↔ 𝑣 = 〈“𝑃”〉) |
29 | 18, 27, 28 | 3bitr4g 302 |
. . . . . . 7
⊢ (𝑃 ∈ (Vtx‘𝐺) → (𝑣 ∈ {𝑤 ∣ ((𝑤 ∈ Word (Vtx‘𝐺) ∧ (#‘𝑤) = 1) ∧ (𝑤‘0) = 𝑃)} ↔ 𝑣 ∈ {〈“𝑃”〉})) |
30 | 29, 3 | eleq2s 2706 |
. . . . . 6
⊢ (𝑃 ∈ 𝑉 → (𝑣 ∈ {𝑤 ∣ ((𝑤 ∈ Word (Vtx‘𝐺) ∧ (#‘𝑤) = 1) ∧ (𝑤‘0) = 𝑃)} ↔ 𝑣 ∈ {〈“𝑃”〉})) |
31 | 30 | eqrdv 2608 |
. . . . 5
⊢ (𝑃 ∈ 𝑉 → {𝑤 ∣ ((𝑤 ∈ Word (Vtx‘𝐺) ∧ (#‘𝑤) = 1) ∧ (𝑤‘0) = 𝑃)} = {〈“𝑃”〉}) |
32 | 31 | adantl 481 |
. . . 4
⊢ ((𝐺 ∈ USPGraph ∧ 𝑃 ∈ 𝑉) → {𝑤 ∣ ((𝑤 ∈ Word (Vtx‘𝐺) ∧ (#‘𝑤) = 1) ∧ (𝑤‘0) = 𝑃)} = {〈“𝑃”〉}) |
33 | 8, 15, 32 | 3eqtrd 2648 |
. . 3
⊢ ((𝐺 ∈ USPGraph ∧ 𝑃 ∈ 𝑉) → {𝑤 ∈ (0 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃} = {〈“𝑃”〉}) |
34 | 33 | fveq2d 6107 |
. 2
⊢ ((𝐺 ∈ USPGraph ∧ 𝑃 ∈ 𝑉) → (#‘{𝑤 ∈ (0 WWalkSN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (#‘{〈“𝑃”〉})) |
35 | | s1cl 13235 |
. . . 4
⊢ (𝑃 ∈ 𝑉 → 〈“𝑃”〉 ∈ Word 𝑉) |
36 | | hashsng 13020 |
. . . 4
⊢
(〈“𝑃”〉 ∈ Word 𝑉 → (#‘{〈“𝑃”〉}) =
1) |
37 | 35, 36 | syl 17 |
. . 3
⊢ (𝑃 ∈ 𝑉 → (#‘{〈“𝑃”〉}) =
1) |
38 | 37 | adantl 481 |
. 2
⊢ ((𝐺 ∈ USPGraph ∧ 𝑃 ∈ 𝑉) → (#‘{〈“𝑃”〉}) =
1) |
39 | 6, 34, 38 | 3eqtrd 2648 |
1
⊢ ((𝐺 ∈ USPGraph ∧ 𝑃 ∈ 𝑉) → (𝑃𝐿0) = 1) |