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 14986

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 12543	. . . 4 ⊢ 2 ∈ ℕ₀
2	1	a1i 11	. . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ≤ (♯‘𝑊)) → 2 ∈ ℕ₀)
3		lencl 14571	. . . 4 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℕ₀)
4	3	adantr 480	. . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ≤ (♯‘𝑊)) → (♯‘𝑊) ∈ ℕ₀)
5		simpr 484	. . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ≤ (♯‘𝑊)) → 2 ≤ (♯‘𝑊))
6		elfz2nn0 13658	. . 3 ⊢ (2 ∈ (0...(♯‘𝑊)) ↔ (2 ∈ ℕ₀ ∧ (♯‘𝑊) ∈ ℕ₀ ∧ 2 ≤ (♯‘𝑊)))
7	2, 4, 5, 6	syl3anbrc 1344	. 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ≤ (♯‘𝑊)) → 2 ∈ (0...(♯‘𝑊)))
8		pfxlen 14721	. . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 2 ∈ (0...(♯‘𝑊))) → (♯‘(𝑊 prefix 2)) = 2)
9		s2len 14928	. . . . . . 7 ⊢ (♯‘⟨“(𝑊‘0)(𝑊‘1)”⟩) = 2
10	9	eqcomi 2746	. . . . . 6 ⊢ 2 = (♯‘⟨“(𝑊‘0)(𝑊‘1)”⟩)
11	10	a1i 11	. . . . 5 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 2 ∈ (0...(♯‘𝑊))) ∧ (♯‘(𝑊 prefix 2)) = 2) → 2 = (♯‘⟨“(𝑊‘0)(𝑊‘1)”⟩))
12		2nn 12339	. . . . . . . . . 10 ⊢ 2 ∈ ℕ
13		lbfzo0 13739	. . . . . . . . . 10 ⊢ (0 ∈ (0..^2) ↔ 2 ∈ ℕ)
14	12, 13	mpbir 231	. . . . . . . . 9 ⊢ 0 ∈ (0..^2)
15		pfxfv 14720	. . . . . . . . 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 6919	. . . . . . . 8 ⊢ (𝑊‘0) ∈ V
19		s2fv0 14926	. . . . . . . 8 ⊢ ((𝑊‘0) ∈ V → (⟨“(𝑊‘0)(𝑊‘1)”⟩‘0) = (𝑊‘0))
20	18, 19	ax-mp 5	. . . . . . 7 ⊢ (⟨“(𝑊‘0)(𝑊‘1)”⟩‘0) = (𝑊‘0)
21	17, 20	eqtr4di 2795	. . . . . 6 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 2 ∈ (0...(♯‘𝑊))) ∧ (♯‘(𝑊 prefix 2)) = 2) → ((𝑊 prefix 2)‘0) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘0))
22		1nn0 12542	. . . . . . . . . 10 ⊢ 1 ∈ ℕ₀
23		1lt2 12437	. . . . . . . . . 10 ⊢ 1 < 2
24		elfzo0 13740	. . . . . . . . . 10 ⊢ (1 ∈ (0..^2) ↔ (1 ∈ ℕ₀ ∧ 2 ∈ ℕ ∧ 1 < 2))
25	22, 12, 23, 24	mpbir3an 1342	. . . . . . . . 9 ⊢ 1 ∈ (0..^2)
26		pfxfv 14720	. . . . . . . . 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 6919	. . . . . . . . 9 ⊢ (𝑊‘1) ∈ V
29		s2fv1 14927	. . . . . . . . 9 ⊢ ((𝑊‘1) ∈ V → (⟨“(𝑊‘0)(𝑊‘1)”⟩‘1) = (𝑊‘1))
30	28, 29	ax-mp 5	. . . . . . . 8 ⊢ (⟨“(𝑊‘0)(𝑊‘1)”⟩‘1) = (𝑊‘1)
31	27, 30	eqtr4di 2795	. . . . . . 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 12541	. . . . . . 7 ⊢ 0 ∈ ℕ₀
34		fveq2 6906	. . . . . . . . 9 ⊢ (𝑖 = 0 → ((𝑊 prefix 2)‘𝑖) = ((𝑊 prefix 2)‘0))
35		fveq2 6906	. . . . . . . . 9 ⊢ (𝑖 = 0 → (⟨“(𝑊‘0)(𝑊‘1)”⟩‘𝑖) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘0))
36	34, 35	eqeq12d 2753	. . . . . . . 8 ⊢ (𝑖 = 0 → (((𝑊 prefix 2)‘𝑖) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘𝑖) ↔ ((𝑊 prefix 2)‘0) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘0)))
37		fveq2 6906	. . . . . . . . 9 ⊢ (𝑖 = 1 → ((𝑊 prefix 2)‘𝑖) = ((𝑊 prefix 2)‘1))
38		fveq2 6906	. . . . . . . . 9 ⊢ (𝑖 = 1 → (⟨“(𝑊‘0)(𝑊‘1)”⟩‘𝑖) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘1))
39	37, 38	eqeq12d 2753	. . . . . . . 8 ⊢ (𝑖 = 1 → (((𝑊 prefix 2)‘𝑖) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘𝑖) ↔ ((𝑊 prefix 2)‘1) = (⟨“(𝑊‘0)(𝑊‘1)”⟩‘1)))
40	36, 39	ralprg 4696	. . . . . . 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 2741	. . . . . . 7 ⊢ ((♯‘(𝑊 prefix 2)) = 2 → ((♯‘(𝑊 prefix 2)) = (♯‘⟨“(𝑊‘0)(𝑊‘1)”⟩) ↔ 2 = (♯‘⟨“(𝑊‘0)(𝑊‘1)”⟩)))
44		oveq2 7439	. . . . . . . . 9 ⊢ ((♯‘(𝑊 prefix 2)) = 2 → (0..^(♯‘(𝑊 prefix 2))) = (0..^2))
45		fzo0to2pr 13789	. . . . . . . . 9 ⊢ (0..^2) = {0, 1}
46	44, 45	eqtrdi 2793	. . . . . . . 8 ⊢ ((♯‘(𝑊 prefix 2)) = 2 → (0..^(♯‘(𝑊 prefix 2))) = {0, 1})
47	46	raleqdv 3326	. . . . . . 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 14715	. . . . 5 ⊢ (𝑊 ∈ Word 𝑉 → (𝑊 prefix 2) ∈ Word 𝑉)
53		s2cli 14919	. . . . 5 ⊢ ⟨“(𝑊‘0)(𝑊‘1)”⟩ ∈ Word V
54		eqwrd 14595	. . . . 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 1540 ∈ wcel 2108 ∀wral 3061 Vcvv 3480 {cpr 4628 class class class wbr 5143 ‘cfv 6561 (class class class)co 7431 0cc0 11155 1c1 11156 < clt 11295 ≤ cle 11296 ℕcn 12266 2c2 12321 ℕ₀cn0 12526 ...cfz 13547 ..^cfzo 13694 ♯chash 14369 Word cword 14552 prefix cpfx 14708 ⟨“cs2 14880

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-rep 5279 ax-sep 5296 ax-nul 5306 ax-pow 5365 ax-pr 5432 ax-un 7755 ax-cnex 11211 ax-resscn 11212 ax-1cn 11213 ax-icn 11214 ax-addcl 11215 ax-addrcl 11216 ax-mulcl 11217 ax-mulrcl 11218 ax-mulcom 11219 ax-addass 11220 ax-mulass 11221 ax-distr 11222 ax-i2m1 11223 ax-1ne0 11224 ax-1rid 11225 ax-rnegex 11226 ax-rrecex 11227 ax-cnre 11228 ax-pre-lttri 11229 ax-pre-lttrn 11230 ax-pre-ltadd 11231 ax-pre-mulgt0 11232

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3381 df-rab 3437 df-v 3482 df-sbc 3789 df-csb 3900 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-pss 3971 df-nul 4334 df-if 4526 df-pw 4602 df-sn 4627 df-pr 4629 df-op 4633 df-uni 4908 df-int 4947 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5226 df-tr 5260 df-id 5578 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5637 df-we 5639 df-xp 5691 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-rn 5696 df-res 5697 df-ima 5698 df-pred 6321 df-ord 6387 df-on 6388 df-lim 6389 df-suc 6390 df-iota 6514 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8014 df-2nd 8015 df-frecs 8306 df-wrecs 8337 df-recs 8411 df-rdg 8450 df-1o 8506 df-er 8745 df-en 8986 df-dom 8987 df-sdom 8988 df-fin 8989 df-card 9979 df-pnf 11297 df-mnf 11298 df-xr 11299 df-ltxr 11300 df-le 11301 df-sub 11494 df-neg 11495 df-nn 12267 df-2 12329 df-n0 12527 df-z 12614 df-uz 12879 df-fz 13548 df-fzo 13695 df-hash 14370 df-word 14553 df-concat 14609 df-s1 14634 df-substr 14679 df-pfx 14709 df-s2 14887

This theorem is referenced by: (None)

W3C validator