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

Theorem swrdccatin2 14084
 Description: The subword of a concatenation of two words within the second of the concatenated words. (Contributed by Alexander van der Vekens, 28-Mar-2018.) (Revised by Alexander van der Vekens, 27-May-2018.)
Hypothesis
Ref Expression
swrdccatin2.l 𝐿 = (♯‘𝐴)
Assertion
Ref Expression
swrdccatin2 ((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) → ((𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵)))) → ((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩) = (𝐵 substr ⟨(𝑀𝐿), (𝑁𝐿)⟩)))

Proof of Theorem swrdccatin2
Dummy variable 𝑘 is distinct from all other variables.
StepHypRef Expression
1 swrdccatin2.l . . . . . . . 8 𝐿 = (♯‘𝐴)
2 oveq1 7142 . . . . . . . . . 10 (𝐿 = (♯‘𝐴) → (𝐿...𝑁) = ((♯‘𝐴)...𝑁))
32eleq2d 2875 . . . . . . . . 9 (𝐿 = (♯‘𝐴) → (𝑀 ∈ (𝐿...𝑁) ↔ 𝑀 ∈ ((♯‘𝐴)...𝑁)))
4 id 22 . . . . . . . . . . 11 (𝐿 = (♯‘𝐴) → 𝐿 = (♯‘𝐴))
5 oveq1 7142 . . . . . . . . . . 11 (𝐿 = (♯‘𝐴) → (𝐿 + (♯‘𝐵)) = ((♯‘𝐴) + (♯‘𝐵)))
64, 5oveq12d 7153 . . . . . . . . . 10 (𝐿 = (♯‘𝐴) → (𝐿...(𝐿 + (♯‘𝐵))) = ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))))
76eleq2d 2875 . . . . . . . . 9 (𝐿 = (♯‘𝐴) → (𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))) ↔ 𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵)))))
83, 7anbi12d 633 . . . . . . . 8 (𝐿 = (♯‘𝐴) → ((𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵)))) ↔ (𝑀 ∈ ((♯‘𝐴)...𝑁) ∧ 𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))))))
91, 8ax-mp 5 . . . . . . 7 ((𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵)))) ↔ (𝑀 ∈ ((♯‘𝐴)...𝑁) ∧ 𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵)))))
10 lencl 13878 . . . . . . . . 9 (𝐴 ∈ Word 𝑉 → (♯‘𝐴) ∈ ℕ0)
11 elnn0uz 12273 . . . . . . . . . . . 12 ((♯‘𝐴) ∈ ℕ0 ↔ (♯‘𝐴) ∈ (ℤ‘0))
12 fzss1 12943 . . . . . . . . . . . 12 ((♯‘𝐴) ∈ (ℤ‘0) → ((♯‘𝐴)...𝑁) ⊆ (0...𝑁))
1311, 12sylbi 220 . . . . . . . . . . 11 ((♯‘𝐴) ∈ ℕ0 → ((♯‘𝐴)...𝑁) ⊆ (0...𝑁))
1413sseld 3914 . . . . . . . . . 10 ((♯‘𝐴) ∈ ℕ0 → (𝑀 ∈ ((♯‘𝐴)...𝑁) → 𝑀 ∈ (0...𝑁)))
15 fzss1 12943 . . . . . . . . . . . 12 ((♯‘𝐴) ∈ (ℤ‘0) → ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))) ⊆ (0...((♯‘𝐴) + (♯‘𝐵))))
1611, 15sylbi 220 . . . . . . . . . . 11 ((♯‘𝐴) ∈ ℕ0 → ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))) ⊆ (0...((♯‘𝐴) + (♯‘𝐵))))
1716sseld 3914 . . . . . . . . . 10 ((♯‘𝐴) ∈ ℕ0 → (𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))) → 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵)))))
1814, 17anim12d 611 . . . . . . . . 9 ((♯‘𝐴) ∈ ℕ0 → ((𝑀 ∈ ((♯‘𝐴)...𝑁) ∧ 𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵)))) → (𝑀 ∈ (0...𝑁) ∧ 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵))))))
1910, 18syl 17 . . . . . . . 8 (𝐴 ∈ Word 𝑉 → ((𝑀 ∈ ((♯‘𝐴)...𝑁) ∧ 𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵)))) → (𝑀 ∈ (0...𝑁) ∧ 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵))))))
2019adantr 484 . . . . . . 7 ((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) → ((𝑀 ∈ ((♯‘𝐴)...𝑁) ∧ 𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵)))) → (𝑀 ∈ (0...𝑁) ∧ 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵))))))
219, 20syl5bi 245 . . . . . 6 ((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) → ((𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵)))) → (𝑀 ∈ (0...𝑁) ∧ 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵))))))
2221imp 410 . . . . 5 (((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝑀 ∈ (0...𝑁) ∧ 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵)))))
23 swrdccatfn 14079 . . . . 5 (((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (0...𝑁) ∧ 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵))))) → ((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩) Fn (0..^(𝑁𝑀)))
2422, 23syldan 594 . . . 4 (((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → ((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩) Fn (0..^(𝑁𝑀)))
25 fzmmmeqm 12937 . . . . . . 7 (𝑀 ∈ (𝐿...𝑁) → ((𝑁𝐿) − (𝑀𝐿)) = (𝑁𝑀))
2625oveq2d 7151 . . . . . 6 (𝑀 ∈ (𝐿...𝑁) → (0..^((𝑁𝐿) − (𝑀𝐿))) = (0..^(𝑁𝑀)))
2726fneq2d 6417 . . . . 5 (𝑀 ∈ (𝐿...𝑁) → (((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩) Fn (0..^((𝑁𝐿) − (𝑀𝐿))) ↔ ((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩) Fn (0..^(𝑁𝑀))))
2827ad2antrl 727 . . . 4 (((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩) Fn (0..^((𝑁𝐿) − (𝑀𝐿))) ↔ ((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩) Fn (0..^(𝑁𝑀))))
2924, 28mpbird 260 . . 3 (((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → ((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩) Fn (0..^((𝑁𝐿) − (𝑀𝐿))))
30 simplr 768 . . . 4 (((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → 𝐵 ∈ Word 𝑉)
31 elfzmlbm 13014 . . . . 5 (𝑀 ∈ (𝐿...𝑁) → (𝑀𝐿) ∈ (0...(𝑁𝐿)))
3231ad2antrl 727 . . . 4 (((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝑀𝐿) ∈ (0...(𝑁𝐿)))
33 lencl 13878 . . . . . . . 8 (𝐵 ∈ Word 𝑉 → (♯‘𝐵) ∈ ℕ0)
3433nn0zd 12075 . . . . . . 7 (𝐵 ∈ Word 𝑉 → (♯‘𝐵) ∈ ℤ)
3534adantl 485 . . . . . 6 ((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) → (♯‘𝐵) ∈ ℤ)
36 elfzmlbp 13015 . . . . . 6 (((♯‘𝐵) ∈ ℤ ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵)))) → (𝑁𝐿) ∈ (0...(♯‘𝐵)))
3735, 36sylan 583 . . . . 5 (((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵)))) → (𝑁𝐿) ∈ (0...(♯‘𝐵)))
3837adantrl 715 . . . 4 (((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝑁𝐿) ∈ (0...(♯‘𝐵)))
39 swrdvalfn 14006 . . . 4 ((𝐵 ∈ Word 𝑉 ∧ (𝑀𝐿) ∈ (0...(𝑁𝐿)) ∧ (𝑁𝐿) ∈ (0...(♯‘𝐵))) → (𝐵 substr ⟨(𝑀𝐿), (𝑁𝐿)⟩) Fn (0..^((𝑁𝐿) − (𝑀𝐿))))
4030, 32, 38, 39syl3anc 1368 . . 3 (((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝐵 substr ⟨(𝑀𝐿), (𝑁𝐿)⟩) Fn (0..^((𝑁𝐿) − (𝑀𝐿))))
41 simpll 766 . . . . . . 7 ((((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁𝐿) − (𝑀𝐿)))) → (𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉))
42 elfzelz 12904 . . . . . . . . . 10 (𝑀 ∈ (𝐿...𝑁) → 𝑀 ∈ ℤ)
43 zaddcl 12012 . . . . . . . . . . 11 ((𝑘 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑘 + 𝑀) ∈ ℤ)
4443expcom 417 . . . . . . . . . 10 (𝑀 ∈ ℤ → (𝑘 ∈ ℤ → (𝑘 + 𝑀) ∈ ℤ))
4542, 44syl 17 . . . . . . . . 9 (𝑀 ∈ (𝐿...𝑁) → (𝑘 ∈ ℤ → (𝑘 + 𝑀) ∈ ℤ))
4645ad2antrl 727 . . . . . . . 8 (((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝑘 ∈ ℤ → (𝑘 + 𝑀) ∈ ℤ))
47 elfzoelz 13035 . . . . . . . 8 (𝑘 ∈ (0..^((𝑁𝐿) − (𝑀𝐿))) → 𝑘 ∈ ℤ)
4846, 47impel 509 . . . . . . 7 ((((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁𝐿) − (𝑀𝐿)))) → (𝑘 + 𝑀) ∈ ℤ)
49 df-3an 1086 . . . . . . 7 ((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉 ∧ (𝑘 + 𝑀) ∈ ℤ) ↔ ((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑘 + 𝑀) ∈ ℤ))
5041, 48, 49sylanbrc 586 . . . . . 6 ((((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁𝐿) − (𝑀𝐿)))) → (𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉 ∧ (𝑘 + 𝑀) ∈ ℤ))
51 ccatsymb 13929 . . . . . 6 ((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉 ∧ (𝑘 + 𝑀) ∈ ℤ) → ((𝐴 ++ 𝐵)‘(𝑘 + 𝑀)) = if((𝑘 + 𝑀) < (♯‘𝐴), (𝐴‘(𝑘 + 𝑀)), (𝐵‘((𝑘 + 𝑀) − (♯‘𝐴)))))
5250, 51syl 17 . . . . 5 ((((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁𝐿) − (𝑀𝐿)))) → ((𝐴 ++ 𝐵)‘(𝑘 + 𝑀)) = if((𝑘 + 𝑀) < (♯‘𝐴), (𝐴‘(𝑘 + 𝑀)), (𝐵‘((𝑘 + 𝑀) − (♯‘𝐴)))))
53 elfz2 12894 . . . . . . . . 9 (𝑀 ∈ (𝐿...𝑁) ↔ ((𝐿 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ (𝐿𝑀𝑀𝑁)))
54 zre 11975 . . . . . . . . . . . . . . . . 17 (𝐿 ∈ ℤ → 𝐿 ∈ ℝ)
55 zre 11975 . . . . . . . . . . . . . . . . 17 (𝑀 ∈ ℤ → 𝑀 ∈ ℝ)
5654, 55anim12i 615 . . . . . . . . . . . . . . . 16 ((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ))
57 elnn0z 11984 . . . . . . . . . . . . . . . . 17 (𝑘 ∈ ℕ0 ↔ (𝑘 ∈ ℤ ∧ 0 ≤ 𝑘))
58 zre 11975 . . . . . . . . . . . . . . . . . 18 (𝑘 ∈ ℤ → 𝑘 ∈ ℝ)
59 0re 10634 . . . . . . . . . . . . . . . . . . . . . . . . . 26 0 ∈ ℝ
6059jctl 527 . . . . . . . . . . . . . . . . . . . . . . . . 25 (𝐿 ∈ ℝ → (0 ∈ ℝ ∧ 𝐿 ∈ ℝ))
6160ad2antrl 727 . . . . . . . . . . . . . . . . . . . . . . . 24 ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → (0 ∈ ℝ ∧ 𝐿 ∈ ℝ))
62 id 22 . . . . . . . . . . . . . . . . . . . . . . . . 25 ((𝑘 ∈ ℝ ∧ 𝑀 ∈ ℝ) → (𝑘 ∈ ℝ ∧ 𝑀 ∈ ℝ))
6362adantrl 715 . . . . . . . . . . . . . . . . . . . . . . . 24 ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → (𝑘 ∈ ℝ ∧ 𝑀 ∈ ℝ))
64 le2add 11113 . . . . . . . . . . . . . . . . . . . . . . . 24 (((0 ∈ ℝ ∧ 𝐿 ∈ ℝ) ∧ (𝑘 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → ((0 ≤ 𝑘𝐿𝑀) → (0 + 𝐿) ≤ (𝑘 + 𝑀)))
6561, 63, 64syl2anc 587 . . . . . . . . . . . . . . . . . . . . . . 23 ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → ((0 ≤ 𝑘𝐿𝑀) → (0 + 𝐿) ≤ (𝑘 + 𝑀)))
66 recn 10618 . . . . . . . . . . . . . . . . . . . . . . . . . 26 (𝐿 ∈ ℝ → 𝐿 ∈ ℂ)
6766addid2d 10832 . . . . . . . . . . . . . . . . . . . . . . . . 25 (𝐿 ∈ ℝ → (0 + 𝐿) = 𝐿)
6867ad2antrl 727 . . . . . . . . . . . . . . . . . . . . . . . 24 ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → (0 + 𝐿) = 𝐿)
6968breq1d 5040 . . . . . . . . . . . . . . . . . . . . . . 23 ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → ((0 + 𝐿) ≤ (𝑘 + 𝑀) ↔ 𝐿 ≤ (𝑘 + 𝑀)))
7065, 69sylibd 242 . . . . . . . . . . . . . . . . . . . . . 22 ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → ((0 ≤ 𝑘𝐿𝑀) → 𝐿 ≤ (𝑘 + 𝑀)))
71 simprl 770 . . . . . . . . . . . . . . . . . . . . . . 23 ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → 𝐿 ∈ ℝ)
72 readdcl 10611 . . . . . . . . . . . . . . . . . . . . . . . 24 ((𝑘 ∈ ℝ ∧ 𝑀 ∈ ℝ) → (𝑘 + 𝑀) ∈ ℝ)
7372adantrl 715 . . . . . . . . . . . . . . . . . . . . . . 23 ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → (𝑘 + 𝑀) ∈ ℝ)
7471, 73lenltd 10777 . . . . . . . . . . . . . . . . . . . . . 22 ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → (𝐿 ≤ (𝑘 + 𝑀) ↔ ¬ (𝑘 + 𝑀) < 𝐿))
7570, 74sylibd 242 . . . . . . . . . . . . . . . . . . . . 21 ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → ((0 ≤ 𝑘𝐿𝑀) → ¬ (𝑘 + 𝑀) < 𝐿))
7675expd 419 . . . . . . . . . . . . . . . . . . . 20 ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → (0 ≤ 𝑘 → (𝐿𝑀 → ¬ (𝑘 + 𝑀) < 𝐿)))
7776com12 32 . . . . . . . . . . . . . . . . . . 19 (0 ≤ 𝑘 → ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → (𝐿𝑀 → ¬ (𝑘 + 𝑀) < 𝐿)))
7877expd 419 . . . . . . . . . . . . . . . . . 18 (0 ≤ 𝑘 → (𝑘 ∈ ℝ → ((𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ) → (𝐿𝑀 → ¬ (𝑘 + 𝑀) < 𝐿))))
7958, 78mpan9 510 . . . . . . . . . . . . . . . . 17 ((𝑘 ∈ ℤ ∧ 0 ≤ 𝑘) → ((𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ) → (𝐿𝑀 → ¬ (𝑘 + 𝑀) < 𝐿)))
8057, 79sylbi 220 . . . . . . . . . . . . . . . 16 (𝑘 ∈ ℕ0 → ((𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ) → (𝐿𝑀 → ¬ (𝑘 + 𝑀) < 𝐿)))
8156, 80mpan9 510 . . . . . . . . . . . . . . 15 (((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝑘 ∈ ℕ0) → (𝐿𝑀 → ¬ (𝑘 + 𝑀) < 𝐿))
821breq2i 5038 . . . . . . . . . . . . . . . 16 ((𝑘 + 𝑀) < 𝐿 ↔ (𝑘 + 𝑀) < (♯‘𝐴))
8382notbii 323 . . . . . . . . . . . . . . 15 (¬ (𝑘 + 𝑀) < 𝐿 ↔ ¬ (𝑘 + 𝑀) < (♯‘𝐴))
8481, 83syl6ib 254 . . . . . . . . . . . . . 14 (((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝑘 ∈ ℕ0) → (𝐿𝑀 → ¬ (𝑘 + 𝑀) < (♯‘𝐴)))
8584ex 416 . . . . . . . . . . . . 13 ((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑘 ∈ ℕ0 → (𝐿𝑀 → ¬ (𝑘 + 𝑀) < (♯‘𝐴))))
8685com23 86 . . . . . . . . . . . 12 ((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝐿𝑀 → (𝑘 ∈ ℕ0 → ¬ (𝑘 + 𝑀) < (♯‘𝐴))))
87863adant2 1128 . . . . . . . . . . 11 ((𝐿 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝐿𝑀 → (𝑘 ∈ ℕ0 → ¬ (𝑘 + 𝑀) < (♯‘𝐴))))
8887imp 410 . . . . . . . . . 10 (((𝐿 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝐿𝑀) → (𝑘 ∈ ℕ0 → ¬ (𝑘 + 𝑀) < (♯‘𝐴)))
8988adantrr 716 . . . . . . . . 9 (((𝐿 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ (𝐿𝑀𝑀𝑁)) → (𝑘 ∈ ℕ0 → ¬ (𝑘 + 𝑀) < (♯‘𝐴)))
9053, 89sylbi 220 . . . . . . . 8 (𝑀 ∈ (𝐿...𝑁) → (𝑘 ∈ ℕ0 → ¬ (𝑘 + 𝑀) < (♯‘𝐴)))
9190ad2antrl 727 . . . . . . 7 (((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝑘 ∈ ℕ0 → ¬ (𝑘 + 𝑀) < (♯‘𝐴)))
92 elfzonn0 13079 . . . . . . 7 (𝑘 ∈ (0..^((𝑁𝐿) − (𝑀𝐿))) → 𝑘 ∈ ℕ0)
9391, 92impel 509 . . . . . 6 ((((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁𝐿) − (𝑀𝐿)))) → ¬ (𝑘 + 𝑀) < (♯‘𝐴))
9493iffalsed 4436 . . . . 5 ((((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁𝐿) − (𝑀𝐿)))) → if((𝑘 + 𝑀) < (♯‘𝐴), (𝐴‘(𝑘 + 𝑀)), (𝐵‘((𝑘 + 𝑀) − (♯‘𝐴)))) = (𝐵‘((𝑘 + 𝑀) − (♯‘𝐴))))
95 zcn 11976 . . . . . . . . . . . . . . . 16 (𝑘 ∈ ℤ → 𝑘 ∈ ℂ)
9695adantl 485 . . . . . . . . . . . . . . 15 (((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝑘 ∈ ℤ) → 𝑘 ∈ ℂ)
97 zcn 11976 . . . . . . . . . . . . . . . 16 (𝑀 ∈ ℤ → 𝑀 ∈ ℂ)
9897ad2antlr 726 . . . . . . . . . . . . . . 15 (((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝑘 ∈ ℤ) → 𝑀 ∈ ℂ)
99 zcn 11976 . . . . . . . . . . . . . . . 16 (𝐿 ∈ ℤ → 𝐿 ∈ ℂ)
10099ad2antrr 725 . . . . . . . . . . . . . . 15 (((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝑘 ∈ ℤ) → 𝐿 ∈ ℂ)
10196, 98, 100addsubassd 11008 . . . . . . . . . . . . . 14 (((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝑘 ∈ ℤ) → ((𝑘 + 𝑀) − 𝐿) = (𝑘 + (𝑀𝐿)))
102 oveq2 7143 . . . . . . . . . . . . . . 15 (𝐿 = (♯‘𝐴) → ((𝑘 + 𝑀) − 𝐿) = ((𝑘 + 𝑀) − (♯‘𝐴)))
103102eqeq1d 2800 . . . . . . . . . . . . . 14 (𝐿 = (♯‘𝐴) → (((𝑘 + 𝑀) − 𝐿) = (𝑘 + (𝑀𝐿)) ↔ ((𝑘 + 𝑀) − (♯‘𝐴)) = (𝑘 + (𝑀𝐿))))
104101, 103syl5ib 247 . . . . . . . . . . . . 13 (𝐿 = (♯‘𝐴) → (((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝑘 ∈ ℤ) → ((𝑘 + 𝑀) − (♯‘𝐴)) = (𝑘 + (𝑀𝐿))))
1051, 104ax-mp 5 . . . . . . . . . . . 12 (((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝑘 ∈ ℤ) → ((𝑘 + 𝑀) − (♯‘𝐴)) = (𝑘 + (𝑀𝐿)))
106105ex 416 . . . . . . . . . . 11 ((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑘 ∈ ℤ → ((𝑘 + 𝑀) − (♯‘𝐴)) = (𝑘 + (𝑀𝐿))))
1071063adant2 1128 . . . . . . . . . 10 ((𝐿 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑘 ∈ ℤ → ((𝑘 + 𝑀) − (♯‘𝐴)) = (𝑘 + (𝑀𝐿))))
108107adantr 484 . . . . . . . . 9 (((𝐿 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ (𝐿𝑀𝑀𝑁)) → (𝑘 ∈ ℤ → ((𝑘 + 𝑀) − (♯‘𝐴)) = (𝑘 + (𝑀𝐿))))
10953, 108sylbi 220 . . . . . . . 8 (𝑀 ∈ (𝐿...𝑁) → (𝑘 ∈ ℤ → ((𝑘 + 𝑀) − (♯‘𝐴)) = (𝑘 + (𝑀𝐿))))
110109ad2antrl 727 . . . . . . 7 (((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝑘 ∈ ℤ → ((𝑘 + 𝑀) − (♯‘𝐴)) = (𝑘 + (𝑀𝐿))))
111110, 47impel 509 . . . . . 6 ((((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁𝐿) − (𝑀𝐿)))) → ((𝑘 + 𝑀) − (♯‘𝐴)) = (𝑘 + (𝑀𝐿)))
112111fveq2d 6649 . . . . 5 ((((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁𝐿) − (𝑀𝐿)))) → (𝐵‘((𝑘 + 𝑀) − (♯‘𝐴))) = (𝐵‘(𝑘 + (𝑀𝐿))))
11352, 94, 1123eqtrd 2837 . . . 4 ((((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁𝐿) − (𝑀𝐿)))) → ((𝐴 ++ 𝐵)‘(𝑘 + 𝑀)) = (𝐵‘(𝑘 + (𝑀𝐿))))
114 ccatcl 13919 . . . . . . 7 ((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) → (𝐴 ++ 𝐵) ∈ Word 𝑉)
115114adantr 484 . . . . . 6 (((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝐴 ++ 𝐵) ∈ Word 𝑉)
11611biimpi 219 . . . . . . . . . 10 ((♯‘𝐴) ∈ ℕ0 → (♯‘𝐴) ∈ (ℤ‘0))
1171, 116eqeltrid 2894 . . . . . . . . 9 ((♯‘𝐴) ∈ ℕ0𝐿 ∈ (ℤ‘0))
118 fzss1 12943 . . . . . . . . 9 (𝐿 ∈ (ℤ‘0) → (𝐿...𝑁) ⊆ (0...𝑁))
11910, 117, 1183syl 18 . . . . . . . 8 (𝐴 ∈ Word 𝑉 → (𝐿...𝑁) ⊆ (0...𝑁))
120119sselda 3915 . . . . . . 7 ((𝐴 ∈ Word 𝑉𝑀 ∈ (𝐿...𝑁)) → 𝑀 ∈ (0...𝑁))
121120ad2ant2r 746 . . . . . 6 (((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → 𝑀 ∈ (0...𝑁))
1221, 7ax-mp 5 . . . . . . . . 9 (𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))) ↔ 𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))))
12310, 116, 153syl 18 . . . . . . . . . . . . . 14 (𝐴 ∈ Word 𝑉 → ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))) ⊆ (0...((♯‘𝐴) + (♯‘𝐵))))
124123adantr 484 . . . . . . . . . . . . 13 ((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) → ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))) ⊆ (0...((♯‘𝐴) + (♯‘𝐵))))
125124sseld 3914 . . . . . . . . . . . 12 ((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) → (𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))) → 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵)))))
126125impcom 411 . . . . . . . . . . 11 ((𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))) ∧ (𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉)) → 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵))))
127 ccatlen 13920 . . . . . . . . . . . . . 14 ((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) → (♯‘(𝐴 ++ 𝐵)) = ((♯‘𝐴) + (♯‘𝐵)))
128127oveq2d 7151 . . . . . . . . . . . . 13 ((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) → (0...(♯‘(𝐴 ++ 𝐵))) = (0...((♯‘𝐴) + (♯‘𝐵))))
129128eleq2d 2875 . . . . . . . . . . . 12 ((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) → (𝑁 ∈ (0...(♯‘(𝐴 ++ 𝐵))) ↔ 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵)))))
130129adantl 485 . . . . . . . . . . 11 ((𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))) ∧ (𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉)) → (𝑁 ∈ (0...(♯‘(𝐴 ++ 𝐵))) ↔ 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵)))))
131126, 130mpbird 260 . . . . . . . . . 10 ((𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))) ∧ (𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉)) → 𝑁 ∈ (0...(♯‘(𝐴 ++ 𝐵))))
132131ex 416 . . . . . . . . 9 (𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))) → ((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) → 𝑁 ∈ (0...(♯‘(𝐴 ++ 𝐵)))))
133122, 132sylbi 220 . . . . . . . 8 (𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))) → ((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) → 𝑁 ∈ (0...(♯‘(𝐴 ++ 𝐵)))))
134133impcom 411 . . . . . . 7 (((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵)))) → 𝑁 ∈ (0...(♯‘(𝐴 ++ 𝐵))))
135134adantrl 715 . . . . . 6 (((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → 𝑁 ∈ (0...(♯‘(𝐴 ++ 𝐵))))
136115, 121, 1353jca 1125 . . . . 5 (((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → ((𝐴 ++ 𝐵) ∈ Word 𝑉𝑀 ∈ (0...𝑁) ∧ 𝑁 ∈ (0...(♯‘(𝐴 ++ 𝐵)))))
13726eleq2d 2875 . . . . . . 7 (𝑀 ∈ (𝐿...𝑁) → (𝑘 ∈ (0..^((𝑁𝐿) − (𝑀𝐿))) ↔ 𝑘 ∈ (0..^(𝑁𝑀))))
138137ad2antrl 727 . . . . . 6 (((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝑘 ∈ (0..^((𝑁𝐿) − (𝑀𝐿))) ↔ 𝑘 ∈ (0..^(𝑁𝑀))))
139138biimpa 480 . . . . 5 ((((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁𝐿) − (𝑀𝐿)))) → 𝑘 ∈ (0..^(𝑁𝑀)))
140 swrdfv 14003 . . . . 5 ((((𝐴 ++ 𝐵) ∈ Word 𝑉𝑀 ∈ (0...𝑁) ∧ 𝑁 ∈ (0...(♯‘(𝐴 ++ 𝐵)))) ∧ 𝑘 ∈ (0..^(𝑁𝑀))) → (((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩)‘𝑘) = ((𝐴 ++ 𝐵)‘(𝑘 + 𝑀)))
141136, 139, 140syl2an2r 684 . . . 4 ((((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁𝐿) − (𝑀𝐿)))) → (((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩)‘𝑘) = ((𝐴 ++ 𝐵)‘(𝑘 + 𝑀)))
14234, 36sylan 583 . . . . . . 7 ((𝐵 ∈ Word 𝑉𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵)))) → (𝑁𝐿) ∈ (0...(♯‘𝐵)))
143142ad2ant2l 745 . . . . . 6 (((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝑁𝐿) ∈ (0...(♯‘𝐵)))
14430, 32, 1433jca 1125 . . . . 5 (((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝐵 ∈ Word 𝑉 ∧ (𝑀𝐿) ∈ (0...(𝑁𝐿)) ∧ (𝑁𝐿) ∈ (0...(♯‘𝐵))))
145 swrdfv 14003 . . . . 5 (((𝐵 ∈ Word 𝑉 ∧ (𝑀𝐿) ∈ (0...(𝑁𝐿)) ∧ (𝑁𝐿) ∈ (0...(♯‘𝐵))) ∧ 𝑘 ∈ (0..^((𝑁𝐿) − (𝑀𝐿)))) → ((𝐵 substr ⟨(𝑀𝐿), (𝑁𝐿)⟩)‘𝑘) = (𝐵‘(𝑘 + (𝑀𝐿))))
146144, 145sylan 583 . . . 4 ((((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁𝐿) − (𝑀𝐿)))) → ((𝐵 substr ⟨(𝑀𝐿), (𝑁𝐿)⟩)‘𝑘) = (𝐵‘(𝑘 + (𝑀𝐿))))
147113, 141, 1463eqtr4d 2843 . . 3 ((((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁𝐿) − (𝑀𝐿)))) → (((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩)‘𝑘) = ((𝐵 substr ⟨(𝑀𝐿), (𝑁𝐿)⟩)‘𝑘))
14829, 40, 147eqfnfvd 6782 . 2 (((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → ((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩) = (𝐵 substr ⟨(𝑀𝐿), (𝑁𝐿)⟩))
149148ex 416 1 ((𝐴 ∈ Word 𝑉𝐵 ∈ Word 𝑉) → ((𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵)))) → ((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩) = (𝐵 substr ⟨(𝑀𝐿), (𝑁𝐿)⟩)))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2111   ⊆ wss 3881  ifcif 4425  ⟨cop 4531   class class class wbr 5030   Fn wfn 6319  ‘cfv 6324  (class class class)co 7135  ℂcc 10526  ℝcr 10527  0cc0 10528   + caddc 10531   < clt 10666   ≤ cle 10667   − cmin 10861  ℕ0cn0 11887  ℤcz 11971  ℤ≥cuz 12233  ...cfz 12887  ..^cfzo 13030  ♯chash 13688  Word cword 13859   ++ cconcat 13915   substr csubstr 13995 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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7443  ax-cnex 10584  ax-resscn 10585  ax-1cn 10586  ax-icn 10587  ax-addcl 10588  ax-addrcl 10589  ax-mulcl 10590  ax-mulrcl 10591  ax-mulcom 10592  ax-addass 10593  ax-mulass 10594  ax-distr 10595  ax-i2m1 10596  ax-1ne0 10597  ax-1rid 10598  ax-rnegex 10599  ax-rrecex 10600  ax-cnre 10601  ax-pre-lttri 10602  ax-pre-lttrn 10603  ax-pre-ltadd 10604  ax-pre-mulgt0 10605 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-nel 3092  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-riota 7093  df-ov 7138  df-oprab 7139  df-mpo 7140  df-om 7563  df-1st 7673  df-2nd 7674  df-wrecs 7932  df-recs 7993  df-rdg 8031  df-1o 8087  df-oadd 8091  df-er 8274  df-en 8495  df-dom 8496  df-sdom 8497  df-fin 8498  df-card 9354  df-pnf 10668  df-mnf 10669  df-xr 10670  df-ltxr 10671  df-le 10672  df-sub 10863  df-neg 10864  df-nn 11628  df-n0 11888  df-z 11972  df-uz 12234  df-fz 12888  df-fzo 13031  df-hash 13689  df-word 13860  df-concat 13916  df-substr 13996 This theorem is referenced by:  pfxccat3  14089  swrdccatin2d  14099
 Copyright terms: Public domain W3C validator