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 14854

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 12398	. . . 4 ⊢ 2 ∈ ℕ₀
2	1	a1i 11	. . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ≤ (♯‘𝑊)) → 2 ∈ ℕ₀)
3		lencl 14440	. . . 4 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℕ₀)
4	3	adantr 480	. . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ≤ (♯‘𝑊)) → (♯‘𝑊) ∈ ℕ₀)
5		simpr 484	. . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ≤ (♯‘𝑊)) → 2 ≤ (♯‘𝑊))
6		elfz2nn0 13518	. . 3 ⊢ (2 ∈ (0...(♯‘𝑊)) ↔ (2 ∈ ℕ₀ ∧ (♯‘𝑊) ∈ ℕ₀ ∧ 2 ≤ (♯‘𝑊)))
7	2, 4, 5, 6	syl3anbrc 1344	. 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ≤ (♯‘𝑊)) → 2 ∈ (0...(♯‘𝑊)))
8		pfxlen 14591	. . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ∈ (0...(♯‘𝑊))) → (♯‘(𝑊 prefix 2)) = 2)
9		s2len 14796	. . . . . . 7 ⊢ (♯‘⟨“(𝑊‘0)(𝑊‘1)”⟩) = 2
10	9	eqcomi 2740	. . . . . 6 ⊢ 2 = (♯‘⟨“(𝑊‘0)(𝑊‘1)”⟩)
11	10	a1i 11	. . . . 5 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 2 ∈ (0...(♯‘𝑊))) ∧ (♯‘(𝑊 prefix 2)) = 2) → 2 = (♯‘⟨“(𝑊‘0)(𝑊‘1)”⟩))
12		2nn 12198	. . . . . . . . . 10 ⊢ 2 ∈ ℕ
13		lbfzo0 13599	. . . . . . . . . 10 ⊢ (0 ∈ (0..^2) ↔ 2 ∈ ℕ)
14	12, 13	mpbir 231	. . . . . . . . 9 ⊢ 0 ∈ (0..^2)
15		pfxfv 14590	. . . . . . . . 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 6835	. . . . . . . 8 ⊢ (𝑊‘0) ∈ V
19		s2fv0 14794	. . . . . . . 8 ⊢ ((𝑊‘0) ∈ V → (⟨“(𝑊‘0)(𝑊‘1)”⟩‘0) = (𝑊‘0))
20	18, 19	ax-mp 5	. . . . . . 7 ⊢ (⟨“(𝑊‘0)(𝑊‘1)”⟩‘0) = (𝑊‘0)
21	17, 20	eqtr4di 2784	. . . . . 6 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 2 ∈ (0...(♯‘𝑊))) ∧ (♯‘(𝑊 prefix 2)) = 2) → ((𝑊 prefix 2)‘0) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘0))
22		1nn0 12397	. . . . . . . . . 10 ⊢ 1 ∈ ℕ₀
23		1lt2 12291	. . . . . . . . . 10 ⊢ 1 < 2
24		elfzo0 13600	. . . . . . . . . 10 ⊢ (1 ∈ (0..^2) ↔ (1 ∈ ℕ₀ ∧ 2 ∈ ℕ ∧ 1 < 2))
25	22, 12, 23, 24	mpbir3an 1342	. . . . . . . . 9 ⊢ 1 ∈ (0..^2)
26		pfxfv 14590	. . . . . . . . 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 6835	. . . . . . . . 9 ⊢ (𝑊‘1) ∈ V
29		s2fv1 14795	. . . . . . . . 9 ⊢ ((𝑊‘1) ∈ V → (⟨“(𝑊‘0)(𝑊‘1)”⟩‘1) = (𝑊‘1))
30	28, 29	ax-mp 5	. . . . . . . 8 ⊢ (⟨“(𝑊‘0)(𝑊‘1)”⟩‘1) = (𝑊‘1)
31	27, 30	eqtr4di 2784	. . . . . . 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 12396	. . . . . . 7 ⊢ 0 ∈ ℕ₀
34		fveq2 6822	. . . . . . . . 9 ⊢ (𝑖 = 0 → ((𝑊 prefix 2)‘𝑖) = ((𝑊 prefix 2)‘0))
35		fveq2 6822	. . . . . . . . 9 ⊢ (𝑖 = 0 → (⟨“(𝑊‘0)(𝑊‘1)”⟩‘𝑖) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘0))
36	34, 35	eqeq12d 2747	. . . . . . . 8 ⊢ (𝑖 = 0 → (((𝑊 prefix 2)‘𝑖) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘𝑖) ↔ ((𝑊 prefix 2)‘0) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘0)))
37		fveq2 6822	. . . . . . . . 9 ⊢ (𝑖 = 1 → ((𝑊 prefix 2)‘𝑖) = ((𝑊 prefix 2)‘1))
38		fveq2 6822	. . . . . . . . 9 ⊢ (𝑖 = 1 → (⟨“(𝑊‘0)(𝑊‘1)”⟩‘𝑖) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘1))
39	37, 38	eqeq12d 2747	. . . . . . . 8 ⊢ (𝑖 = 1 → (((𝑊 prefix 2)‘𝑖) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘𝑖) ↔ ((𝑊 prefix 2)‘1) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘1)))
40	36, 39	ralprg 4646	. . . . . . 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 2735	. . . . . . 7 ⊢ ((♯‘(𝑊 prefix 2)) = 2 → ((♯‘(𝑊 prefix 2)) = (♯‘⟨“(𝑊‘0)(𝑊‘1)”⟩) ↔ 2 = (♯‘⟨“(𝑊‘0)(𝑊‘1)”⟩)))
44		oveq2 7354	. . . . . . . . 9 ⊢ ((♯‘(𝑊 prefix 2)) = 2 → (0..^(♯‘(𝑊 prefix 2))) = (0..^2))
45		fzo0to2pr 13650	. . . . . . . . 9 ⊢ (0..^2) = {0, 1}
46	44, 45	eqtrdi 2782	. . . . . . . 8 ⊢ ((♯‘(𝑊 prefix 2)) = 2 → (0..^(♯‘(𝑊 prefix 2))) = {0, 1})
47	46	raleqdv 3292	. . . . . . 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 14585	. . . . 5 ⊢ (𝑊 ∈ Word 𝑉 → (𝑊 prefix 2) ∈ Word 𝑉)
53		s2cli 14787	. . . . 5 ⊢ ⟨“(𝑊‘0)(𝑊‘1)”⟩ ∈ Word V
54		eqwrd 14464	. . . . 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 2111 ∀wral 3047 Vcvv 3436 {cpr 4575 class class class wbr 5089 ‘cfv 6481 (class class class)co 7346 0cc0 11006 1c1 11007 < clt 11146 ≤ cle 11147 ℕcn 12125 2c2 12180 ℕ₀cn0 12381 ...cfz 13407 ..^cfzo 13554 ♯chash 14237 Word cword 14420 prefix cpfx 14578 ⟨“cs2 14748

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 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5215 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7668 ax-cnex 11062 ax-resscn 11063 ax-1cn 11064 ax-icn 11065 ax-addcl 11066 ax-addrcl 11067 ax-mulcl 11068 ax-mulrcl 11069 ax-mulcom 11070 ax-addass 11071 ax-mulass 11072 ax-distr 11073 ax-i2m1 11074 ax-1ne0 11075 ax-1rid 11076 ax-rnegex 11077 ax-rrecex 11078 ax-cnre 11079 ax-pre-lttri 11080 ax-pre-lttrn 11081 ax-pre-ltadd 11082 ax-pre-mulgt0 11083

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 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-pss 3917 df-nul 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4857 df-int 4896 df-iun 4941 df-br 5090 df-opab 5152 df-mpt 5171 df-tr 5197 df-id 5509 df-eprel 5514 df-po 5522 df-so 5523 df-fr 5567 df-we 5569 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-pred 6248 df-ord 6309 df-on 6310 df-lim 6311 df-suc 6312 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-riota 7303 df-ov 7349 df-oprab 7350 df-mpo 7351 df-om 7797 df-1st 7921 df-2nd 7922 df-frecs 8211 df-wrecs 8242 df-recs 8291 df-rdg 8329 df-1o 8385 df-er 8622 df-en 8870 df-dom 8871 df-sdom 8872 df-fin 8873 df-card 9832 df-pnf 11148 df-mnf 11149 df-xr 11150 df-ltxr 11151 df-le 11152 df-sub 11346 df-neg 11347 df-nn 12126 df-2 12188 df-n0 12382 df-z 12469 df-uz 12733 df-fz 13408 df-fzo 13555 df-hash 14238 df-word 14421 df-concat 14478 df-s1 14504 df-substr 14549 df-pfx 14579 df-s2 14755

This theorem is referenced by: (None)

W3C validator