swrdspsleq - Metamath Proof Explorer

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

Theorem swrdspsleq 14306

Description: Two words have a common subword (starting at the same position with the same length) iff they have the same symbols at each position. (Contributed by Alexander van der Vekens, 7-Aug-2018.) (Proof shortened by AV, 7-May-2020.)

**Assertion**
Ref	Expression
swrdspsleq	⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) → ((𝑊 substr ⟨𝑀, 𝑁⟩) = (𝑈 substr ⟨𝑀, 𝑁⟩) ↔ ∀𝑖 ∈ (𝑀..^𝑁)(𝑊‘𝑖) = (𝑈‘𝑖)))

Distinct variable groups: 𝑖,𝑀 𝑖,𝑁 𝑈,𝑖 𝑖,𝑉 𝑖,𝑊

Proof of Theorem swrdspsleq Dummy variable 𝑗 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		swrdsb0eq 14304	. . . . . 6 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ 𝑁 ≤ 𝑀) → (𝑊 substr ⟨𝑀, 𝑁⟩) = (𝑈 substr ⟨𝑀, 𝑁⟩))
2	1	3expa 1116	. . . . 5 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀)) ∧ 𝑁 ≤ 𝑀) → (𝑊 substr ⟨𝑀, 𝑁⟩) = (𝑈 substr ⟨𝑀, 𝑁⟩))
3	2	ancoms 458	. . . 4 ⊢ ((𝑁 ≤ 𝑀 ∧ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀))) → (𝑊 substr ⟨𝑀, 𝑁⟩) = (𝑈 substr ⟨𝑀, 𝑁⟩))
4	3	3adantr3 1169	. . 3 ⊢ ((𝑁 ≤ 𝑀 ∧ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈)))) → (𝑊 substr ⟨𝑀, 𝑁⟩) = (𝑈 substr ⟨𝑀, 𝑁⟩))
5		ral0 4440	. . . . . . 7 ⊢ ∀𝑖 ∈ ∅ (𝑊‘𝑖) = (𝑈‘𝑖)
6		nn0z 12273	. . . . . . . . . 10 ⊢ (𝑀 ∈ ℕ₀ → 𝑀 ∈ ℤ)
7		nn0z 12273	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ₀ → 𝑁 ∈ ℤ)
8		fzon 13336	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 ≤ 𝑀 ↔ (𝑀..^𝑁) = ∅))
9	6, 7, 8	syl2an 595	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (𝑁 ≤ 𝑀 ↔ (𝑀..^𝑁) = ∅))
10	9	biimpa 476	. . . . . . . 8 ⊢ (((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ 𝑁 ≤ 𝑀) → (𝑀..^𝑁) = ∅)
11	10	raleqdv 3339	. . . . . . 7 ⊢ (((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ 𝑁 ≤ 𝑀) → (∀𝑖 ∈ (𝑀..^𝑁)(𝑊‘𝑖) = (𝑈‘𝑖) ↔ ∀𝑖 ∈ ∅ (𝑊‘𝑖) = (𝑈‘𝑖)))
12	5, 11	mpbiri 257	. . . . . 6 ⊢ (((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ 𝑁 ≤ 𝑀) → ∀𝑖 ∈ (𝑀..^𝑁)(𝑊‘𝑖) = (𝑈‘𝑖))
13	12	ex 412	. . . . 5 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (𝑁 ≤ 𝑀 → ∀𝑖 ∈ (𝑀..^𝑁)(𝑊‘𝑖) = (𝑈‘𝑖)))
14	13	3ad2ant2 1132	. . . 4 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) → (𝑁 ≤ 𝑀 → ∀𝑖 ∈ (𝑀..^𝑁)(𝑊‘𝑖) = (𝑈‘𝑖)))
15	14	impcom 407	. . 3 ⊢ ((𝑁 ≤ 𝑀 ∧ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈)))) → ∀𝑖 ∈ (𝑀..^𝑁)(𝑊‘𝑖) = (𝑈‘𝑖))
16	4, 15	2thd 264	. 2 ⊢ ((𝑁 ≤ 𝑀 ∧ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈)))) → ((𝑊 substr ⟨𝑀, 𝑁⟩) = (𝑈 substr ⟨𝑀, 𝑁⟩) ↔ ∀𝑖 ∈ (𝑀..^𝑁)(𝑊‘𝑖) = (𝑈‘𝑖)))
17		swrdcl 14286	. . . . . 6 ⊢ (𝑊 ∈ Word 𝑉 → (𝑊 substr ⟨𝑀, 𝑁⟩) ∈ Word 𝑉)
18		swrdcl 14286	. . . . . 6 ⊢ (𝑈 ∈ Word 𝑉 → (𝑈 substr ⟨𝑀, 𝑁⟩) ∈ Word 𝑉)
19		eqwrd 14188	. . . . . 6 ⊢ (((𝑊 substr ⟨𝑀, 𝑁⟩) ∈ Word 𝑉 ∧ (𝑈 substr ⟨𝑀, 𝑁⟩) ∈ Word 𝑉) → ((𝑊 substr ⟨𝑀, 𝑁⟩) = (𝑈 substr ⟨𝑀, 𝑁⟩) ↔ ((♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)) = (♯‘(𝑈 substr ⟨𝑀, 𝑁⟩)) ∧ ∀𝑗 ∈ (0..^(♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)))((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗))))
20	17, 18, 19	syl2an 595	. . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) → ((𝑊 substr ⟨𝑀, 𝑁⟩) = (𝑈 substr ⟨𝑀, 𝑁⟩) ↔ ((♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)) = (♯‘(𝑈 substr ⟨𝑀, 𝑁⟩)) ∧ ∀𝑗 ∈ (0..^(♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)))((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗))))
21	20	3ad2ant1 1131	. . . 4 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) → ((𝑊 substr ⟨𝑀, 𝑁⟩) = (𝑈 substr ⟨𝑀, 𝑁⟩) ↔ ((♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)) = (♯‘(𝑈 substr ⟨𝑀, 𝑁⟩)) ∧ ∀𝑗 ∈ (0..^(♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)))((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗))))
22	21	adantl 481	. . 3 ⊢ ((¬ 𝑁 ≤ 𝑀 ∧ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈)))) → ((𝑊 substr ⟨𝑀, 𝑁⟩) = (𝑈 substr ⟨𝑀, 𝑁⟩) ↔ ((♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)) = (♯‘(𝑈 substr ⟨𝑀, 𝑁⟩)) ∧ ∀𝑗 ∈ (0..^(♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)))((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗))))
23		swrdsbslen 14305	. . . . 5 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) → (♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)) = (♯‘(𝑈 substr ⟨𝑀, 𝑁⟩)))
24	23	adantl 481	. . . 4 ⊢ ((¬ 𝑁 ≤ 𝑀 ∧ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈)))) → (♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)) = (♯‘(𝑈 substr ⟨𝑀, 𝑁⟩)))
25	24	biantrurd 532	. . 3 ⊢ ((¬ 𝑁 ≤ 𝑀 ∧ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈)))) → (∀𝑗 ∈ (0..^(♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)))((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ((♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)) = (♯‘(𝑈 substr ⟨𝑀, 𝑁⟩)) ∧ ∀𝑗 ∈ (0..^(♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)))((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗))))
26		nn0re 12172	. . . . . . 7 ⊢ (𝑀 ∈ ℕ₀ → 𝑀 ∈ ℝ)
27		nn0re 12172	. . . . . . 7 ⊢ (𝑁 ∈ ℕ₀ → 𝑁 ∈ ℝ)
28		ltnle 10985	. . . . . . . 8 ⊢ ((𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (𝑀 < 𝑁 ↔ ¬ 𝑁 ≤ 𝑀))
29		ltle 10994	. . . . . . . 8 ⊢ ((𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (𝑀 < 𝑁 → 𝑀 ≤ 𝑁))
30	28, 29	sylbird 259	. . . . . . 7 ⊢ ((𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (¬ 𝑁 ≤ 𝑀 → 𝑀 ≤ 𝑁))
31	26, 27, 30	syl2an 595	. . . . . 6 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (¬ 𝑁 ≤ 𝑀 → 𝑀 ≤ 𝑁))
32	31	3ad2ant2 1132	. . . . 5 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) → (¬ 𝑁 ≤ 𝑀 → 𝑀 ≤ 𝑁))
33		simpl1l 1222	. . . . . . . . . 10 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → 𝑊 ∈ Word 𝑉)
34		simpl2l 1224	. . . . . . . . . . 11 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → 𝑀 ∈ ℕ₀)
35	6, 7	anim12i 612	. . . . . . . . . . . . . . 15 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ))
36	35	3ad2ant2 1132	. . . . . . . . . . . . . 14 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) → (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ))
37	36	anim1i 614	. . . . . . . . . . . . 13 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑀 ≤ 𝑁))
38		df-3an 1087	. . . . . . . . . . . . 13 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁) ↔ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑀 ≤ 𝑁))
39	37, 38	sylibr 233	. . . . . . . . . . . 12 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁))
40		eluz2 12517	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) ↔ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁))
41	39, 40	sylibr 233	. . . . . . . . . . 11 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → 𝑁 ∈ (ℤ_≥‘𝑀))
42	34, 41	jca 511	. . . . . . . . . 10 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ (ℤ_≥‘𝑀)))
43		simpl3l 1226	. . . . . . . . . 10 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → 𝑁 ≤ (♯‘𝑊))
44		swrdlen2 14301	. . . . . . . . . 10 ⊢ ((𝑊 ∈ Word 𝑉 ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ (ℤ_≥‘𝑀)) ∧ 𝑁 ≤ (♯‘𝑊)) → (♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)) = (𝑁 − 𝑀))
45	33, 42, 43, 44	syl3anc 1369	. . . . . . . . 9 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → (♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)) = (𝑁 − 𝑀))
46	45	oveq2d 7271	. . . . . . . 8 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → (0..^(♯‘(𝑊 substr ⟨𝑀, 𝑁⟩))) = (0..^(𝑁 − 𝑀)))
47	46	raleqdv 3339	. . . . . . 7 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → (∀𝑗 ∈ (0..^(♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)))((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ∀𝑗 ∈ (0..^(𝑁 − 𝑀))((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗)))
48		0zd 12261	. . . . . . . . 9 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) → 0 ∈ ℤ)
49		zsubcl 12292	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑁 − 𝑀) ∈ ℤ)
50	7, 6, 49	syl2anr 596	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (𝑁 − 𝑀) ∈ ℤ)
51	50	3ad2ant2 1132	. . . . . . . . 9 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) → (𝑁 − 𝑀) ∈ ℤ)
52	6	adantr 480	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → 𝑀 ∈ ℤ)
53	52	3ad2ant2 1132	. . . . . . . . 9 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) → 𝑀 ∈ ℤ)
54		fzoshftral 13432	. . . . . . . . 9 ⊢ ((0 ∈ ℤ ∧ (𝑁 − 𝑀) ∈ ℤ ∧ 𝑀 ∈ ℤ) → (∀𝑗 ∈ (0..^(𝑁 − 𝑀))((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ∀𝑖 ∈ ((0 + 𝑀)..^((𝑁 − 𝑀) + 𝑀))[(𝑖 − 𝑀) / 𝑗]((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗)))
55	48, 51, 53, 54	syl3anc 1369	. . . . . . . 8 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) → (∀𝑗 ∈ (0..^(𝑁 − 𝑀))((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ∀𝑖 ∈ ((0 + 𝑀)..^((𝑁 − 𝑀) + 𝑀))[(𝑖 − 𝑀) / 𝑗]((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗)))
56	55	adantr 480	. . . . . . 7 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → (∀𝑗 ∈ (0..^(𝑁 − 𝑀))((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ∀𝑖 ∈ ((0 + 𝑀)..^((𝑁 − 𝑀) + 𝑀))[(𝑖 − 𝑀) / 𝑗]((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗)))
57		nn0cn 12173	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ ℕ₀ → 𝑁 ∈ ℂ)
58		nn0cn 12173	. . . . . . . . . . . 12 ⊢ (𝑀 ∈ ℕ₀ → 𝑀 ∈ ℂ)
59		addid2 11088	. . . . . . . . . . . . . 14 ⊢ (𝑀 ∈ ℂ → (0 + 𝑀) = 𝑀)
60	59	adantl 481	. . . . . . . . . . . . 13 ⊢ ((𝑁 ∈ ℂ ∧ 𝑀 ∈ ℂ) → (0 + 𝑀) = 𝑀)
61		npcan 11160	. . . . . . . . . . . . 13 ⊢ ((𝑁 ∈ ℂ ∧ 𝑀 ∈ ℂ) → ((𝑁 − 𝑀) + 𝑀) = 𝑁)
62	60, 61	oveq12d 7273	. . . . . . . . . . . 12 ⊢ ((𝑁 ∈ ℂ ∧ 𝑀 ∈ ℂ) → ((0 + 𝑀)..^((𝑁 − 𝑀) + 𝑀)) = (𝑀..^𝑁))
63	57, 58, 62	syl2anr 596	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → ((0 + 𝑀)..^((𝑁 − 𝑀) + 𝑀)) = (𝑀..^𝑁))
64	63	3ad2ant2 1132	. . . . . . . . . 10 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) → ((0 + 𝑀)..^((𝑁 − 𝑀) + 𝑀)) = (𝑀..^𝑁))
65	64	adantr 480	. . . . . . . . 9 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → ((0 + 𝑀)..^((𝑁 − 𝑀) + 𝑀)) = (𝑀..^𝑁))
66	65	raleqdv 3339	. . . . . . . 8 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → (∀𝑖 ∈ ((0 + 𝑀)..^((𝑁 − 𝑀) + 𝑀))[(𝑖 − 𝑀) / 𝑗]((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ∀𝑖 ∈ (𝑀..^𝑁)[(𝑖 − 𝑀) / 𝑗]((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗)))
67		ovex 7288	. . . . . . . . . . 11 ⊢ (𝑖 − 𝑀) ∈ V
68		sbceqg 4340	. . . . . . . . . . . 12 ⊢ ((𝑖 − 𝑀) ∈ V → ([(𝑖 − 𝑀) / 𝑗]((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ⦋(𝑖 − 𝑀) / 𝑗⦌((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ⦋(𝑖 − 𝑀) / 𝑗⦌((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗)))
69		csbfv2g 6800	. . . . . . . . . . . . . 14 ⊢ ((𝑖 − 𝑀) ∈ V → ⦋(𝑖 − 𝑀) / 𝑗⦌((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑊 substr ⟨𝑀, 𝑁⟩)‘⦋(𝑖 − 𝑀) / 𝑗⦌𝑗))
70		csbvarg 4362	. . . . . . . . . . . . . . 15 ⊢ ((𝑖 − 𝑀) ∈ V → ⦋(𝑖 − 𝑀) / 𝑗⦌𝑗 = (𝑖 − 𝑀))
71	70	fveq2d 6760	. . . . . . . . . . . . . 14 ⊢ ((𝑖 − 𝑀) ∈ V → ((𝑊 substr ⟨𝑀, 𝑁⟩)‘⦋(𝑖 − 𝑀) / 𝑗⦌𝑗) = ((𝑊 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀)))
72	69, 71	eqtrd 2778	. . . . . . . . . . . . 13 ⊢ ((𝑖 − 𝑀) ∈ V → ⦋(𝑖 − 𝑀) / 𝑗⦌((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑊 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀)))
73		csbfv2g 6800	. . . . . . . . . . . . . 14 ⊢ ((𝑖 − 𝑀) ∈ V → ⦋(𝑖 − 𝑀) / 𝑗⦌((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘⦋(𝑖 − 𝑀) / 𝑗⦌𝑗))
74	70	fveq2d 6760	. . . . . . . . . . . . . 14 ⊢ ((𝑖 − 𝑀) ∈ V → ((𝑈 substr ⟨𝑀, 𝑁⟩)‘⦋(𝑖 − 𝑀) / 𝑗⦌𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀)))
75	73, 74	eqtrd 2778	. . . . . . . . . . . . 13 ⊢ ((𝑖 − 𝑀) ∈ V → ⦋(𝑖 − 𝑀) / 𝑗⦌((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀)))
76	72, 75	eqeq12d 2754	. . . . . . . . . . . 12 ⊢ ((𝑖 − 𝑀) ∈ V → (⦋(𝑖 − 𝑀) / 𝑗⦌((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ⦋(𝑖 − 𝑀) / 𝑗⦌((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ((𝑊 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀)) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀))))
77	68, 76	bitrd 278	. . . . . . . . . . 11 ⊢ ((𝑖 − 𝑀) ∈ V → ([(𝑖 − 𝑀) / 𝑗]((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ((𝑊 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀)) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀))))
78	67, 77	mp1i 13	. . . . . . . . . 10 ⊢ (((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) ∧ 𝑖 ∈ (𝑀..^𝑁)) → ([(𝑖 − 𝑀) / 𝑗]((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ((𝑊 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀)) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀))))
79	33, 42, 43	3jca 1126	. . . . . . . . . . . 12 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → (𝑊 ∈ Word 𝑉 ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ (ℤ_≥‘𝑀)) ∧ 𝑁 ≤ (♯‘𝑊)))
80		swrdfv2 14302	. . . . . . . . . . . 12 ⊢ (((𝑊 ∈ Word 𝑉 ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ (ℤ_≥‘𝑀)) ∧ 𝑁 ≤ (♯‘𝑊)) ∧ 𝑖 ∈ (𝑀..^𝑁)) → ((𝑊 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀)) = (𝑊‘𝑖))
81	79, 80	sylan 579	. . . . . . . . . . 11 ⊢ (((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) ∧ 𝑖 ∈ (𝑀..^𝑁)) → ((𝑊 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀)) = (𝑊‘𝑖))
82		simpl1r 1223	. . . . . . . . . . . . 13 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → 𝑈 ∈ Word 𝑉)
83		simpl3r 1227	. . . . . . . . . . . . 13 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → 𝑁 ≤ (♯‘𝑈))
84	82, 42, 83	3jca 1126	. . . . . . . . . . . 12 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → (𝑈 ∈ Word 𝑉 ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ (ℤ_≥‘𝑀)) ∧ 𝑁 ≤ (♯‘𝑈)))
85		swrdfv2 14302	. . . . . . . . . . . 12 ⊢ (((𝑈 ∈ Word 𝑉 ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ (ℤ_≥‘𝑀)) ∧ 𝑁 ≤ (♯‘𝑈)) ∧ 𝑖 ∈ (𝑀..^𝑁)) → ((𝑈 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀)) = (𝑈‘𝑖))
86	84, 85	sylan 579	. . . . . . . . . . 11 ⊢ (((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) ∧ 𝑖 ∈ (𝑀..^𝑁)) → ((𝑈 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀)) = (𝑈‘𝑖))
87	81, 86	eqeq12d 2754	. . . . . . . . . 10 ⊢ (((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) ∧ 𝑖 ∈ (𝑀..^𝑁)) → (((𝑊 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀)) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀)) ↔ (𝑊‘𝑖) = (𝑈‘𝑖)))
88	78, 87	bitrd 278	. . . . . . . . 9 ⊢ (((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) ∧ 𝑖 ∈ (𝑀..^𝑁)) → ([(𝑖 − 𝑀) / 𝑗]((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ (𝑊‘𝑖) = (𝑈‘𝑖)))
89	88	ralbidva 3119	. . . . . . . 8 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → (∀𝑖 ∈ (𝑀..^𝑁)[(𝑖 − 𝑀) / 𝑗]((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ∀𝑖 ∈ (𝑀..^𝑁)(𝑊‘𝑖) = (𝑈‘𝑖)))
90	66, 89	bitrd 278	. . . . . . 7 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → (∀𝑖 ∈ ((0 + 𝑀)..^((𝑁 − 𝑀) + 𝑀))[(𝑖 − 𝑀) / 𝑗]((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ∀𝑖 ∈ (𝑀..^𝑁)(𝑊‘𝑖) = (𝑈‘𝑖)))
91	47, 56, 90	3bitrd 304	. . . . . 6 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → (∀𝑗 ∈ (0..^(♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)))((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ∀𝑖 ∈ (𝑀..^𝑁)(𝑊‘𝑖) = (𝑈‘𝑖)))
92	91	ex 412	. . . . 5 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) → (𝑀 ≤ 𝑁 → (∀𝑗 ∈ (0..^(♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)))((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ∀𝑖 ∈ (𝑀..^𝑁)(𝑊‘𝑖) = (𝑈‘𝑖))))
93	32, 92	syld 47	. . . 4 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) → (¬ 𝑁 ≤ 𝑀 → (∀𝑗 ∈ (0..^(♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)))((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ∀𝑖 ∈ (𝑀..^𝑁)(𝑊‘𝑖) = (𝑈‘𝑖))))
94	93	impcom 407	. . 3 ⊢ ((¬ 𝑁 ≤ 𝑀 ∧ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈)))) → (∀𝑗 ∈ (0..^(♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)))((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ∀𝑖 ∈ (𝑀..^𝑁)(𝑊‘𝑖) = (𝑈‘𝑖)))
95	22, 25, 94	3bitr2d 306	. 2 ⊢ ((¬ 𝑁 ≤ 𝑀 ∧ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈)))) → ((𝑊 substr ⟨𝑀, 𝑁⟩) = (𝑈 substr ⟨𝑀, 𝑁⟩) ↔ ∀𝑖 ∈ (𝑀..^𝑁)(𝑊‘𝑖) = (𝑈‘𝑖)))
96	16, 95	pm2.61ian 808	1 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) → ((𝑊 substr ⟨𝑀, 𝑁⟩) = (𝑈 substr ⟨𝑀, 𝑁⟩) ↔ ∀𝑖 ∈ (𝑀..^𝑁)(𝑊‘𝑖) = (𝑈‘𝑖)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 395 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 ∀wral 3063 Vcvv 3422 [wsbc 3711 ⦋csb 3828 ∅c0 4253 ⟨cop 4564 class class class wbr 5070 ‘cfv 6418 (class class class)co 7255 ℂcc 10800 ℝcr 10801 0cc0 10802 + caddc 10805 < clt 10940 ≤ cle 10941 − cmin 11135 ℕ₀cn0 12163 ℤcz 12249 ℤ_≥cuz 12511 ..^cfzo 13311 ♯chash 13972 Word cword 14145 substr csubstr 14281

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 df-card 9628 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-nn 11904 df-n0 12164 df-z 12250 df-uz 12512 df-fz 13169 df-fzo 13312 df-hash 13973 df-word 14146 df-substr 14282

This theorem is referenced by: pfxsuffeqwrdeq 14339 clwwlkf1 28314

W3C validator