Theorem rusgrnumwwlkb0 29824

Description: Induction base 0 for rusgrnumwwlk 29828. Here, we do not need the regularity of the graph yet. (Contributed by Alexander van der Vekens, 24-Jul-2018.) (Revised by AV, 7-May-2021.)

Hypotheses

Ref	Expression
rusgrnumwwlk.v	⊢ 𝑉 = (Vtx‘𝐺)
rusgrnumwwlk.l	⊢ 𝐿 = (𝑣 ∈ 𝑉, 𝑛 ∈ ℕ0 ↦ (♯‘{𝑤 ∈ (𝑛 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑣}))

Assertion

Ref	Expression
rusgrnumwwlkb0	⊢ ((𝐺 ∈ USPGraph ∧ 𝑃 ∈ 𝑉) → (𝑃𝐿0) = 1)

Distinct variable groups:   𝑛,𝐺,𝑣,𝑤   𝑃,𝑛,𝑣,𝑤   𝑛,𝑉,𝑣,𝑤

Allowed substitution hints:   𝐿(𝑤,𝑣,𝑛)

Proof of Theorem rusgrnumwwlkb0

Step	Hyp	Ref	Expression
1		simpr 483	. . 3 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑃 ∈ 𝑉) → 𝑃 ∈ 𝑉)
2		0nn0 12515	. . 3 ⊢ 0 ∈ ℕ0
3		rusgrnumwwlk.v	. . . 4 ⊢ 𝑉 = (Vtx‘𝐺)
4		rusgrnumwwlk.l	. . . 4 ⊢ 𝐿 = (𝑣 ∈ 𝑉, 𝑛 ∈ ℕ0 ↦ (♯‘{𝑤 ∈ (𝑛 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑣}))
5	3, 4	rusgrnumwwlklem 29823	. . 3 ⊢ ((𝑃 ∈ 𝑉 ∧ 0 ∈ ℕ0) → (𝑃𝐿0) = (♯‘{𝑤 ∈ (0 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑃}))
6	1, 2, 5	sylancl 584	. 2 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑃 ∈ 𝑉) → (𝑃𝐿0) = (♯‘{𝑤 ∈ (0 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑃}))
7		df-rab 3420	. . . . 5 ⊢ {𝑤 ∈ (0 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑃} = {𝑤 ∣ (𝑤 ∈ (0 WWalksN 𝐺) ∧ (𝑤‘0) = 𝑃)}
8	7	a1i 11	. . . 4 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑃 ∈ 𝑉) → {𝑤 ∈ (0 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑃} = {𝑤 ∣ (𝑤 ∈ (0 WWalksN 𝐺) ∧ (𝑤‘0) = 𝑃)})
9		wwlksn0s 29714	. . . . . . . . 9 ⊢ (0 WWalksN 𝐺) = {𝑤 ∈ Word (Vtx‘𝐺) ∣ (♯‘𝑤) = 1}
10	9	a1i 11	. . . . . . . 8 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑃 ∈ 𝑉) → (0 WWalksN 𝐺) = {𝑤 ∈ Word (Vtx‘𝐺) ∣ (♯‘𝑤) = 1})
11	10	eleq2d 2811	. . . . . . 7 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑃 ∈ 𝑉) → (𝑤 ∈ (0 WWalksN 𝐺) ↔ 𝑤 ∈ {𝑤 ∈ Word (Vtx‘𝐺) ∣ (♯‘𝑤) = 1}))
12		rabid 3440	. . . . . . 7 ⊢ (𝑤 ∈ {𝑤 ∈ Word (Vtx‘𝐺) ∣ (♯‘𝑤) = 1} ↔ (𝑤 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑤) = 1))
13	11, 12	bitrdi 286	. . . . . 6 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑃 ∈ 𝑉) → (𝑤 ∈ (0 WWalksN 𝐺) ↔ (𝑤 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑤) = 1)))
14	13	anbi1d 629	. . . . 5 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑃 ∈ 𝑉) → ((𝑤 ∈ (0 WWalksN 𝐺) ∧ (𝑤‘0) = 𝑃) ↔ ((𝑤 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑤) = 1) ∧ (𝑤‘0) = 𝑃)))
15	14	abbidv 2794	. . . 4 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑃 ∈ 𝑉) → {𝑤 ∣ (𝑤 ∈ (0 WWalksN 𝐺) ∧ (𝑤‘0) = 𝑃)} = {𝑤 ∣ ((𝑤 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑤) = 1) ∧ (𝑤‘0) = 𝑃)})
16		wrdl1s1 14594	. . . . . . . . 9 ⊢ (𝑃 ∈ (Vtx‘𝐺) → (𝑣 = ⟨“𝑃”⟩ ↔ (𝑣 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑣) = 1 ∧ (𝑣‘0) = 𝑃)))
17		df-3an 1086	. . . . . . . . 9 ⊢ ((𝑣 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑣) = 1 ∧ (𝑣‘0) = 𝑃) ↔ ((𝑣 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑣) = 1) ∧ (𝑣‘0) = 𝑃))
18	16, 17	bitr2di 287	. . . . . . . 8 ⊢ (𝑃 ∈ (Vtx‘𝐺) → (((𝑣 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑣) = 1) ∧ (𝑣‘0) = 𝑃) ↔ 𝑣 = ⟨“𝑃”⟩))
19		vex 3467	. . . . . . . . 9 ⊢ 𝑣 ∈ V
20		eleq1w 2808	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑣 → (𝑤 ∈ Word (Vtx‘𝐺) ↔ 𝑣 ∈ Word (Vtx‘𝐺)))
21		fveqeq2 6900	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑣 → ((♯‘𝑤) = 1 ↔ (♯‘𝑣) = 1))
22	20, 21	anbi12d 630	. . . . . . . . . 10 ⊢ (𝑤 = 𝑣 → ((𝑤 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑤) = 1) ↔ (𝑣 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑣) = 1)))
23		fveq1 6890	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑣 → (𝑤‘0) = (𝑣‘0))
24	23	eqeq1d 2727	. . . . . . . . . 10 ⊢ (𝑤 = 𝑣 → ((𝑤‘0) = 𝑃 ↔ (𝑣‘0) = 𝑃))
25	22, 24	anbi12d 630	. . . . . . . . 9 ⊢ (𝑤 = 𝑣 → (((𝑤 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑤) = 1) ∧ (𝑤‘0) = 𝑃) ↔ ((𝑣 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑣) = 1) ∧ (𝑣‘0) = 𝑃)))
26	19, 25	elab 3660	. . . . . . . 8 ⊢ (𝑣 ∈ {𝑤 ∣ ((𝑤 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑤) = 1) ∧ (𝑤‘0) = 𝑃)} ↔ ((𝑣 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑣) = 1) ∧ (𝑣‘0) = 𝑃))
27		velsn 4640	. . . . . . . 8 ⊢ (𝑣 ∈ {⟨“𝑃”⟩} ↔ 𝑣 = ⟨“𝑃”⟩)
28	18, 26, 27	3bitr4g 313	. . . . . . 7 ⊢ (𝑃 ∈ (Vtx‘𝐺) → (𝑣 ∈ {𝑤 ∣ ((𝑤 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑤) = 1) ∧ (𝑤‘0) = 𝑃)} ↔ 𝑣 ∈ {⟨“𝑃”⟩}))
29	28, 3	eleq2s 2843	. . . . . 6 ⊢ (𝑃 ∈ 𝑉 → (𝑣 ∈ {𝑤 ∣ ((𝑤 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑤) = 1) ∧ (𝑤‘0) = 𝑃)} ↔ 𝑣 ∈ {⟨“𝑃”⟩}))
30	29	eqrdv 2723	. . . . 5 ⊢ (𝑃 ∈ 𝑉 → {𝑤 ∣ ((𝑤 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑤) = 1) ∧ (𝑤‘0) = 𝑃)} = {⟨“𝑃”⟩})
31	30	adantl 480	. . . 4 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑃 ∈ 𝑉) → {𝑤 ∣ ((𝑤 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑤) = 1) ∧ (𝑤‘0) = 𝑃)} = {⟨“𝑃”⟩})
32	8, 15, 31	3eqtrd 2769	. . 3 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑃 ∈ 𝑉) → {𝑤 ∈ (0 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑃} = {⟨“𝑃”⟩})
33	32	fveq2d 6895	. 2 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑃 ∈ 𝑉) → (♯‘{𝑤 ∈ (0 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑃}) = (♯‘{⟨“𝑃”⟩}))
34		s1cl 14582	. . . 4 ⊢ (𝑃 ∈ 𝑉 → ⟨“𝑃”⟩ ∈ Word 𝑉)
35		hashsng 14358	. . . 4 ⊢ (⟨“𝑃”⟩ ∈ Word 𝑉 → (♯‘{⟨“𝑃”⟩}) = 1)
36	34, 35	syl 17	. . 3 ⊢ (𝑃 ∈ 𝑉 → (♯‘{⟨“𝑃”⟩}) = 1)
37	36	adantl 480	. 2 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑃 ∈ 𝑉) → (♯‘{⟨“𝑃”⟩}) = 1)
38	6, 33, 37	3eqtrd 2769	1 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑃 ∈ 𝑉) → (𝑃𝐿0) = 1)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 394   ∧ w3a 1084   = wceq 1533   ∈ wcel 2098  {cab 2702  {crab 3419  {csn 4624  ‘cfv 6542  (class class class)co 7415   ∈ cmpo 7417  0cc0 11136  1c1 11137  ℕ₀cn0 12500  ♯chash 14319  Word cword 14494  ⟨“cs1 14575  Vtxcvtx 28851  USPGraphcuspgr 29003   WWalksN cwwlksn 29679

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2696  ax-rep 5280  ax-sep 5294  ax-nul 5301  ax-pow 5359  ax-pr 5423  ax-un 7737  ax-cnex 11192  ax-resscn 11193  ax-1cn 11194  ax-icn 11195  ax-addcl 11196  ax-addrcl 11197  ax-mulcl 11198  ax-mulrcl 11199  ax-mulcom 11200  ax-addass 11201  ax-mulass 11202  ax-distr 11203  ax-i2m1 11204  ax-1ne0 11205  ax-1rid 11206  ax-rnegex 11207  ax-rrecex 11208  ax-cnre 11209  ax-pre-lttri 11210  ax-pre-lttrn 11211  ax-pre-ltadd 11212  ax-pre-mulgt0 11213

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2703  df-cleq 2717  df-clel 2802  df-nfc 2877  df-ne 2931  df-nel 3037  df-ral 3052  df-rex 3061  df-reu 3365  df-rab 3420  df-v 3465  df-sbc 3770  df-csb 3886  df-dif 3943  df-un 3945  df-in 3947  df-ss 3957  df-pss 3960  df-nul 4319  df-if 4525  df-pw 4600  df-sn 4625  df-pr 4627  df-op 4631  df-uni 4904  df-int 4945  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5227  df-tr 5261  df-id 5570  df-eprel 5576  df-po 5584  df-so 5585  df-fr 5627  df-we 5629  df-xp 5678  df-rel 5679  df-cnv 5680  df-co 5681  df-dm 5682  df-rn 5683  df-res 5684  df-ima 5685  df-pred 6300  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6494  df-fun 6544  df-fn 6545  df-f 6546  df-f1 6547  df-fo 6548  df-f1o 6549  df-fv 6550  df-riota 7371  df-ov 7418  df-oprab 7419  df-mpo 7420  df-om 7868  df-1st 7989  df-2nd 7990  df-frecs 8283  df-wrecs 8314  df-recs 8388  df-rdg 8427  df-1o 8483  df-er 8721  df-map 8843  df-en 8961  df-dom 8962  df-sdom 8963  df-fin 8964  df-card 9960  df-pnf 11278  df-mnf 11279  df-xr 11280  df-ltxr 11281  df-le 11282  df-sub 11474  df-neg 11475  df-nn 12241  df-n0 12501  df-xnn0 12573  df-z 12587  df-uz 12851  df-fz 13515  df-fzo 13658  df-hash 14320  df-word 14495  df-s1 14576  df-wwlks 29683  df-wwlksn 29684

This theorem is referenced by:  rusgrnumwwlk  29828