swrdccat3blem - Metamath Proof Explorer

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

Theorem swrdccat3blem 14704

Description: Lemma for swrdccat3b 14705. (Contributed by AV, 30-May-2018.)

**Hypothesis**
Ref	Expression
swrdccatin2.l	⊢ 𝐿 = (♯‘𝐴)

**Assertion**
Ref	Expression
swrdccat3blem	⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ 𝑀 ∈ (0...(𝐿 + (♯‘𝐵)))) ∧ (𝐿 + (♯‘𝐵)) ≤ 𝐿) → if(𝐿 ≤ 𝑀, (𝐵 substr ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ 𝐵)) = (𝐴 substr ⟨𝑀, (𝐿 + (♯‘𝐵))⟩))

**Proof of Theorem swrdccat3blem**
Step	Hyp	Ref	Expression
1		lencl 14498	. . . . . . . 8 ⊢ (𝐵 ∈ Word 𝑉 → (♯‘𝐵) ∈ ℕ₀)
2		nn0le0eq0 12470	. . . . . . . . 9 ⊢ ((♯‘𝐵) ∈ ℕ₀ → ((♯‘𝐵) ≤ 0 ↔ (♯‘𝐵) = 0))
3	2	biimpd 229	. . . . . . . 8 ⊢ ((♯‘𝐵) ∈ ℕ₀ → ((♯‘𝐵) ≤ 0 → (♯‘𝐵) = 0))
4	1, 3	syl 17	. . . . . . 7 ⊢ (𝐵 ∈ Word 𝑉 → ((♯‘𝐵) ≤ 0 → (♯‘𝐵) = 0))
5	4	adantl 481	. . . . . 6 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → ((♯‘𝐵) ≤ 0 → (♯‘𝐵) = 0))
6		hasheq0 14328	. . . . . . . . . . 11 ⊢ (𝐵 ∈ Word 𝑉 → ((♯‘𝐵) = 0 ↔ 𝐵 = ∅))
7	6	biimpd 229	. . . . . . . . . 10 ⊢ (𝐵 ∈ Word 𝑉 → ((♯‘𝐵) = 0 → 𝐵 = ∅))
8	7	adantl 481	. . . . . . . . 9 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → ((♯‘𝐵) = 0 → 𝐵 = ∅))
9	8	imp 406	. . . . . . . 8 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (♯‘𝐵) = 0) → 𝐵 = ∅)
10		lencl 14498	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ∈ Word 𝑉 → (♯‘𝐴) ∈ ℕ₀)
11		swrdccatin2.l	. . . . . . . . . . . . . . . . . . 19 ⊢ 𝐿 = (♯‘𝐴)
12	11	eqcomi 2738	. . . . . . . . . . . . . . . . . 18 ⊢ (♯‘𝐴) = 𝐿
13	12	eleq1i 2819	. . . . . . . . . . . . . . . . 17 ⊢ ((♯‘𝐴) ∈ ℕ₀ ↔ 𝐿 ∈ ℕ₀)
14		nn0re 12451	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐿 ∈ ℕ₀ → 𝐿 ∈ ℝ)
15		elfz2nn0 13579	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑀 ∈ (0...(𝐿 + 0)) ↔ (𝑀 ∈ ℕ₀ ∧ (𝐿 + 0) ∈ ℕ₀ ∧ 𝑀 ≤ (𝐿 + 0)))
16		recn 11158	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝐿 ∈ ℝ → 𝐿 ∈ ℂ)
17	16	addridd 11374	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝐿 ∈ ℝ → (𝐿 + 0) = 𝐿)
18	17	breq2d 5119	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝐿 ∈ ℝ → (𝑀 ≤ (𝐿 + 0) ↔ 𝑀 ≤ 𝐿))
19		nn0re 12451	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝑀 ∈ ℕ₀ → 𝑀 ∈ ℝ)
20	19	anim1i 615	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝐿 ∈ ℝ) → (𝑀 ∈ ℝ ∧ 𝐿 ∈ ℝ))
21	20	ancoms 458	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝐿 ∈ ℝ ∧ 𝑀 ∈ ℕ₀) → (𝑀 ∈ ℝ ∧ 𝐿 ∈ ℝ))
22		letri3 11259	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝑀 ∈ ℝ ∧ 𝐿 ∈ ℝ) → (𝑀 = 𝐿 ↔ (𝑀 ≤ 𝐿 ∧ 𝐿 ≤ 𝑀)))
23	21, 22	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝐿 ∈ ℝ ∧ 𝑀 ∈ ℕ₀) → (𝑀 = 𝐿 ↔ (𝑀 ≤ 𝐿 ∧ 𝐿 ≤ 𝑀)))
24	23	biimprd 248	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝐿 ∈ ℝ ∧ 𝑀 ∈ ℕ₀) → ((𝑀 ≤ 𝐿 ∧ 𝐿 ≤ 𝑀) → 𝑀 = 𝐿))
25	24	exp4b 430	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝐿 ∈ ℝ → (𝑀 ∈ ℕ₀ → (𝑀 ≤ 𝐿 → (𝐿 ≤ 𝑀 → 𝑀 = 𝐿))))
26	25	com23 86	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝐿 ∈ ℝ → (𝑀 ≤ 𝐿 → (𝑀 ∈ ℕ₀ → (𝐿 ≤ 𝑀 → 𝑀 = 𝐿))))
27	18, 26	sylbid 240	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝐿 ∈ ℝ → (𝑀 ≤ (𝐿 + 0) → (𝑀 ∈ ℕ₀ → (𝐿 ≤ 𝑀 → 𝑀 = 𝐿))))
28	27	com3l 89	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑀 ≤ (𝐿 + 0) → (𝑀 ∈ ℕ₀ → (𝐿 ∈ ℝ → (𝐿 ≤ 𝑀 → 𝑀 = 𝐿))))
29	28	impcom 407	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑀 ≤ (𝐿 + 0)) → (𝐿 ∈ ℝ → (𝐿 ≤ 𝑀 → 𝑀 = 𝐿)))
30	29	3adant2 1131	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑀 ∈ ℕ₀ ∧ (𝐿 + 0) ∈ ℕ₀ ∧ 𝑀 ≤ (𝐿 + 0)) → (𝐿 ∈ ℝ → (𝐿 ≤ 𝑀 → 𝑀 = 𝐿)))
31	30	com12 32	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐿 ∈ ℝ → ((𝑀 ∈ ℕ₀ ∧ (𝐿 + 0) ∈ ℕ₀ ∧ 𝑀 ≤ (𝐿 + 0)) → (𝐿 ≤ 𝑀 → 𝑀 = 𝐿)))
32	15, 31	biimtrid 242	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐿 ∈ ℝ → (𝑀 ∈ (0...(𝐿 + 0)) → (𝐿 ≤ 𝑀 → 𝑀 = 𝐿)))
33	14, 32	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝐿 ∈ ℕ₀ → (𝑀 ∈ (0...(𝐿 + 0)) → (𝐿 ≤ 𝑀 → 𝑀 = 𝐿)))
34	13, 33	sylbi 217	. . . . . . . . . . . . . . . 16 ⊢ ((♯‘𝐴) ∈ ℕ₀ → (𝑀 ∈ (0...(𝐿 + 0)) → (𝐿 ≤ 𝑀 → 𝑀 = 𝐿)))
35	10, 34	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ Word 𝑉 → (𝑀 ∈ (0...(𝐿 + 0)) → (𝐿 ≤ 𝑀 → 𝑀 = 𝐿)))
36	35	imp 406	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝑀 ∈ (0...(𝐿 + 0))) → (𝐿 ≤ 𝑀 → 𝑀 = 𝐿))
37		elfznn0 13581	. . . . . . . . . . . . . . . 16 ⊢ (𝑀 ∈ (0...(𝐿 + 0)) → 𝑀 ∈ ℕ₀)
38		swrd00 14609	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (∅ substr ⟨0, 0⟩) = ∅
39		swrd00 14609	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝐴 substr ⟨𝐿, 𝐿⟩) = ∅
40	38, 39	eqtr4i 2755	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (∅ substr ⟨0, 0⟩) = (𝐴 substr ⟨𝐿, 𝐿⟩)
41		nn0cn 12452	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝐿 ∈ ℕ₀ → 𝐿 ∈ ℂ)
42	41	subidd 11521	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝐿 ∈ ℕ₀ → (𝐿 − 𝐿) = 0)
43	42	opeq1d 4843	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝐿 ∈ ℕ₀ → ⟨(𝐿 − 𝐿), 0⟩ = ⟨0, 0⟩)
44	43	oveq2d 7403	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝐿 ∈ ℕ₀ → (∅ substr ⟨(𝐿 − 𝐿), 0⟩) = (∅ substr ⟨0, 0⟩))
45	41	addridd 11374	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝐿 ∈ ℕ₀ → (𝐿 + 0) = 𝐿)
46	45	opeq2d 4844	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝐿 ∈ ℕ₀ → ⟨𝐿, (𝐿 + 0)⟩ = ⟨𝐿, 𝐿⟩)
47	46	oveq2d 7403	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝐿 ∈ ℕ₀ → (𝐴 substr ⟨𝐿, (𝐿 + 0)⟩) = (𝐴 substr ⟨𝐿, 𝐿⟩))
48	40, 44, 47	3eqtr4a 2790	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐿 ∈ ℕ₀ → (∅ substr ⟨(𝐿 − 𝐿), 0⟩) = (𝐴 substr ⟨𝐿, (𝐿 + 0)⟩))
49	48	a1i 11	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑀 = 𝐿 → (𝐿 ∈ ℕ₀ → (∅ substr ⟨(𝐿 − 𝐿), 0⟩) = (𝐴 substr ⟨𝐿, (𝐿 + 0)⟩)))
50		eleq1 2816	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑀 = 𝐿 → (𝑀 ∈ ℕ₀ ↔ 𝐿 ∈ ℕ₀))
51		oveq1 7394	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑀 = 𝐿 → (𝑀 − 𝐿) = (𝐿 − 𝐿))
52	51	opeq1d 4843	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑀 = 𝐿 → ⟨(𝑀 − 𝐿), 0⟩ = ⟨(𝐿 − 𝐿), 0⟩)
53	52	oveq2d 7403	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑀 = 𝐿 → (∅ substr ⟨(𝑀 − 𝐿), 0⟩) = (∅ substr ⟨(𝐿 − 𝐿), 0⟩))
54		opeq1 4837	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑀 = 𝐿 → ⟨𝑀, (𝐿 + 0)⟩ = ⟨𝐿, (𝐿 + 0)⟩)
55	54	oveq2d 7403	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑀 = 𝐿 → (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩) = (𝐴 substr ⟨𝐿, (𝐿 + 0)⟩))
56	53, 55	eqeq12d 2745	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑀 = 𝐿 → ((∅ substr ⟨(𝑀 − 𝐿), 0⟩) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩) ↔ (∅ substr ⟨(𝐿 − 𝐿), 0⟩) = (𝐴 substr ⟨𝐿, (𝐿 + 0)⟩)))
57	49, 50, 56	3imtr4d 294	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑀 = 𝐿 → (𝑀 ∈ ℕ₀ → (∅ substr ⟨(𝑀 − 𝐿), 0⟩) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩)))
58	57	com12 32	. . . . . . . . . . . . . . . . 17 ⊢ (𝑀 ∈ ℕ₀ → (𝑀 = 𝐿 → (∅ substr ⟨(𝑀 − 𝐿), 0⟩) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩)))
59	58	a1d 25	. . . . . . . . . . . . . . . 16 ⊢ (𝑀 ∈ ℕ₀ → (𝐴 ∈ Word 𝑉 → (𝑀 = 𝐿 → (∅ substr ⟨(𝑀 − 𝐿), 0⟩) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩))))
60	37, 59	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝑀 ∈ (0...(𝐿 + 0)) → (𝐴 ∈ Word 𝑉 → (𝑀 = 𝐿 → (∅ substr ⟨(𝑀 − 𝐿), 0⟩) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩))))
61	60	impcom 407	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝑀 ∈ (0...(𝐿 + 0))) → (𝑀 = 𝐿 → (∅ substr ⟨(𝑀 − 𝐿), 0⟩) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩)))
62	36, 61	syld 47	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝑀 ∈ (0...(𝐿 + 0))) → (𝐿 ≤ 𝑀 → (∅ substr ⟨(𝑀 − 𝐿), 0⟩) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩)))
63	62	imp 406	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝑀 ∈ (0...(𝐿 + 0))) ∧ 𝐿 ≤ 𝑀) → (∅ substr ⟨(𝑀 − 𝐿), 0⟩) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩))
64		swrdcl 14610	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ∈ Word 𝑉 → (𝐴 substr ⟨𝑀, 𝐿⟩) ∈ Word 𝑉)
65		ccatrid 14552	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 substr ⟨𝑀, 𝐿⟩) ∈ Word 𝑉 → ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ ∅) = (𝐴 substr ⟨𝑀, 𝐿⟩))
66	64, 65	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ Word 𝑉 → ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ ∅) = (𝐴 substr ⟨𝑀, 𝐿⟩))
67	13, 41	sylbi 217	. . . . . . . . . . . . . . . . . . 19 ⊢ ((♯‘𝐴) ∈ ℕ₀ → 𝐿 ∈ ℂ)
68	10, 67	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐴 ∈ Word 𝑉 → 𝐿 ∈ ℂ)
69		addrid 11354	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐿 ∈ ℂ → (𝐿 + 0) = 𝐿)
70	69	eqcomd 2735	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐿 ∈ ℂ → 𝐿 = (𝐿 + 0))
71	68, 70	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝐴 ∈ Word 𝑉 → 𝐿 = (𝐿 + 0))
72	71	opeq2d 4844	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ∈ Word 𝑉 → ⟨𝑀, 𝐿⟩ = ⟨𝑀, (𝐿 + 0)⟩)
73	72	oveq2d 7403	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ Word 𝑉 → (𝐴 substr ⟨𝑀, 𝐿⟩) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩))
74	66, 73	eqtrd 2764	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ Word 𝑉 → ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ ∅) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩))
75	74	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝑀 ∈ (0...(𝐿 + 0))) → ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ ∅) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩))
76	75	adantr 480	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝑀 ∈ (0...(𝐿 + 0))) ∧ ¬ 𝐿 ≤ 𝑀) → ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ ∅) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩))
77	63, 76	ifeqda 4525	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝑀 ∈ (0...(𝐿 + 0))) → if(𝐿 ≤ 𝑀, (∅ substr ⟨(𝑀 − 𝐿), 0⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ ∅)) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩))
78	77	ex 412	. . . . . . . . . 10 ⊢ (𝐴 ∈ Word 𝑉 → (𝑀 ∈ (0...(𝐿 + 0)) → if(𝐿 ≤ 𝑀, (∅ substr ⟨(𝑀 − 𝐿), 0⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ ∅)) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩)))
79	78	ad3antrrr 730	. . . . . . . . 9 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (♯‘𝐵) = 0) ∧ 𝐵 = ∅) → (𝑀 ∈ (0...(𝐿 + 0)) → if(𝐿 ≤ 𝑀, (∅ substr ⟨(𝑀 − 𝐿), 0⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ ∅)) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩)))
80		oveq2 7395	. . . . . . . . . . . . . 14 ⊢ ((♯‘𝐵) = 0 → (𝐿 + (♯‘𝐵)) = (𝐿 + 0))
81	80	oveq2d 7403	. . . . . . . . . . . . 13 ⊢ ((♯‘𝐵) = 0 → (0...(𝐿 + (♯‘𝐵))) = (0...(𝐿 + 0)))
82	81	eleq2d 2814	. . . . . . . . . . . 12 ⊢ ((♯‘𝐵) = 0 → (𝑀 ∈ (0...(𝐿 + (♯‘𝐵))) ↔ 𝑀 ∈ (0...(𝐿 + 0))))
83	82	adantr 480	. . . . . . . . . . 11 ⊢ (((♯‘𝐵) = 0 ∧ 𝐵 = ∅) → (𝑀 ∈ (0...(𝐿 + (♯‘𝐵))) ↔ 𝑀 ∈ (0...(𝐿 + 0))))
84		simpr 484	. . . . . . . . . . . . . 14 ⊢ (((♯‘𝐵) = 0 ∧ 𝐵 = ∅) → 𝐵 = ∅)
85		opeq2 4838	. . . . . . . . . . . . . . 15 ⊢ ((♯‘𝐵) = 0 → ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩ = ⟨(𝑀 − 𝐿), 0⟩)
86	85	adantr 480	. . . . . . . . . . . . . 14 ⊢ (((♯‘𝐵) = 0 ∧ 𝐵 = ∅) → ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩ = ⟨(𝑀 − 𝐿), 0⟩)
87	84, 86	oveq12d 7405	. . . . . . . . . . . . 13 ⊢ (((♯‘𝐵) = 0 ∧ 𝐵 = ∅) → (𝐵 substr ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩) = (∅ substr ⟨(𝑀 − 𝐿), 0⟩))
88		oveq2 7395	. . . . . . . . . . . . . 14 ⊢ (𝐵 = ∅ → ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ 𝐵) = ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ ∅))
89	88	adantl 481	. . . . . . . . . . . . 13 ⊢ (((♯‘𝐵) = 0 ∧ 𝐵 = ∅) → ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ 𝐵) = ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ ∅))
90	87, 89	ifeq12d 4510	. . . . . . . . . . . 12 ⊢ (((♯‘𝐵) = 0 ∧ 𝐵 = ∅) → if(𝐿 ≤ 𝑀, (𝐵 substr ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ 𝐵)) = if(𝐿 ≤ 𝑀, (∅ substr ⟨(𝑀 − 𝐿), 0⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ ∅)))
91	80	opeq2d 4844	. . . . . . . . . . . . . 14 ⊢ ((♯‘𝐵) = 0 → ⟨𝑀, (𝐿 + (♯‘𝐵))⟩ = ⟨𝑀, (𝐿 + 0)⟩)
92	91	oveq2d 7403	. . . . . . . . . . . . 13 ⊢ ((♯‘𝐵) = 0 → (𝐴 substr ⟨𝑀, (𝐿 + (♯‘𝐵))⟩) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩))
93	92	adantr 480	. . . . . . . . . . . 12 ⊢ (((♯‘𝐵) = 0 ∧ 𝐵 = ∅) → (𝐴 substr ⟨𝑀, (𝐿 + (♯‘𝐵))⟩) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩))
94	90, 93	eqeq12d 2745	. . . . . . . . . . 11 ⊢ (((♯‘𝐵) = 0 ∧ 𝐵 = ∅) → (if(𝐿 ≤ 𝑀, (𝐵 substr ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ 𝐵)) = (𝐴 substr ⟨𝑀, (𝐿 + (♯‘𝐵))⟩) ↔ if(𝐿 ≤ 𝑀, (∅ substr ⟨(𝑀 − 𝐿), 0⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ ∅)) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩)))
95	83, 94	imbi12d 344	. . . . . . . . . 10 ⊢ (((♯‘𝐵) = 0 ∧ 𝐵 = ∅) → ((𝑀 ∈ (0...(𝐿 + (♯‘𝐵))) → if(𝐿 ≤ 𝑀, (𝐵 substr ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ 𝐵)) = (𝐴 substr ⟨𝑀, (𝐿 + (♯‘𝐵))⟩)) ↔ (𝑀 ∈ (0...(𝐿 + 0)) → if(𝐿 ≤ 𝑀, (∅ substr ⟨(𝑀 − 𝐿), 0⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ ∅)) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩))))
96	95	adantll 714	. . . . . . . . 9 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (♯‘𝐵) = 0) ∧ 𝐵 = ∅) → ((𝑀 ∈ (0...(𝐿 + (♯‘𝐵))) → if(𝐿 ≤ 𝑀, (𝐵 substr ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ 𝐵)) = (𝐴 substr ⟨𝑀, (𝐿 + (♯‘𝐵))⟩)) ↔ (𝑀 ∈ (0...(𝐿 + 0)) → if(𝐿 ≤ 𝑀, (∅ substr ⟨(𝑀 − 𝐿), 0⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ ∅)) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩))))
97	79, 96	mpbird 257	. . . . . . . 8 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (♯‘𝐵) = 0) ∧ 𝐵 = ∅) → (𝑀 ∈ (0...(𝐿 + (♯‘𝐵))) → if(𝐿 ≤ 𝑀, (𝐵 substr ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ 𝐵)) = (𝐴 substr ⟨𝑀, (𝐿 + (♯‘𝐵))⟩)))
98	9, 97	mpdan 687	. . . . . . 7 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (♯‘𝐵) = 0) → (𝑀 ∈ (0...(𝐿 + (♯‘𝐵))) → if(𝐿 ≤ 𝑀, (𝐵 substr ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ 𝐵)) = (𝐴 substr ⟨𝑀, (𝐿 + (♯‘𝐵))⟩)))
99	98	ex 412	. . . . . 6 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → ((♯‘𝐵) = 0 → (𝑀 ∈ (0...(𝐿 + (♯‘𝐵))) → if(𝐿 ≤ 𝑀, (𝐵 substr ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ 𝐵)) = (𝐴 substr ⟨𝑀, (𝐿 + (♯‘𝐵))⟩))))
100	5, 99	syld 47	. . . . 5 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → ((♯‘𝐵) ≤ 0 → (𝑀 ∈ (0...(𝐿 + (♯‘𝐵))) → if(𝐿 ≤ 𝑀, (𝐵 substr ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ 𝐵)) = (𝐴 substr ⟨𝑀, (𝐿 + (♯‘𝐵))⟩))))
101	100	com23 86	. . . 4 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → (𝑀 ∈ (0...(𝐿 + (♯‘𝐵))) → ((♯‘𝐵) ≤ 0 → if(𝐿 ≤ 𝑀, (𝐵 substr ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ 𝐵)) = (𝐴 substr ⟨𝑀, (𝐿 + (♯‘𝐵))⟩))))
102	101	imp 406	. . 3 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ 𝑀 ∈ (0...(𝐿 + (♯‘𝐵)))) → ((♯‘𝐵) ≤ 0 → if(𝐿 ≤ 𝑀, (𝐵 substr ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ 𝐵)) = (𝐴 substr ⟨𝑀, (𝐿 + (♯‘𝐵))⟩)))
103	102	adantr 480	. 2 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ 𝑀 ∈ (0...(𝐿 + (♯‘𝐵)))) ∧ (𝐿 + (♯‘𝐵)) ≤ 𝐿) → ((♯‘𝐵) ≤ 0 → if(𝐿 ≤ 𝑀, (𝐵 substr ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ 𝐵)) = (𝐴 substr ⟨𝑀, (𝐿 + (♯‘𝐵))⟩)))
104	11	eleq1i 2819	. . . . . . . 8 ⊢ (𝐿 ∈ ℕ₀ ↔ (♯‘𝐴) ∈ ℕ₀)
105	104, 14	sylbir 235	. . . . . . 7 ⊢ ((♯‘𝐴) ∈ ℕ₀ → 𝐿 ∈ ℝ)
106	10, 105	syl 17	. . . . . 6 ⊢ (𝐴 ∈ Word 𝑉 → 𝐿 ∈ ℝ)
107	1	nn0red 12504	. . . . . 6 ⊢ (𝐵 ∈ Word 𝑉 → (♯‘𝐵) ∈ ℝ)
108		leaddle0 11693	. . . . . 6 ⊢ ((𝐿 ∈ ℝ ∧ (♯‘𝐵) ∈ ℝ) → ((𝐿 + (♯‘𝐵)) ≤ 𝐿 ↔ (♯‘𝐵) ≤ 0))
109	106, 107, 108	syl2an 596	. . . . 5 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → ((𝐿 + (♯‘𝐵)) ≤ 𝐿 ↔ (♯‘𝐵) ≤ 0))
110		pm2.24 124	. . . . 5 ⊢ ((♯‘𝐵) ≤ 0 → (¬ (♯‘𝐵) ≤ 0 → if(𝐿 ≤ 𝑀, (𝐵 substr ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ 𝐵)) = (𝐴 substr ⟨𝑀, (𝐿 + (♯‘𝐵))⟩)))
111	109, 110	biimtrdi 253	. . . 4 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → ((𝐿 + (♯‘𝐵)) ≤ 𝐿 → (¬ (♯‘𝐵) ≤ 0 → if(𝐿 ≤ 𝑀, (𝐵 substr ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ 𝐵)) = (𝐴 substr ⟨𝑀, (𝐿 + (♯‘𝐵))⟩))))
112	111	adantr 480	. . 3 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ 𝑀 ∈ (0...(𝐿 + (♯‘𝐵)))) → ((𝐿 + (♯‘𝐵)) ≤ 𝐿 → (¬ (♯‘𝐵) ≤ 0 → if(𝐿 ≤ 𝑀, (𝐵 substr ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ 𝐵)) = (𝐴 substr ⟨𝑀, (𝐿 + (♯‘𝐵))⟩))))
113	112	imp 406	. 2 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ 𝑀 ∈ (0...(𝐿 + (♯‘𝐵)))) ∧ (𝐿 + (♯‘𝐵)) ≤ 𝐿) → (¬ (♯‘𝐵) ≤ 0 → if(𝐿 ≤ 𝑀, (𝐵 substr ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ 𝐵)) = (𝐴 substr ⟨𝑀, (𝐿 + (♯‘𝐵))⟩)))
114	103, 113	pm2.61d 179	1 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ 𝑀 ∈ (0...(𝐿 + (♯‘𝐵)))) ∧ (𝐿 + (♯‘𝐵)) ≤ 𝐿) → if(𝐿 ≤ 𝑀, (𝐵 substr ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ 𝐵)) = (𝐴 substr ⟨𝑀, (𝐿 + (♯‘𝐵))⟩))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ∅c0 4296 ifcif 4488 ⟨cop 4595 class class class wbr 5107 ‘cfv 6511 (class class class)co 7387 ℂcc 11066 ℝcr 11067 0cc0 11068 + caddc 11071 ≤ cle 11209 − cmin 11405 ℕ₀cn0 12442 ...cfz 13468 ♯chash 14295 Word cword 14478 ++ cconcat 14535 substr csubstr 14605

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 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5234 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-int 4911 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-om 7843 df-1st 7968 df-2nd 7969 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-1o 8434 df-er 8671 df-en 8919 df-dom 8920 df-sdom 8921 df-fin 8922 df-card 9892 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 df-sub 11407 df-neg 11408 df-nn 12187 df-n0 12443 df-z 12530 df-uz 12794 df-fz 13469 df-fzo 13616 df-hash 14296 df-word 14479 df-concat 14536 df-substr 14606

This theorem is referenced by: swrdccat3b 14705

W3C validator