pfx2 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > pfx2		Structured version Visualization version GIF version

Theorem pfx2 14870

Description: A prefix of length two. (Contributed by AV, 15-May-2020.)

**Assertion**
Ref	Expression
pfx2	⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ≤ (♯‘𝑊)) → (𝑊 prefix 2) = ⟨“(𝑊‘0)(𝑊‘1)”⟩)

Proof of Theorem pfx2 Dummy variable 𝑖 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		2nn0 12418	. . . 4 ⊢ 2 ∈ ℕ₀
2	1	a1i 11	. . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ≤ (♯‘𝑊)) → 2 ∈ ℕ₀)
3		lencl 14456	. . . 4 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℕ₀)
4	3	adantr 480	. . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ≤ (♯‘𝑊)) → (♯‘𝑊) ∈ ℕ₀)
5		simpr 484	. . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ≤ (♯‘𝑊)) → 2 ≤ (♯‘𝑊))
6		elfz2nn0 13534	. . 3 ⊢ (2 ∈ (0...(♯‘𝑊)) ↔ (2 ∈ ℕ₀ ∧ (♯‘𝑊) ∈ ℕ₀ ∧ 2 ≤ (♯‘𝑊)))
7	2, 4, 5, 6	syl3anbrc 1344	. 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ≤ (♯‘𝑊)) → 2 ∈ (0...(♯‘𝑊)))
8		pfxlen 14607	. . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ∈ (0...(♯‘𝑊))) → (♯‘(𝑊 prefix 2)) = 2)
9		s2len 14812	. . . . . . 7 ⊢ (♯‘⟨“(𝑊‘0)(𝑊‘1)”⟩) = 2
10	9	eqcomi 2745	. . . . . 6 ⊢ 2 = (♯‘⟨“(𝑊‘0)(𝑊‘1)”⟩)
11	10	a1i 11	. . . . 5 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 2 ∈ (0...(♯‘𝑊))) ∧ (♯‘(𝑊 prefix 2)) = 2) → 2 = (♯‘⟨“(𝑊‘0)(𝑊‘1)”⟩))
12		2nn 12218	. . . . . . . . . 10 ⊢ 2 ∈ ℕ
13		lbfzo0 13615	. . . . . . . . . 10 ⊢ (0 ∈ (0..^2) ↔ 2 ∈ ℕ)
14	12, 13	mpbir 231	. . . . . . . . 9 ⊢ 0 ∈ (0..^2)
15		pfxfv 14606	. . . . . . . . 9 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ∈ (0...(♯‘𝑊)) ∧ 0 ∈ (0..^2)) → ((𝑊 prefix 2)‘0) = (𝑊‘0))
16	14, 15	mp3an3 1452	. . . . . . . 8 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ∈ (0...(♯‘𝑊))) → ((𝑊 prefix 2)‘0) = (𝑊‘0))
17	16	adantr 480	. . . . . . 7 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 2 ∈ (0...(♯‘𝑊))) ∧ (♯‘(𝑊 prefix 2)) = 2) → ((𝑊 prefix 2)‘0) = (𝑊‘0))
18		fvex 6847	. . . . . . . 8 ⊢ (𝑊‘0) ∈ V
19		s2fv0 14810	. . . . . . . 8 ⊢ ((𝑊‘0) ∈ V → (⟨“(𝑊‘0)(𝑊‘1)”⟩‘0) = (𝑊‘0))
20	18, 19	ax-mp 5	. . . . . . 7 ⊢ (⟨“(𝑊‘0)(𝑊‘1)”⟩‘0) = (𝑊‘0)
21	17, 20	eqtr4di 2789	. . . . . 6 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 2 ∈ (0...(♯‘𝑊))) ∧ (♯‘(𝑊 prefix 2)) = 2) → ((𝑊 prefix 2)‘0) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘0))
22		1nn0 12417	. . . . . . . . . 10 ⊢ 1 ∈ ℕ₀
23		1lt2 12311	. . . . . . . . . 10 ⊢ 1 < 2
24		elfzo0 13616	. . . . . . . . . 10 ⊢ (1 ∈ (0..^2) ↔ (1 ∈ ℕ₀ ∧ 2 ∈ ℕ ∧ 1 < 2))
25	22, 12, 23, 24	mpbir3an 1342	. . . . . . . . 9 ⊢ 1 ∈ (0..^2)
26		pfxfv 14606	. . . . . . . . 9 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ∈ (0...(♯‘𝑊)) ∧ 1 ∈ (0..^2)) → ((𝑊 prefix 2)‘1) = (𝑊‘1))
27	25, 26	mp3an3 1452	. . . . . . . 8 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ∈ (0...(♯‘𝑊))) → ((𝑊 prefix 2)‘1) = (𝑊‘1))
28		fvex 6847	. . . . . . . . 9 ⊢ (𝑊‘1) ∈ V
29		s2fv1 14811	. . . . . . . . 9 ⊢ ((𝑊‘1) ∈ V → (⟨“(𝑊‘0)(𝑊‘1)”⟩‘1) = (𝑊‘1))
30	28, 29	ax-mp 5	. . . . . . . 8 ⊢ (⟨“(𝑊‘0)(𝑊‘1)”⟩‘1) = (𝑊‘1)
31	27, 30	eqtr4di 2789	. . . . . . 7 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ∈ (0...(♯‘𝑊))) → ((𝑊 prefix 2)‘1) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘1))
32	31	adantr 480	. . . . . 6 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 2 ∈ (0...(♯‘𝑊))) ∧ (♯‘(𝑊 prefix 2)) = 2) → ((𝑊 prefix 2)‘1) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘1))
33		0nn0 12416	. . . . . . 7 ⊢ 0 ∈ ℕ₀
34		fveq2 6834	. . . . . . . . 9 ⊢ (𝑖 = 0 → ((𝑊 prefix 2)‘𝑖) = ((𝑊 prefix 2)‘0))
35		fveq2 6834	. . . . . . . . 9 ⊢ (𝑖 = 0 → (⟨“(𝑊‘0)(𝑊‘1)”⟩‘𝑖) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘0))
36	34, 35	eqeq12d 2752	. . . . . . . 8 ⊢ (𝑖 = 0 → (((𝑊 prefix 2)‘𝑖) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘𝑖) ↔ ((𝑊 prefix 2)‘0) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘0)))
37		fveq2 6834	. . . . . . . . 9 ⊢ (𝑖 = 1 → ((𝑊 prefix 2)‘𝑖) = ((𝑊 prefix 2)‘1))
38		fveq2 6834	. . . . . . . . 9 ⊢ (𝑖 = 1 → (⟨“(𝑊‘0)(𝑊‘1)”⟩‘𝑖) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘1))
39	37, 38	eqeq12d 2752	. . . . . . . 8 ⊢ (𝑖 = 1 → (((𝑊 prefix 2)‘𝑖) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘𝑖) ↔ ((𝑊 prefix 2)‘1) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘1)))
40	36, 39	ralprg 4653	. . . . . . 7 ⊢ ((0 ∈ ℕ₀ ∧ 1 ∈ ℕ₀) → (∀𝑖 ∈ {0, 1} ((𝑊 prefix 2)‘𝑖) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘𝑖) ↔ (((𝑊 prefix 2)‘0) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘0) ∧ ((𝑊 prefix 2)‘1) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘1))))
41	33, 22, 40	mp2an 692	. . . . . 6 ⊢ (∀𝑖 ∈ {0, 1} ((𝑊 prefix 2)‘𝑖) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘𝑖) ↔ (((𝑊 prefix 2)‘0) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘0) ∧ ((𝑊 prefix 2)‘1) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘1)))
42	21, 32, 41	sylanbrc 583	. . . . 5 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 2 ∈ (0...(♯‘𝑊))) ∧ (♯‘(𝑊 prefix 2)) = 2) → ∀𝑖 ∈ {0, 1} ((𝑊 prefix 2)‘𝑖) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘𝑖))
43		eqeq1 2740	. . . . . . 7 ⊢ ((♯‘(𝑊 prefix 2)) = 2 → ((♯‘(𝑊 prefix 2)) = (♯‘⟨“(𝑊‘0)(𝑊‘1)”⟩) ↔ 2 = (♯‘⟨“(𝑊‘0)(𝑊‘1)”⟩)))
44		oveq2 7366	. . . . . . . . 9 ⊢ ((♯‘(𝑊 prefix 2)) = 2 → (0..^(♯‘(𝑊 prefix 2))) = (0..^2))
45		fzo0to2pr 13666	. . . . . . . . 9 ⊢ (0..^2) = {0, 1}
46	44, 45	eqtrdi 2787	. . . . . . . 8 ⊢ ((♯‘(𝑊 prefix 2)) = 2 → (0..^(♯‘(𝑊 prefix 2))) = {0, 1})
47	46	raleqdv 3296	. . . . . . 7 ⊢ ((♯‘(𝑊 prefix 2)) = 2 → (∀𝑖 ∈ (0..^(♯‘(𝑊 prefix 2)))((𝑊 prefix 2)‘𝑖) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘𝑖) ↔ ∀𝑖 ∈ {0, 1} ((𝑊 prefix 2)‘𝑖) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘𝑖)))
48	43, 47	anbi12d 632	. . . . . 6 ⊢ ((♯‘(𝑊 prefix 2)) = 2 → (((♯‘(𝑊 prefix 2)) = (♯‘⟨“(𝑊‘0)(𝑊‘1)”⟩) ∧ ∀𝑖 ∈ (0..^(♯‘(𝑊 prefix 2)))((𝑊 prefix 2)‘𝑖) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘𝑖)) ↔ (2 = (♯‘⟨“(𝑊‘0)(𝑊‘1)”⟩) ∧ ∀𝑖 ∈ {0, 1} ((𝑊 prefix 2)‘𝑖) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘𝑖))))
49	48	adantl 481	. . . . 5 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 2 ∈ (0...(♯‘𝑊))) ∧ (♯‘(𝑊 prefix 2)) = 2) → (((♯‘(𝑊 prefix 2)) = (♯‘⟨“(𝑊‘0)(𝑊‘1)”⟩) ∧ ∀𝑖 ∈ (0..^(♯‘(𝑊 prefix 2)))((𝑊 prefix 2)‘𝑖) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘𝑖)) ↔ (2 = (♯‘⟨“(𝑊‘0)(𝑊‘1)”⟩) ∧ ∀𝑖 ∈ {0, 1} ((𝑊 prefix 2)‘𝑖) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘𝑖))))
50	11, 42, 49	mpbir2and 713	. . . 4 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 2 ∈ (0...(♯‘𝑊))) ∧ (♯‘(𝑊 prefix 2)) = 2) → ((♯‘(𝑊 prefix 2)) = (♯‘⟨“(𝑊‘0)(𝑊‘1)”⟩) ∧ ∀𝑖 ∈ (0..^(♯‘(𝑊 prefix 2)))((𝑊 prefix 2)‘𝑖) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘𝑖)))
51	8, 50	mpdan 687	. . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ∈ (0...(♯‘𝑊))) → ((♯‘(𝑊 prefix 2)) = (♯‘⟨“(𝑊‘0)(𝑊‘1)”⟩) ∧ ∀𝑖 ∈ (0..^(♯‘(𝑊 prefix 2)))((𝑊 prefix 2)‘𝑖) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘𝑖)))
52		pfxcl 14601	. . . . 5 ⊢ (𝑊 ∈ Word 𝑉 → (𝑊 prefix 2) ∈ Word 𝑉)
53		s2cli 14803	. . . . 5 ⊢ ⟨“(𝑊‘0)(𝑊‘1)”⟩ ∈ Word V
54		eqwrd 14480	. . . . 5 ⊢ (((𝑊 prefix 2) ∈ Word 𝑉 ∧ ⟨“(𝑊‘0)(𝑊‘1)”⟩ ∈ Word V) → ((𝑊 prefix 2) = ⟨“(𝑊‘0)(𝑊‘1)”⟩ ↔ ((♯‘(𝑊 prefix 2)) = (♯‘⟨“(𝑊‘0)(𝑊‘1)”⟩) ∧ ∀𝑖 ∈ (0..^(♯‘(𝑊 prefix 2)))((𝑊 prefix 2)‘𝑖) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘𝑖))))
55	52, 53, 54	sylancl 586	. . . 4 ⊢ (𝑊 ∈ Word 𝑉 → ((𝑊 prefix 2) = ⟨“(𝑊‘0)(𝑊‘1)”⟩ ↔ ((♯‘(𝑊 prefix 2)) = (♯‘⟨“(𝑊‘0)(𝑊‘1)”⟩) ∧ ∀𝑖 ∈ (0..^(♯‘(𝑊 prefix 2)))((𝑊 prefix 2)‘𝑖) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘𝑖))))
56	55	adantr 480	. . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ∈ (0...(♯‘𝑊))) → ((𝑊 prefix 2) = ⟨“(𝑊‘0)(𝑊‘1)”⟩ ↔ ((♯‘(𝑊 prefix 2)) = (♯‘⟨“(𝑊‘0)(𝑊‘1)”⟩) ∧ ∀𝑖 ∈ (0..^(♯‘(𝑊 prefix 2)))((𝑊 prefix 2)‘𝑖) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘𝑖))))
57	51, 56	mpbird 257	. 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ∈ (0...(♯‘𝑊))) → (𝑊 prefix 2) = ⟨“(𝑊‘0)(𝑊‘1)”⟩)
58	7, 57	syldan 591	1 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ≤ (♯‘𝑊)) → (𝑊 prefix 2) = ⟨“(𝑊‘0)(𝑊‘1)”⟩)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∀wral 3051 Vcvv 3440 {cpr 4582 class class class wbr 5098 ‘cfv 6492 (class class class)co 7358 0cc0 11026 1c1 11027 < clt 11166 ≤ cle 11167 ℕcn 12145 2c2 12200 ℕ₀cn0 12401 ...cfz 13423 ..^cfzo 13570 ♯chash 14253 Word cword 14436 prefix cpfx 14594 ⟨“cs2 14764

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-int 4903 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-card 9851 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-nn 12146 df-2 12208 df-n0 12402 df-z 12489 df-uz 12752 df-fz 13424 df-fzo 13571 df-hash 14254 df-word 14437 df-concat 14494 df-s1 14520 df-substr 14565 df-pfx 14595 df-s2 14771

This theorem is referenced by: (None)

W3C validator