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 14693

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 14691	. . . . . 6 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ 𝑁 ≤ 𝑀) → (𝑊 substr ⟨𝑀, 𝑁⟩) = (𝑈 substr ⟨𝑀, 𝑁⟩))
2	1	3expa 1134	. . . . 5 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀)) ∧ 𝑁 ≤ 𝑀) → (𝑊 substr ⟨𝑀, 𝑁⟩) = (𝑈 substr ⟨𝑀, 𝑁⟩))
3	2	ancoms 463	. . . 4 ⊢ ((𝑁 ≤ 𝑀 ∧ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀))) → (𝑊 substr ⟨𝑀, 𝑁⟩) = (𝑈 substr ⟨𝑀, 𝑁⟩))
4	3	3adantr3 1188	. . 3 ⊢ ((𝑁 ≤ 𝑀 ∧ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈)))) → (𝑊 substr ⟨𝑀, 𝑁⟩) = (𝑈 substr ⟨𝑀, 𝑁⟩))
5		ral0 4455	. . . . . . 7 ⊢ ∀𝑖 ∈ ∅ (𝑊‘𝑖) = (𝑈‘𝑖)
6		nn0z 12606	. . . . . . . . . 10 ⊢ (𝑀 ∈ ℕ₀ → 𝑀 ∈ ℤ)
7		nn0z 12606	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ₀ → 𝑁 ∈ ℤ)
8		fzon 13700	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 ≤ 𝑀 ↔ (𝑀..^𝑁) = ∅))
9	6, 7, 8	syl2an 607	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (𝑁 ≤ 𝑀 ↔ (𝑀..^𝑁) = ∅))
10	9	biimpa 481	. . . . . . . 8 ⊢ (((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ 𝑁 ≤ 𝑀) → (𝑀..^𝑁) = ∅)
11	10	raleqdv 3323	. . . . . . 7 ⊢ (((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ 𝑁 ≤ 𝑀) → (∀𝑖 ∈ (𝑀..^𝑁)(𝑊‘𝑖) = (𝑈‘𝑖) ↔ ∀𝑖 ∈ ∅ (𝑊‘𝑖) = (𝑈‘𝑖)))
12	5, 11	mpbiri 261	. . . . . 6 ⊢ (((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ 𝑁 ≤ 𝑀) → ∀𝑖 ∈ (𝑀..^𝑁)(𝑊‘𝑖) = (𝑈‘𝑖))
13	12	ex 417	. . . . 5 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (𝑁 ≤ 𝑀 → ∀𝑖 ∈ (𝑀..^𝑁)(𝑊‘𝑖) = (𝑈‘𝑖)))
14	13	3ad2ant2 1150	. . . 4 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) → (𝑁 ≤ 𝑀 → ∀𝑖 ∈ (𝑀..^𝑁)(𝑊‘𝑖) = (𝑈‘𝑖)))
15	14	impcom 412	. . 3 ⊢ ((𝑁 ≤ 𝑀 ∧ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈)))) → ∀𝑖 ∈ (𝑀..^𝑁)(𝑊‘𝑖) = (𝑈‘𝑖))
16	4, 15	2thd 268	. 2 ⊢ ((𝑁 ≤ 𝑀 ∧ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈)))) → ((𝑊 substr ⟨𝑀, 𝑁⟩) = (𝑈 substr ⟨𝑀, 𝑁⟩) ↔ ∀𝑖 ∈ (𝑀..^𝑁)(𝑊‘𝑖) = (𝑈‘𝑖)))
17		swrdcl 14673	. . . . . 6 ⊢ (𝑊 ∈ Word 𝑉 → (𝑊 substr ⟨𝑀, 𝑁⟩) ∈ Word 𝑉)
18		swrdcl 14673	. . . . . 6 ⊢ (𝑈 ∈ Word 𝑉 → (𝑈 substr ⟨𝑀, 𝑁⟩) ∈ Word 𝑉)
19		eqwrd 14584	. . . . . 6 ⊢ (((𝑊 substr ⟨𝑀, 𝑁⟩) ∈ Word 𝑉 ∧ (𝑈 substr ⟨𝑀, 𝑁⟩) ∈ Word 𝑉) → ((𝑊 substr ⟨𝑀, 𝑁⟩) = (𝑈 substr ⟨𝑀, 𝑁⟩) ↔ ((♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)) = (♯‘(𝑈 substr ⟨𝑀, 𝑁⟩)) ∧ ∀𝑗 ∈ (0..^(♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)))((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗))))
20	17, 18, 19	syl2an 607	. . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) → ((𝑊 substr ⟨𝑀, 𝑁⟩) = (𝑈 substr ⟨𝑀, 𝑁⟩) ↔ ((♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)) = (♯‘(𝑈 substr ⟨𝑀, 𝑁⟩)) ∧ ∀𝑗 ∈ (0..^(♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)))((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗))))
21	20	3ad2ant1 1149	. . . 4 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) → ((𝑊 substr ⟨𝑀, 𝑁⟩) = (𝑈 substr ⟨𝑀, 𝑁⟩) ↔ ((♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)) = (♯‘(𝑈 substr ⟨𝑀, 𝑁⟩)) ∧ ∀𝑗 ∈ (0..^(♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)))((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗))))
22	21	adantl 486	. . 3 ⊢ ((¬ 𝑁 ≤ 𝑀 ∧ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈)))) → ((𝑊 substr ⟨𝑀, 𝑁⟩) = (𝑈 substr ⟨𝑀, 𝑁⟩) ↔ ((♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)) = (♯‘(𝑈 substr ⟨𝑀, 𝑁⟩)) ∧ ∀𝑗 ∈ (0..^(♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)))((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗))))
23		swrdsbslen 14692	. . . . 5 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) → (♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)) = (♯‘(𝑈 substr ⟨𝑀, 𝑁⟩)))
24	23	adantl 486	. . . 4 ⊢ ((¬ 𝑁 ≤ 𝑀 ∧ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈)))) → (♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)) = (♯‘(𝑈 substr ⟨𝑀, 𝑁⟩)))
25	24	biantrurd 541	. . 3 ⊢ ((¬ 𝑁 ≤ 𝑀 ∧ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈)))) → (∀𝑗 ∈ (0..^(♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)))((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ((♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)) = (♯‘(𝑈 substr ⟨𝑀, 𝑁⟩)) ∧ ∀𝑗 ∈ (0..^(♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)))((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗))))
26		nn0re 12504	. . . . . . 7 ⊢ (𝑀 ∈ ℕ₀ → 𝑀 ∈ ℝ)
27		nn0re 12504	. . . . . . 7 ⊢ (𝑁 ∈ ℕ₀ → 𝑁 ∈ ℝ)
28		ltnle 11277	. . . . . . . 8 ⊢ ((𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (𝑀 < 𝑁 ↔ ¬ 𝑁 ≤ 𝑀))
29		ltle 11286	. . . . . . . 8 ⊢ ((𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (𝑀 < 𝑁 → 𝑀 ≤ 𝑁))
30	28, 29	sylbird 263	. . . . . . 7 ⊢ ((𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (¬ 𝑁 ≤ 𝑀 → 𝑀 ≤ 𝑁))
31	26, 27, 30	syl2an 607	. . . . . 6 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (¬ 𝑁 ≤ 𝑀 → 𝑀 ≤ 𝑁))
32	31	3ad2ant2 1150	. . . . 5 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) → (¬ 𝑁 ≤ 𝑀 → 𝑀 ≤ 𝑁))
33		simpl1l 1241	. . . . . . . . . 10 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → 𝑊 ∈ Word 𝑉)
34		simpl2l 1243	. . . . . . . . . . 11 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → 𝑀 ∈ ℕ₀)
35	6, 7	anim12i 624	. . . . . . . . . . . . . . 15 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ))
36	35	3ad2ant2 1150	. . . . . . . . . . . . . 14 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) → (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ))
37	36	anim1i 626	. . . . . . . . . . . . 13 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑀 ≤ 𝑁))
38		df-3an 1103	. . . . . . . . . . . . 13 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁) ↔ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑀 ≤ 𝑁))
39	37, 38	sylibr 237	. . . . . . . . . . . 12 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁))
40		eluz2 12859	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) ↔ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁))
41	39, 40	sylibr 237	. . . . . . . . . . 11 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → 𝑁 ∈ (ℤ_≥‘𝑀))
42	34, 41	jca 520	. . . . . . . . . 10 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ (ℤ_≥‘𝑀)))
43		simpl3l 1245	. . . . . . . . . 10 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → 𝑁 ≤ (♯‘𝑊))
44		swrdlen2 14688	. . . . . . . . . 10 ⊢ ((𝑊 ∈ Word 𝑉 ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ (ℤ_≥‘𝑀)) ∧ 𝑁 ≤ (♯‘𝑊)) → (♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)) = (𝑁 − 𝑀))
45	33, 42, 43, 44	syl3anc 1394	. . . . . . . . 9 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → (♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)) = (𝑁 − 𝑀))
46	45	oveq2d 7416	. . . . . . . 8 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → (0..^(♯‘(𝑊 substr ⟨𝑀, 𝑁⟩))) = (0..^(𝑁 − 𝑀)))
47	46	raleqdv 3323	. . . . . . 7 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → (∀𝑗 ∈ (0..^(♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)))((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ∀𝑗 ∈ (0..^(𝑁 − 𝑀))((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗)))
48		0zd 12594	. . . . . . . . 9 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) → 0 ∈ ℤ)
49		zsubcl 12627	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑁 − 𝑀) ∈ ℤ)
50	7, 6, 49	syl2anr 608	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (𝑁 − 𝑀) ∈ ℤ)
51	50	3ad2ant2 1150	. . . . . . . . 9 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) → (𝑁 − 𝑀) ∈ ℤ)
52	6	adantr 485	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → 𝑀 ∈ ℤ)
53	52	3ad2ant2 1150	. . . . . . . . 9 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) → 𝑀 ∈ ℤ)
54		fzoshftral 13807	. . . . . . . . 9 ⊢ ((0 ∈ ℤ ∧ (𝑁 − 𝑀) ∈ ℤ ∧ 𝑀 ∈ ℤ) → (∀𝑗 ∈ (0..^(𝑁 − 𝑀))((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ∀𝑖 ∈ ((0 + 𝑀)..^((𝑁 − 𝑀) + 𝑀))[(𝑖 − 𝑀) / 𝑗]((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗)))
55	48, 51, 53, 54	syl3anc 1394	. . . . . . . 8 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) → (∀𝑗 ∈ (0..^(𝑁 − 𝑀))((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ∀𝑖 ∈ ((0 + 𝑀)..^((𝑁 − 𝑀) + 𝑀))[(𝑖 − 𝑀) / 𝑗]((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗)))
56	55	adantr 485	. . . . . . 7 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → (∀𝑗 ∈ (0..^(𝑁 − 𝑀))((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ∀𝑖 ∈ ((0 + 𝑀)..^((𝑁 − 𝑀) + 𝑀))[(𝑖 − 𝑀) / 𝑗]((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗)))
57		nn0cn 12505	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ ℕ₀ → 𝑁 ∈ ℂ)
58		nn0cn 12505	. . . . . . . . . . . 12 ⊢ (𝑀 ∈ ℕ₀ → 𝑀 ∈ ℂ)
59		addlid 11381	. . . . . . . . . . . . . 14 ⊢ (𝑀 ∈ ℂ → (0 + 𝑀) = 𝑀)
60	59	adantl 486	. . . . . . . . . . . . 13 ⊢ ((𝑁 ∈ ℂ ∧ 𝑀 ∈ ℂ) → (0 + 𝑀) = 𝑀)
61		npcan 11454	. . . . . . . . . . . . 13 ⊢ ((𝑁 ∈ ℂ ∧ 𝑀 ∈ ℂ) → ((𝑁 − 𝑀) + 𝑀) = 𝑁)
62	60, 61	oveq12d 7418	. . . . . . . . . . . 12 ⊢ ((𝑁 ∈ ℂ ∧ 𝑀 ∈ ℂ) → ((0 + 𝑀)..^((𝑁 − 𝑀) + 𝑀)) = (𝑀..^𝑁))
63	57, 58, 62	syl2anr 608	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → ((0 + 𝑀)..^((𝑁 − 𝑀) + 𝑀)) = (𝑀..^𝑁))
64	63	3ad2ant2 1150	. . . . . . . . . 10 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) → ((0 + 𝑀)..^((𝑁 − 𝑀) + 𝑀)) = (𝑀..^𝑁))
65	64	adantr 485	. . . . . . . . 9 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → ((0 + 𝑀)..^((𝑁 − 𝑀) + 𝑀)) = (𝑀..^𝑁))
66	65	raleqdv 3323	. . . . . . . 8 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → (∀𝑖 ∈ ((0 + 𝑀)..^((𝑁 − 𝑀) + 𝑀))[(𝑖 − 𝑀) / 𝑗]((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ∀𝑖 ∈ (𝑀..^𝑁)[(𝑖 − 𝑀) / 𝑗]((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗)))
67		ovex 7433	. . . . . . . . . . 11 ⊢ (𝑖 − 𝑀) ∈ V
68		sbceqg 4369	. . . . . . . . . . . 12 ⊢ ((𝑖 − 𝑀) ∈ V → ([(𝑖 − 𝑀) / 𝑗]((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ⦋(𝑖 − 𝑀) / 𝑗⦌((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ⦋(𝑖 − 𝑀) / 𝑗⦌((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗)))
69		csbfv2g 6917	. . . . . . . . . . . . . 14 ⊢ ((𝑖 − 𝑀) ∈ V → ⦋(𝑖 − 𝑀) / 𝑗⦌((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑊 substr ⟨𝑀, 𝑁⟩)‘⦋(𝑖 − 𝑀) / 𝑗⦌𝑗))
70		csbvarg 4391	. . . . . . . . . . . . . . 15 ⊢ ((𝑖 − 𝑀) ∈ V → ⦋(𝑖 − 𝑀) / 𝑗⦌𝑗 = (𝑖 − 𝑀))
71	70	fveq2d 6875	. . . . . . . . . . . . . 14 ⊢ ((𝑖 − 𝑀) ∈ V → ((𝑊 substr ⟨𝑀, 𝑁⟩)‘⦋(𝑖 − 𝑀) / 𝑗⦌𝑗) = ((𝑊 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀)))
72	69, 71	eqtrd 2800	. . . . . . . . . . . . 13 ⊢ ((𝑖 − 𝑀) ∈ V → ⦋(𝑖 − 𝑀) / 𝑗⦌((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑊 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀)))
73		csbfv2g 6917	. . . . . . . . . . . . . 14 ⊢ ((𝑖 − 𝑀) ∈ V → ⦋(𝑖 − 𝑀) / 𝑗⦌((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘⦋(𝑖 − 𝑀) / 𝑗⦌𝑗))
74	70	fveq2d 6875	. . . . . . . . . . . . . 14 ⊢ ((𝑖 − 𝑀) ∈ V → ((𝑈 substr ⟨𝑀, 𝑁⟩)‘⦋(𝑖 − 𝑀) / 𝑗⦌𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀)))
75	73, 74	eqtrd 2800	. . . . . . . . . . . . 13 ⊢ ((𝑖 − 𝑀) ∈ V → ⦋(𝑖 − 𝑀) / 𝑗⦌((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀)))
76	72, 75	eqeq12d 2781	. . . . . . . . . . . 12 ⊢ ((𝑖 − 𝑀) ∈ V → (⦋(𝑖 − 𝑀) / 𝑗⦌((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ⦋(𝑖 − 𝑀) / 𝑗⦌((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ((𝑊 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀)) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀))))
77	68, 76	bitrd 282	. . . . . . . . . . 11 ⊢ ((𝑖 − 𝑀) ∈ V → ([(𝑖 − 𝑀) / 𝑗]((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ((𝑊 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀)) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀))))
78	67, 77	mp1i 14	. . . . . . . . . 10 ⊢ (((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) ∧ 𝑖 ∈ (𝑀..^𝑁)) → ([(𝑖 − 𝑀) / 𝑗]((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ((𝑊 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀)) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀))))
79	33, 42, 43	3jca 1144	. . . . . . . . . . . 12 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → (𝑊 ∈ Word 𝑉 ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ (ℤ_≥‘𝑀)) ∧ 𝑁 ≤ (♯‘𝑊)))
80		swrdfv2 14689	. . . . . . . . . . . 12 ⊢ (((𝑊 ∈ Word 𝑉 ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ (ℤ_≥‘𝑀)) ∧ 𝑁 ≤ (♯‘𝑊)) ∧ 𝑖 ∈ (𝑀..^𝑁)) → ((𝑊 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀)) = (𝑊‘𝑖))
81	79, 80	sylan 591	. . . . . . . . . . 11 ⊢ (((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) ∧ 𝑖 ∈ (𝑀..^𝑁)) → ((𝑊 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀)) = (𝑊‘𝑖))
82		simpl1r 1242	. . . . . . . . . . . . 13 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → 𝑈 ∈ Word 𝑉)
83		simpl3r 1246	. . . . . . . . . . . . 13 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → 𝑁 ≤ (♯‘𝑈))
84	82, 42, 83	3jca 1144	. . . . . . . . . . . 12 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → (𝑈 ∈ Word 𝑉 ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ (ℤ_≥‘𝑀)) ∧ 𝑁 ≤ (♯‘𝑈)))
85		swrdfv2 14689	. . . . . . . . . . . 12 ⊢ (((𝑈 ∈ Word 𝑉 ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ (ℤ_≥‘𝑀)) ∧ 𝑁 ≤ (♯‘𝑈)) ∧ 𝑖 ∈ (𝑀..^𝑁)) → ((𝑈 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀)) = (𝑈‘𝑖))
86	84, 85	sylan 591	. . . . . . . . . . 11 ⊢ (((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) ∧ 𝑖 ∈ (𝑀..^𝑁)) → ((𝑈 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀)) = (𝑈‘𝑖))
87	81, 86	eqeq12d 2781	. . . . . . . . . 10 ⊢ (((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) ∧ 𝑖 ∈ (𝑀..^𝑁)) → (((𝑊 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀)) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘(𝑖 − 𝑀)) ↔ (𝑊‘𝑖) = (𝑈‘𝑖)))
88	78, 87	bitrd 282	. . . . . . . . 9 ⊢ (((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) ∧ 𝑖 ∈ (𝑀..^𝑁)) → ([(𝑖 − 𝑀) / 𝑗]((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ (𝑊‘𝑖) = (𝑈‘𝑖)))
89	88	ralbidva 3186	. . . . . . . 8 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → (∀𝑖 ∈ (𝑀..^𝑁)[(𝑖 − 𝑀) / 𝑗]((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ∀𝑖 ∈ (𝑀..^𝑁)(𝑊‘𝑖) = (𝑈‘𝑖)))
90	66, 89	bitrd 282	. . . . . . 7 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → (∀𝑖 ∈ ((0 + 𝑀)..^((𝑁 − 𝑀) + 𝑀))[(𝑖 − 𝑀) / 𝑗]((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ∀𝑖 ∈ (𝑀..^𝑁)(𝑊‘𝑖) = (𝑈‘𝑖)))
91	47, 56, 90	3bitrd 308	. . . . . 6 ⊢ ((((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) ∧ 𝑀 ≤ 𝑁) → (∀𝑗 ∈ (0..^(♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)))((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ∀𝑖 ∈ (𝑀..^𝑁)(𝑊‘𝑖) = (𝑈‘𝑖)))
92	91	ex 417	. . . . 5 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) → (𝑀 ≤ 𝑁 → (∀𝑗 ∈ (0..^(♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)))((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ∀𝑖 ∈ (𝑀..^𝑁)(𝑊‘𝑖) = (𝑈‘𝑖))))
93	32, 92	syld 48	. . . 4 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) → (¬ 𝑁 ≤ 𝑀 → (∀𝑗 ∈ (0..^(♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)))((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ∀𝑖 ∈ (𝑀..^𝑁)(𝑊‘𝑖) = (𝑈‘𝑖))))
94	93	impcom 412	. . 3 ⊢ ((¬ 𝑁 ≤ 𝑀 ∧ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈)))) → (∀𝑗 ∈ (0..^(♯‘(𝑊 substr ⟨𝑀, 𝑁⟩)))((𝑊 substr ⟨𝑀, 𝑁⟩)‘𝑗) = ((𝑈 substr ⟨𝑀, 𝑁⟩)‘𝑗) ↔ ∀𝑖 ∈ (𝑀..^𝑁)(𝑊‘𝑖) = (𝑈‘𝑖)))
95	22, 25, 94	3bitr2d 310	. 2 ⊢ ((¬ 𝑁 ≤ 𝑀 ∧ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈)))) → ((𝑊 substr ⟨𝑀, 𝑁⟩) = (𝑈 substr ⟨𝑀, 𝑁⟩) ↔ ∀𝑖 ∈ (𝑀..^𝑁)(𝑊‘𝑖) = (𝑈‘𝑖)))
96	16, 95	pm2.61ian 823	1 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉) ∧ (𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) ∧ (𝑁 ≤ (♯‘𝑊) ∧ 𝑁 ≤ (♯‘𝑈))) → ((𝑊 substr ⟨𝑀, 𝑁⟩) = (𝑈 substr ⟨𝑀, 𝑁⟩) ↔ ∀𝑖 ∈ (𝑀..^𝑁)(𝑊‘𝑖) = (𝑈‘𝑖)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 = wceq 1563 ∈ wcel 2145 ∀wral 3079 Vcvv 3457 [wsbc 3747 ⦋csb 3855 ∅c0 4288 ⟨cop 4591 class class class wbr 5105 ‘cfv 6525 (class class class)co 7400 ℂcc 11086 ℝcr 11087 0cc0 11088 + caddc 11091 < clt 11231 ≤ cle 11232 − cmin 11429 ℕ₀cn0 12495 ℤcz 12582 ℤ_≥cuz 12853 ..^cfzo 13673 ♯chash 14357 Word cword 14540 substr csubstr 14668

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5232 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-int 4909 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-1st 7974 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-1o 8441 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-fin 8935 df-card 9913 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-nn 12225 df-n0 12496 df-z 12583 df-uz 12854 df-fz 13527 df-fzo 13674 df-hash 14358 df-word 14541 df-substr 14669

This theorem is referenced by: pfxsuffeqwrdeq 14725 clwwlkf1 30309

W3C validator