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 14691

Description: Lemma for swrdccat3b 14692. (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 14485	. . . . . . . 8 ⊢ (𝐵 ∈ Word 𝑉 → (♯‘𝐵) ∈ ℕ₀)
2		nn0le0eq0 12502	. . . . . . . . 9 ⊢ ((♯‘𝐵) ∈ ℕ₀ → ((♯‘𝐵) ≤ 0 ↔ (♯‘𝐵) = 0))
3	2	biimpd 228	. . . . . . . 8 ⊢ ((♯‘𝐵) ∈ ℕ₀ → ((♯‘𝐵) ≤ 0 → (♯‘𝐵) = 0))
4	1, 3	syl 17	. . . . . . 7 ⊢ (𝐵 ∈ Word 𝑉 → ((♯‘𝐵) ≤ 0 → (♯‘𝐵) = 0))
5	4	adantl 482	. . . . . 6 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → ((♯‘𝐵) ≤ 0 → (♯‘𝐵) = 0))
6		hasheq0 14325	. . . . . . . . . . 11 ⊢ (𝐵 ∈ Word 𝑉 → ((♯‘𝐵) = 0 ↔ 𝐵 = ∅))
7	6	biimpd 228	. . . . . . . . . 10 ⊢ (𝐵 ∈ Word 𝑉 → ((♯‘𝐵) = 0 → 𝐵 = ∅))
8	7	adantl 482	. . . . . . . . 9 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → ((♯‘𝐵) = 0 → 𝐵 = ∅))
9	8	imp 407	. . . . . . . 8 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (♯‘𝐵) = 0) → 𝐵 = ∅)
10		lencl 14485	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ∈ Word 𝑉 → (♯‘𝐴) ∈ ℕ₀)
11		swrdccatin2.l	. . . . . . . . . . . . . . . . . . 19 ⊢ 𝐿 = (♯‘𝐴)
12	11	eqcomi 2741	. . . . . . . . . . . . . . . . . 18 ⊢ (♯‘𝐴) = 𝐿
13	12	eleq1i 2824	. . . . . . . . . . . . . . . . 17 ⊢ ((♯‘𝐴) ∈ ℕ₀ ↔ 𝐿 ∈ ℕ₀)
14		nn0re 12483	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐿 ∈ ℕ₀ → 𝐿 ∈ ℝ)
15		elfz2nn0 13594	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑀 ∈ (0...(𝐿 + 0)) ↔ (𝑀 ∈ ℕ₀ ∧ (𝐿 + 0) ∈ ℕ₀ ∧ 𝑀 ≤ (𝐿 + 0)))
16		recn 11202	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝐿 ∈ ℝ → 𝐿 ∈ ℂ)
17	16	addridd 11416	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝐿 ∈ ℝ → (𝐿 + 0) = 𝐿)
18	17	breq2d 5160	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝐿 ∈ ℝ → (𝑀 ≤ (𝐿 + 0) ↔ 𝑀 ≤ 𝐿))
19		nn0re 12483	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝑀 ∈ ℕ₀ → 𝑀 ∈ ℝ)
20	19	anim1i 615	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝐿 ∈ ℝ) → (𝑀 ∈ ℝ ∧ 𝐿 ∈ ℝ))
21	20	ancoms 459	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝐿 ∈ ℝ ∧ 𝑀 ∈ ℕ₀) → (𝑀 ∈ ℝ ∧ 𝐿 ∈ ℝ))
22		letri3 11301	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝑀 ∈ ℝ ∧ 𝐿 ∈ ℝ) → (𝑀 = 𝐿 ↔ (𝑀 ≤ 𝐿 ∧ 𝐿 ≤ 𝑀)))
23	21, 22	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝐿 ∈ ℝ ∧ 𝑀 ∈ ℕ₀) → (𝑀 = 𝐿 ↔ (𝑀 ≤ 𝐿 ∧ 𝐿 ≤ 𝑀)))
24	23	biimprd 247	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝐿 ∈ ℝ ∧ 𝑀 ∈ ℕ₀) → ((𝑀 ≤ 𝐿 ∧ 𝐿 ≤ 𝑀) → 𝑀 = 𝐿))
25	24	exp4b 431	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝐿 ∈ ℝ → (𝑀 ∈ ℕ₀ → (𝑀 ≤ 𝐿 → (𝐿 ≤ 𝑀 → 𝑀 = 𝐿))))
26	25	com23 86	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝐿 ∈ ℝ → (𝑀 ≤ 𝐿 → (𝑀 ∈ ℕ₀ → (𝐿 ≤ 𝑀 → 𝑀 = 𝐿))))
27	18, 26	sylbid 239	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝐿 ∈ ℝ → (𝑀 ≤ (𝐿 + 0) → (𝑀 ∈ ℕ₀ → (𝐿 ≤ 𝑀 → 𝑀 = 𝐿))))
28	27	com3l 89	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑀 ≤ (𝐿 + 0) → (𝑀 ∈ ℕ₀ → (𝐿 ∈ ℝ → (𝐿 ≤ 𝑀 → 𝑀 = 𝐿))))
29	28	impcom 408	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑀 ≤ (𝐿 + 0)) → (𝐿 ∈ ℝ → (𝐿 ≤ 𝑀 → 𝑀 = 𝐿)))
30	29	3adant2 1131	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑀 ∈ ℕ₀ ∧ (𝐿 + 0) ∈ ℕ₀ ∧ 𝑀 ≤ (𝐿 + 0)) → (𝐿 ∈ ℝ → (𝐿 ≤ 𝑀 → 𝑀 = 𝐿)))
31	30	com12 32	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐿 ∈ ℝ → ((𝑀 ∈ ℕ₀ ∧ (𝐿 + 0) ∈ ℕ₀ ∧ 𝑀 ≤ (𝐿 + 0)) → (𝐿 ≤ 𝑀 → 𝑀 = 𝐿)))
32	15, 31	biimtrid 241	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐿 ∈ ℝ → (𝑀 ∈ (0...(𝐿 + 0)) → (𝐿 ≤ 𝑀 → 𝑀 = 𝐿)))
33	14, 32	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝐿 ∈ ℕ₀ → (𝑀 ∈ (0...(𝐿 + 0)) → (𝐿 ≤ 𝑀 → 𝑀 = 𝐿)))
34	13, 33	sylbi 216	. . . . . . . . . . . . . . . 16 ⊢ ((♯‘𝐴) ∈ ℕ₀ → (𝑀 ∈ (0...(𝐿 + 0)) → (𝐿 ≤ 𝑀 → 𝑀 = 𝐿)))
35	10, 34	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ Word 𝑉 → (𝑀 ∈ (0...(𝐿 + 0)) → (𝐿 ≤ 𝑀 → 𝑀 = 𝐿)))
36	35	imp 407	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝑀 ∈ (0...(𝐿 + 0))) → (𝐿 ≤ 𝑀 → 𝑀 = 𝐿))
37		elfznn0 13596	. . . . . . . . . . . . . . . 16 ⊢ (𝑀 ∈ (0...(𝐿 + 0)) → 𝑀 ∈ ℕ₀)
38		swrd00 14596	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (∅ substr ⟨0, 0⟩) = ∅
39		swrd00 14596	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝐴 substr ⟨𝐿, 𝐿⟩) = ∅
40	38, 39	eqtr4i 2763	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (∅ substr ⟨0, 0⟩) = (𝐴 substr ⟨𝐿, 𝐿⟩)
41		nn0cn 12484	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝐿 ∈ ℕ₀ → 𝐿 ∈ ℂ)
42	41	subidd 11561	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝐿 ∈ ℕ₀ → (𝐿 − 𝐿) = 0)
43	42	opeq1d 4879	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝐿 ∈ ℕ₀ → ⟨(𝐿 − 𝐿), 0⟩ = ⟨0, 0⟩)
44	43	oveq2d 7427	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝐿 ∈ ℕ₀ → (∅ substr ⟨(𝐿 − 𝐿), 0⟩) = (∅ substr ⟨0, 0⟩))
45	41	addridd 11416	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝐿 ∈ ℕ₀ → (𝐿 + 0) = 𝐿)
46	45	opeq2d 4880	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝐿 ∈ ℕ₀ → ⟨𝐿, (𝐿 + 0)⟩ = ⟨𝐿, 𝐿⟩)
47	46	oveq2d 7427	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝐿 ∈ ℕ₀ → (𝐴 substr ⟨𝐿, (𝐿 + 0)⟩) = (𝐴 substr ⟨𝐿, 𝐿⟩))
48	40, 44, 47	3eqtr4a 2798	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐿 ∈ ℕ₀ → (∅ substr ⟨(𝐿 − 𝐿), 0⟩) = (𝐴 substr ⟨𝐿, (𝐿 + 0)⟩))
49	48	a1i 11	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑀 = 𝐿 → (𝐿 ∈ ℕ₀ → (∅ substr ⟨(𝐿 − 𝐿), 0⟩) = (𝐴 substr ⟨𝐿, (𝐿 + 0)⟩)))
50		eleq1 2821	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑀 = 𝐿 → (𝑀 ∈ ℕ₀ ↔ 𝐿 ∈ ℕ₀))
51		oveq1 7418	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑀 = 𝐿 → (𝑀 − 𝐿) = (𝐿 − 𝐿))
52	51	opeq1d 4879	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑀 = 𝐿 → ⟨(𝑀 − 𝐿), 0⟩ = ⟨(𝐿 − 𝐿), 0⟩)
53	52	oveq2d 7427	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑀 = 𝐿 → (∅ substr ⟨(𝑀 − 𝐿), 0⟩) = (∅ substr ⟨(𝐿 − 𝐿), 0⟩))
54		opeq1 4873	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑀 = 𝐿 → ⟨𝑀, (𝐿 + 0)⟩ = ⟨𝐿, (𝐿 + 0)⟩)
55	54	oveq2d 7427	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑀 = 𝐿 → (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩) = (𝐴 substr ⟨𝐿, (𝐿 + 0)⟩))
56	53, 55	eqeq12d 2748	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑀 = 𝐿 → ((∅ substr ⟨(𝑀 − 𝐿), 0⟩) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩) ↔ (∅ substr ⟨(𝐿 − 𝐿), 0⟩) = (𝐴 substr ⟨𝐿, (𝐿 + 0)⟩)))
57	49, 50, 56	3imtr4d 293	. . . . . . . . . . . . . . . . . 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 408	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝑀 ∈ (0...(𝐿 + 0))) → (𝑀 = 𝐿 → (∅ substr ⟨(𝑀 − 𝐿), 0⟩) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩)))
62	36, 61	syld 47	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝑀 ∈ (0...(𝐿 + 0))) → (𝐿 ≤ 𝑀 → (∅ substr ⟨(𝑀 − 𝐿), 0⟩) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩)))
63	62	imp 407	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝑀 ∈ (0...(𝐿 + 0))) ∧ 𝐿 ≤ 𝑀) → (∅ substr ⟨(𝑀 − 𝐿), 0⟩) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩))
64		swrdcl 14597	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ∈ Word 𝑉 → (𝐴 substr ⟨𝑀, 𝐿⟩) ∈ Word 𝑉)
65		ccatrid 14539	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 substr ⟨𝑀, 𝐿⟩) ∈ Word 𝑉 → ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ ∅) = (𝐴 substr ⟨𝑀, 𝐿⟩))
66	64, 65	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ Word 𝑉 → ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ ∅) = (𝐴 substr ⟨𝑀, 𝐿⟩))
67	13, 41	sylbi 216	. . . . . . . . . . . . . . . . . . 19 ⊢ ((♯‘𝐴) ∈ ℕ₀ → 𝐿 ∈ ℂ)
68	10, 67	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐴 ∈ Word 𝑉 → 𝐿 ∈ ℂ)
69		addrid 11396	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐿 ∈ ℂ → (𝐿 + 0) = 𝐿)
70	69	eqcomd 2738	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐿 ∈ ℂ → 𝐿 = (𝐿 + 0))
71	68, 70	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝐴 ∈ Word 𝑉 → 𝐿 = (𝐿 + 0))
72	71	opeq2d 4880	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ∈ Word 𝑉 → ⟨𝑀, 𝐿⟩ = ⟨𝑀, (𝐿 + 0)⟩)
73	72	oveq2d 7427	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ Word 𝑉 → (𝐴 substr ⟨𝑀, 𝐿⟩) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩))
74	66, 73	eqtrd 2772	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ Word 𝑉 → ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ ∅) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩))
75	74	adantr 481	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝑀 ∈ (0...(𝐿 + 0))) → ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ ∅) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩))
76	75	adantr 481	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝑀 ∈ (0...(𝐿 + 0))) ∧ ¬ 𝐿 ≤ 𝑀) → ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ ∅) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩))
77	63, 76	ifeqda 4564	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝑀 ∈ (0...(𝐿 + 0))) → if(𝐿 ≤ 𝑀, (∅ substr ⟨(𝑀 − 𝐿), 0⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ ∅)) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩))
78	77	ex 413	. . . . . . . . . 10 ⊢ (𝐴 ∈ Word 𝑉 → (𝑀 ∈ (0...(𝐿 + 0)) → if(𝐿 ≤ 𝑀, (∅ substr ⟨(𝑀 − 𝐿), 0⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ ∅)) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩)))
79	78	ad3antrrr 728	. . . . . . . . 9 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (♯‘𝐵) = 0) ∧ 𝐵 = ∅) → (𝑀 ∈ (0...(𝐿 + 0)) → if(𝐿 ≤ 𝑀, (∅ substr ⟨(𝑀 − 𝐿), 0⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ ∅)) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩)))
80		oveq2 7419	. . . . . . . . . . . . . 14 ⊢ ((♯‘𝐵) = 0 → (𝐿 + (♯‘𝐵)) = (𝐿 + 0))
81	80	oveq2d 7427	. . . . . . . . . . . . 13 ⊢ ((♯‘𝐵) = 0 → (0...(𝐿 + (♯‘𝐵))) = (0...(𝐿 + 0)))
82	81	eleq2d 2819	. . . . . . . . . . . 12 ⊢ ((♯‘𝐵) = 0 → (𝑀 ∈ (0...(𝐿 + (♯‘𝐵))) ↔ 𝑀 ∈ (0...(𝐿 + 0))))
83	82	adantr 481	. . . . . . . . . . 11 ⊢ (((♯‘𝐵) = 0 ∧ 𝐵 = ∅) → (𝑀 ∈ (0...(𝐿 + (♯‘𝐵))) ↔ 𝑀 ∈ (0...(𝐿 + 0))))
84		simpr 485	. . . . . . . . . . . . . 14 ⊢ (((♯‘𝐵) = 0 ∧ 𝐵 = ∅) → 𝐵 = ∅)
85		opeq2 4874	. . . . . . . . . . . . . . 15 ⊢ ((♯‘𝐵) = 0 → ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩ = ⟨(𝑀 − 𝐿), 0⟩)
86	85	adantr 481	. . . . . . . . . . . . . 14 ⊢ (((♯‘𝐵) = 0 ∧ 𝐵 = ∅) → ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩ = ⟨(𝑀 − 𝐿), 0⟩)
87	84, 86	oveq12d 7429	. . . . . . . . . . . . 13 ⊢ (((♯‘𝐵) = 0 ∧ 𝐵 = ∅) → (𝐵 substr ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩) = (∅ substr ⟨(𝑀 − 𝐿), 0⟩))
88		oveq2 7419	. . . . . . . . . . . . . 14 ⊢ (𝐵 = ∅ → ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ 𝐵) = ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ ∅))
89	88	adantl 482	. . . . . . . . . . . . 13 ⊢ (((♯‘𝐵) = 0 ∧ 𝐵 = ∅) → ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ 𝐵) = ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ ∅))
90	87, 89	ifeq12d 4549	. . . . . . . . . . . 12 ⊢ (((♯‘𝐵) = 0 ∧ 𝐵 = ∅) → if(𝐿 ≤ 𝑀, (𝐵 substr ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ 𝐵)) = if(𝐿 ≤ 𝑀, (∅ substr ⟨(𝑀 − 𝐿), 0⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ ∅)))
91	80	opeq2d 4880	. . . . . . . . . . . . . 14 ⊢ ((♯‘𝐵) = 0 → ⟨𝑀, (𝐿 + (♯‘𝐵))⟩ = ⟨𝑀, (𝐿 + 0)⟩)
92	91	oveq2d 7427	. . . . . . . . . . . . 13 ⊢ ((♯‘𝐵) = 0 → (𝐴 substr ⟨𝑀, (𝐿 + (♯‘𝐵))⟩) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩))
93	92	adantr 481	. . . . . . . . . . . 12 ⊢ (((♯‘𝐵) = 0 ∧ 𝐵 = ∅) → (𝐴 substr ⟨𝑀, (𝐿 + (♯‘𝐵))⟩) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩))
94	90, 93	eqeq12d 2748	. . . . . . . . . . 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 712	. . . . . . . . 9 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (♯‘𝐵) = 0) ∧ 𝐵 = ∅) → ((𝑀 ∈ (0...(𝐿 + (♯‘𝐵))) → if(𝐿 ≤ 𝑀, (𝐵 substr ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ 𝐵)) = (𝐴 substr ⟨𝑀, (𝐿 + (♯‘𝐵))⟩)) ↔ (𝑀 ∈ (0...(𝐿 + 0)) → if(𝐿 ≤ 𝑀, (∅ substr ⟨(𝑀 − 𝐿), 0⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ ∅)) = (𝐴 substr ⟨𝑀, (𝐿 + 0)⟩))))
97	79, 96	mpbird 256	. . . . . . . 8 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (♯‘𝐵) = 0) ∧ 𝐵 = ∅) → (𝑀 ∈ (0...(𝐿 + (♯‘𝐵))) → if(𝐿 ≤ 𝑀, (𝐵 substr ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ 𝐵)) = (𝐴 substr ⟨𝑀, (𝐿 + (♯‘𝐵))⟩)))
98	9, 97	mpdan 685	. . . . . . 7 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (♯‘𝐵) = 0) → (𝑀 ∈ (0...(𝐿 + (♯‘𝐵))) → if(𝐿 ≤ 𝑀, (𝐵 substr ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ 𝐵)) = (𝐴 substr ⟨𝑀, (𝐿 + (♯‘𝐵))⟩)))
99	98	ex 413	. . . . . 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 407	. . 3 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ 𝑀 ∈ (0...(𝐿 + (♯‘𝐵)))) → ((♯‘𝐵) ≤ 0 → if(𝐿 ≤ 𝑀, (𝐵 substr ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ 𝐵)) = (𝐴 substr ⟨𝑀, (𝐿 + (♯‘𝐵))⟩)))
103	102	adantr 481	. 2 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ 𝑀 ∈ (0...(𝐿 + (♯‘𝐵)))) ∧ (𝐿 + (♯‘𝐵)) ≤ 𝐿) → ((♯‘𝐵) ≤ 0 → if(𝐿 ≤ 𝑀, (𝐵 substr ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ 𝐵)) = (𝐴 substr ⟨𝑀, (𝐿 + (♯‘𝐵))⟩)))
104	11	eleq1i 2824	. . . . . . . 8 ⊢ (𝐿 ∈ ℕ₀ ↔ (♯‘𝐴) ∈ ℕ₀)
105	104, 14	sylbir 234	. . . . . . 7 ⊢ ((♯‘𝐴) ∈ ℕ₀ → 𝐿 ∈ ℝ)
106	10, 105	syl 17	. . . . . 6 ⊢ (𝐴 ∈ Word 𝑉 → 𝐿 ∈ ℝ)
107	1	nn0red 12535	. . . . . 6 ⊢ (𝐵 ∈ Word 𝑉 → (♯‘𝐵) ∈ ℝ)
108		leaddle0 11731	. . . . . 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	syl6bi 252	. . . 4 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → ((𝐿 + (♯‘𝐵)) ≤ 𝐿 → (¬ (♯‘𝐵) ≤ 0 → if(𝐿 ≤ 𝑀, (𝐵 substr ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ 𝐵)) = (𝐴 substr ⟨𝑀, (𝐿 + (♯‘𝐵))⟩))))
112	111	adantr 481	. . 3 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ 𝑀 ∈ (0...(𝐿 + (♯‘𝐵)))) → ((𝐿 + (♯‘𝐵)) ≤ 𝐿 → (¬ (♯‘𝐵) ≤ 0 → if(𝐿 ≤ 𝑀, (𝐵 substr ⟨(𝑀 − 𝐿), (♯‘𝐵)⟩), ((𝐴 substr ⟨𝑀, 𝐿⟩) ++ 𝐵)) = (𝐴 substr ⟨𝑀, (𝐿 + (♯‘𝐵))⟩))))
113	112	imp 407	. 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 205 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ∅c0 4322 ifcif 4528 ⟨cop 4634 class class class wbr 5148 ‘cfv 6543 (class class class)co 7411 ℂcc 11110 ℝcr 11111 0cc0 11112 + caddc 11115 ≤ cle 11251 − cmin 11446 ℕ₀cn0 12474 ...cfz 13486 ♯chash 14292 Word cword 14466 ++ cconcat 14522 substr csubstr 14592

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7727 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-int 4951 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7367 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7858 df-1st 7977 df-2nd 7978 df-frecs 8268 df-wrecs 8299 df-recs 8373 df-rdg 8412 df-1o 8468 df-er 8705 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-card 9936 df-pnf 11252 df-mnf 11253 df-xr 11254 df-ltxr 11255 df-le 11256 df-sub 11448 df-neg 11449 df-nn 12215 df-n0 12475 df-z 12561 df-uz 12825 df-fz 13487 df-fzo 13630 df-hash 14293 df-word 14467 df-concat 14523 df-substr 14593

This theorem is referenced by: swrdccat3b 14692

W3C validator