ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  wrdind GIF version

Theorem wrdind 11496
Description: Perform induction over the structure of a word. (Contributed by Mario Carneiro, 27-Sep-2015.) (Revised by Mario Carneiro, 26-Feb-2016.) (Proof shortened by AV, 12-Oct-2022.)
Hypotheses
Ref Expression
wrdind.1 (𝑥 = ∅ → (𝜑𝜓))
wrdind.2 (𝑥 = 𝑦 → (𝜑𝜒))
wrdind.3 (𝑥 = (𝑦 ++ ⟨“𝑧”⟩) → (𝜑𝜃))
wrdind.4 (𝑥 = 𝐴 → (𝜑𝜏))
wrdind.5 𝜓
wrdind.6 ((𝑦 ∈ Word 𝐵𝑧𝐵) → (𝜒𝜃))
Assertion
Ref Expression
wrdind (𝐴 ∈ Word 𝐵𝜏)
Distinct variable groups:   𝑥,𝐴   𝑥,𝑦,𝑧,𝐵   𝜒,𝑥   𝜑,𝑦,𝑧   𝜏,𝑥   𝜃,𝑥
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑥, 𝑦, 𝑧)   𝜒(𝑦, 𝑧)   𝜃(𝑦, 𝑧)   𝜏(𝑦, 𝑧)   𝐴(𝑦, 𝑧)

Proof of Theorem wrdind
Dummy variables 𝑛 𝑚 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 lencl 11310 . . 3 (𝐴 ∈ Word 𝐵 → (♯‘𝐴) ∈ ℕ0)
2 eqeq2 2248 . . . . . 6 (𝑛 = 0 → ((♯‘𝑥) = 𝑛 ↔ (♯‘𝑥) = 0))
32imbi1d 231 . . . . 5 (𝑛 = 0 → (((♯‘𝑥) = 𝑛𝜑) ↔ ((♯‘𝑥) = 0 → 𝜑)))
43ralbidv 2550 . . . 4 (𝑛 = 0 → (∀𝑥 ∈ Word 𝐵((♯‘𝑥) = 𝑛𝜑) ↔ ∀𝑥 ∈ Word 𝐵((♯‘𝑥) = 0 → 𝜑)))
5 eqeq2 2248 . . . . . 6 (𝑛 = 𝑚 → ((♯‘𝑥) = 𝑛 ↔ (♯‘𝑥) = 𝑚))
65imbi1d 231 . . . . 5 (𝑛 = 𝑚 → (((♯‘𝑥) = 𝑛𝜑) ↔ ((♯‘𝑥) = 𝑚𝜑)))
76ralbidv 2550 . . . 4 (𝑛 = 𝑚 → (∀𝑥 ∈ Word 𝐵((♯‘𝑥) = 𝑛𝜑) ↔ ∀𝑥 ∈ Word 𝐵((♯‘𝑥) = 𝑚𝜑)))
8 eqeq2 2248 . . . . . 6 (𝑛 = (𝑚 + 1) → ((♯‘𝑥) = 𝑛 ↔ (♯‘𝑥) = (𝑚 + 1)))
98imbi1d 231 . . . . 5 (𝑛 = (𝑚 + 1) → (((♯‘𝑥) = 𝑛𝜑) ↔ ((♯‘𝑥) = (𝑚 + 1) → 𝜑)))
109ralbidv 2550 . . . 4 (𝑛 = (𝑚 + 1) → (∀𝑥 ∈ Word 𝐵((♯‘𝑥) = 𝑛𝜑) ↔ ∀𝑥 ∈ Word 𝐵((♯‘𝑥) = (𝑚 + 1) → 𝜑)))
11 eqeq2 2248 . . . . . 6 (𝑛 = (♯‘𝐴) → ((♯‘𝑥) = 𝑛 ↔ (♯‘𝑥) = (♯‘𝐴)))
1211imbi1d 231 . . . . 5 (𝑛 = (♯‘𝐴) → (((♯‘𝑥) = 𝑛𝜑) ↔ ((♯‘𝑥) = (♯‘𝐴) → 𝜑)))
1312ralbidv 2550 . . . 4 (𝑛 = (♯‘𝐴) → (∀𝑥 ∈ Word 𝐵((♯‘𝑥) = 𝑛𝜑) ↔ ∀𝑥 ∈ Word 𝐵((♯‘𝑥) = (♯‘𝐴) → 𝜑)))
14 wrdfin 11325 . . . . . . 7 (𝑥 ∈ Word 𝐵𝑥 ∈ Fin)
15 fihasheq0 11234 . . . . . . 7 (𝑥 ∈ Fin → ((♯‘𝑥) = 0 ↔ 𝑥 = ∅))
1614, 15syl 14 . . . . . 6 (𝑥 ∈ Word 𝐵 → ((♯‘𝑥) = 0 ↔ 𝑥 = ∅))
17 wrdind.5 . . . . . . 7 𝜓
18 wrdind.1 . . . . . . 7 (𝑥 = ∅ → (𝜑𝜓))
1917, 18mpbiri 168 . . . . . 6 (𝑥 = ∅ → 𝜑)
2016, 19biimtrdi 163 . . . . 5 (𝑥 ∈ Word 𝐵 → ((♯‘𝑥) = 0 → 𝜑))
2120rgen 2603 . . . 4 𝑥 ∈ Word 𝐵((♯‘𝑥) = 0 → 𝜑)
22 fveqeq2 5704 . . . . . . 7 (𝑥 = 𝑦 → ((♯‘𝑥) = 𝑚 ↔ (♯‘𝑦) = 𝑚))
23 wrdind.2 . . . . . . 7 (𝑥 = 𝑦 → (𝜑𝜒))
2422, 23imbi12d 234 . . . . . 6 (𝑥 = 𝑦 → (((♯‘𝑥) = 𝑚𝜑) ↔ ((♯‘𝑦) = 𝑚𝜒)))
2524cbvralvw 2790 . . . . 5 (∀𝑥 ∈ Word 𝐵((♯‘𝑥) = 𝑚𝜑) ↔ ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒))
26 simprl 535 . . . . . . . . . . . . 13 (((𝑚 ∈ ℕ0 ∧ ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒)) ∧ (𝑥 ∈ Word 𝐵 ∧ (♯‘𝑥) = (𝑚 + 1))) → 𝑥 ∈ Word 𝐵)
27 fzossfz 10575 . . . . . . . . . . . . . 14 (0..^(♯‘𝑥)) ⊆ (0...(♯‘𝑥))
28 simprr 537 . . . . . . . . . . . . . . . 16 (((𝑚 ∈ ℕ0 ∧ ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒)) ∧ (𝑥 ∈ Word 𝐵 ∧ (♯‘𝑥) = (𝑚 + 1))) → (♯‘𝑥) = (𝑚 + 1))
29 nn0p1nn 9604 . . . . . . . . . . . . . . . . 17 (𝑚 ∈ ℕ0 → (𝑚 + 1) ∈ ℕ)
3029ad2antrr 492 . . . . . . . . . . . . . . . 16 (((𝑚 ∈ ℕ0 ∧ ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒)) ∧ (𝑥 ∈ Word 𝐵 ∧ (♯‘𝑥) = (𝑚 + 1))) → (𝑚 + 1) ∈ ℕ)
3128, 30eqeltrd 2315 . . . . . . . . . . . . . . 15 (((𝑚 ∈ ℕ0 ∧ ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒)) ∧ (𝑥 ∈ Word 𝐵 ∧ (♯‘𝑥) = (𝑚 + 1))) → (♯‘𝑥) ∈ ℕ)
32 fzo0end 10643 . . . . . . . . . . . . . . 15 ((♯‘𝑥) ∈ ℕ → ((♯‘𝑥) − 1) ∈ (0..^(♯‘𝑥)))
3331, 32syl 14 . . . . . . . . . . . . . 14 (((𝑚 ∈ ℕ0 ∧ ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒)) ∧ (𝑥 ∈ Word 𝐵 ∧ (♯‘𝑥) = (𝑚 + 1))) → ((♯‘𝑥) − 1) ∈ (0..^(♯‘𝑥)))
3427, 33sselid 3246 . . . . . . . . . . . . 13 (((𝑚 ∈ ℕ0 ∧ ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒)) ∧ (𝑥 ∈ Word 𝐵 ∧ (♯‘𝑥) = (𝑚 + 1))) → ((♯‘𝑥) − 1) ∈ (0...(♯‘𝑥)))
35 pfxlen 11459 . . . . . . . . . . . . 13 ((𝑥 ∈ Word 𝐵 ∧ ((♯‘𝑥) − 1) ∈ (0...(♯‘𝑥))) → (♯‘(𝑥 prefix ((♯‘𝑥) − 1))) = ((♯‘𝑥) − 1))
3626, 34, 35syl2anc 415 . . . . . . . . . . . 12 (((𝑚 ∈ ℕ0 ∧ ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒)) ∧ (𝑥 ∈ Word 𝐵 ∧ (♯‘𝑥) = (𝑚 + 1))) → (♯‘(𝑥 prefix ((♯‘𝑥) − 1))) = ((♯‘𝑥) − 1))
3728oveq1d 6100 . . . . . . . . . . . 12 (((𝑚 ∈ ℕ0 ∧ ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒)) ∧ (𝑥 ∈ Word 𝐵 ∧ (♯‘𝑥) = (𝑚 + 1))) → ((♯‘𝑥) − 1) = ((𝑚 + 1) − 1))
38 nn0cn 9575 . . . . . . . . . . . . . 14 (𝑚 ∈ ℕ0𝑚 ∈ ℂ)
3938ad2antrr 492 . . . . . . . . . . . . 13 (((𝑚 ∈ ℕ0 ∧ ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒)) ∧ (𝑥 ∈ Word 𝐵 ∧ (♯‘𝑥) = (𝑚 + 1))) → 𝑚 ∈ ℂ)
40 ax-1cn 8272 . . . . . . . . . . . . 13 1 ∈ ℂ
41 pncan 8532 . . . . . . . . . . . . 13 ((𝑚 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑚 + 1) − 1) = 𝑚)
4239, 40, 41sylancl 417 . . . . . . . . . . . 12 (((𝑚 ∈ ℕ0 ∧ ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒)) ∧ (𝑥 ∈ Word 𝐵 ∧ (♯‘𝑥) = (𝑚 + 1))) → ((𝑚 + 1) − 1) = 𝑚)
4336, 37, 423eqtrd 2275 . . . . . . . . . . 11 (((𝑚 ∈ ℕ0 ∧ ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒)) ∧ (𝑥 ∈ Word 𝐵 ∧ (♯‘𝑥) = (𝑚 + 1))) → (♯‘(𝑥 prefix ((♯‘𝑥) − 1))) = 𝑚)
44 fveqeq2 5704 . . . . . . . . . . . . 13 (𝑦 = (𝑥 prefix ((♯‘𝑥) − 1)) → ((♯‘𝑦) = 𝑚 ↔ (♯‘(𝑥 prefix ((♯‘𝑥) − 1))) = 𝑚))
45 vex 2824 . . . . . . . . . . . . . . 15 𝑦 ∈ V
4645, 23sbcie 3086 . . . . . . . . . . . . . 14 ([𝑦 / 𝑥]𝜑𝜒)
47 dfsbcq 3053 . . . . . . . . . . . . . 14 (𝑦 = (𝑥 prefix ((♯‘𝑥) − 1)) → ([𝑦 / 𝑥]𝜑[(𝑥 prefix ((♯‘𝑥) − 1)) / 𝑥]𝜑))
4846, 47bitr3id 194 . . . . . . . . . . . . 13 (𝑦 = (𝑥 prefix ((♯‘𝑥) − 1)) → (𝜒[(𝑥 prefix ((♯‘𝑥) − 1)) / 𝑥]𝜑))
4944, 48imbi12d 234 . . . . . . . . . . . 12 (𝑦 = (𝑥 prefix ((♯‘𝑥) − 1)) → (((♯‘𝑦) = 𝑚𝜒) ↔ ((♯‘(𝑥 prefix ((♯‘𝑥) − 1))) = 𝑚[(𝑥 prefix ((♯‘𝑥) − 1)) / 𝑥]𝜑)))
50 simplr 533 . . . . . . . . . . . 12 (((𝑚 ∈ ℕ0 ∧ ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒)) ∧ (𝑥 ∈ Word 𝐵 ∧ (♯‘𝑥) = (𝑚 + 1))) → ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒))
51 lencl 11310 . . . . . . . . . . . . . . . 16 (𝑥 ∈ Word 𝐵 → (♯‘𝑥) ∈ ℕ0)
5251nn0zd 9768 . . . . . . . . . . . . . . 15 (𝑥 ∈ Word 𝐵 → (♯‘𝑥) ∈ ℤ)
53 1zzd 9673 . . . . . . . . . . . . . . 15 (𝑥 ∈ Word 𝐵 → 1 ∈ ℤ)
5452, 53zsubcld 9775 . . . . . . . . . . . . . 14 (𝑥 ∈ Word 𝐵 → ((♯‘𝑥) − 1) ∈ ℤ)
55 pfxclz 11453 . . . . . . . . . . . . . 14 ((𝑥 ∈ Word 𝐵 ∧ ((♯‘𝑥) − 1) ∈ ℤ) → (𝑥 prefix ((♯‘𝑥) − 1)) ∈ Word 𝐵)
5654, 55mpdan 425 . . . . . . . . . . . . 13 (𝑥 ∈ Word 𝐵 → (𝑥 prefix ((♯‘𝑥) − 1)) ∈ Word 𝐵)
5756ad2antrl 494 . . . . . . . . . . . 12 (((𝑚 ∈ ℕ0 ∧ ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒)) ∧ (𝑥 ∈ Word 𝐵 ∧ (♯‘𝑥) = (𝑚 + 1))) → (𝑥 prefix ((♯‘𝑥) − 1)) ∈ Word 𝐵)
5849, 50, 57rspcdva 2934 . . . . . . . . . . 11 (((𝑚 ∈ ℕ0 ∧ ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒)) ∧ (𝑥 ∈ Word 𝐵 ∧ (♯‘𝑥) = (𝑚 + 1))) → ((♯‘(𝑥 prefix ((♯‘𝑥) − 1))) = 𝑚[(𝑥 prefix ((♯‘𝑥) − 1)) / 𝑥]𝜑))
5943, 58mpd 13 . . . . . . . . . 10 (((𝑚 ∈ ℕ0 ∧ ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒)) ∧ (𝑥 ∈ Word 𝐵 ∧ (♯‘𝑥) = (𝑚 + 1))) → [(𝑥 prefix ((♯‘𝑥) − 1)) / 𝑥]𝜑)
6031nnge1d 9348 . . . . . . . . . . . . 13 (((𝑚 ∈ ℕ0 ∧ ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒)) ∧ (𝑥 ∈ Word 𝐵 ∧ (♯‘𝑥) = (𝑚 + 1))) → 1 ≤ (♯‘𝑥))
61 wrdlenge1n0 11340 . . . . . . . . . . . . . 14 (𝑥 ∈ Word 𝐵 → (𝑥 ≠ ∅ ↔ 1 ≤ (♯‘𝑥)))
6261ad2antrl 494 . . . . . . . . . . . . 13 (((𝑚 ∈ ℕ0 ∧ ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒)) ∧ (𝑥 ∈ Word 𝐵 ∧ (♯‘𝑥) = (𝑚 + 1))) → (𝑥 ≠ ∅ ↔ 1 ≤ (♯‘𝑥)))
6360, 62mpbird 167 . . . . . . . . . . . 12 (((𝑚 ∈ ℕ0 ∧ ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒)) ∧ (𝑥 ∈ Word 𝐵 ∧ (♯‘𝑥) = (𝑚 + 1))) → 𝑥 ≠ ∅)
64 lswcl 11357 . . . . . . . . . . . 12 ((𝑥 ∈ Word 𝐵𝑥 ≠ ∅) → (lastS‘𝑥) ∈ 𝐵)
6526, 63, 64syl2anc 415 . . . . . . . . . . 11 (((𝑚 ∈ ℕ0 ∧ ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒)) ∧ (𝑥 ∈ Word 𝐵 ∧ (♯‘𝑥) = (𝑚 + 1))) → (lastS‘𝑥) ∈ 𝐵)
66 oveq1 6092 . . . . . . . . . . . . . 14 (𝑦 = (𝑥 prefix ((♯‘𝑥) − 1)) → (𝑦 ++ ⟨“𝑧”⟩) = ((𝑥 prefix ((♯‘𝑥) − 1)) ++ ⟨“𝑧”⟩))
6766sbceq1d 3056 . . . . . . . . . . . . 13 (𝑦 = (𝑥 prefix ((♯‘𝑥) − 1)) → ([(𝑦 ++ ⟨“𝑧”⟩) / 𝑥]𝜑[((𝑥 prefix ((♯‘𝑥) − 1)) ++ ⟨“𝑧”⟩) / 𝑥]𝜑))
6847, 67imbi12d 234 . . . . . . . . . . . 12 (𝑦 = (𝑥 prefix ((♯‘𝑥) − 1)) → (([𝑦 / 𝑥]𝜑[(𝑦 ++ ⟨“𝑧”⟩) / 𝑥]𝜑) ↔ ([(𝑥 prefix ((♯‘𝑥) − 1)) / 𝑥]𝜑[((𝑥 prefix ((♯‘𝑥) − 1)) ++ ⟨“𝑧”⟩) / 𝑥]𝜑)))
69 s1eq 11389 . . . . . . . . . . . . . . 15 (𝑧 = (lastS‘𝑥) → ⟨“𝑧”⟩ = ⟨“(lastS‘𝑥)”⟩)
7069oveq2d 6101 . . . . . . . . . . . . . 14 (𝑧 = (lastS‘𝑥) → ((𝑥 prefix ((♯‘𝑥) − 1)) ++ ⟨“𝑧”⟩) = ((𝑥 prefix ((♯‘𝑥) − 1)) ++ ⟨“(lastS‘𝑥)”⟩))
7170sbceq1d 3056 . . . . . . . . . . . . 13 (𝑧 = (lastS‘𝑥) → ([((𝑥 prefix ((♯‘𝑥) − 1)) ++ ⟨“𝑧”⟩) / 𝑥]𝜑[((𝑥 prefix ((♯‘𝑥) − 1)) ++ ⟨“(lastS‘𝑥)”⟩) / 𝑥]𝜑))
7271imbi2d 230 . . . . . . . . . . . 12 (𝑧 = (lastS‘𝑥) → (([(𝑥 prefix ((♯‘𝑥) − 1)) / 𝑥]𝜑[((𝑥 prefix ((♯‘𝑥) − 1)) ++ ⟨“𝑧”⟩) / 𝑥]𝜑) ↔ ([(𝑥 prefix ((♯‘𝑥) − 1)) / 𝑥]𝜑[((𝑥 prefix ((♯‘𝑥) − 1)) ++ ⟨“(lastS‘𝑥)”⟩) / 𝑥]𝜑)))
73 wrdind.6 . . . . . . . . . . . . 13 ((𝑦 ∈ Word 𝐵𝑧𝐵) → (𝜒𝜃))
7446a1i 9 . . . . . . . . . . . . 13 ((𝑦 ∈ Word 𝐵𝑧𝐵) → ([𝑦 / 𝑥]𝜑𝜒))
75 ccatws1cl 11402 . . . . . . . . . . . . . 14 ((𝑦 ∈ Word 𝐵𝑧𝐵) → (𝑦 ++ ⟨“𝑧”⟩) ∈ Word 𝐵)
76 wrdind.3 . . . . . . . . . . . . . . 15 (𝑥 = (𝑦 ++ ⟨“𝑧”⟩) → (𝜑𝜃))
7776adantl 277 . . . . . . . . . . . . . 14 (((𝑦 ∈ Word 𝐵𝑧𝐵) ∧ 𝑥 = (𝑦 ++ ⟨“𝑧”⟩)) → (𝜑𝜃))
7875, 77sbcied 3088 . . . . . . . . . . . . 13 ((𝑦 ∈ Word 𝐵𝑧𝐵) → ([(𝑦 ++ ⟨“𝑧”⟩) / 𝑥]𝜑𝜃))
7973, 74, 783imtr4d 203 . . . . . . . . . . . 12 ((𝑦 ∈ Word 𝐵𝑧𝐵) → ([𝑦 / 𝑥]𝜑[(𝑦 ++ ⟨“𝑧”⟩) / 𝑥]𝜑))
8068, 72, 79vtocl2ga 2891 . . . . . . . . . . 11 (((𝑥 prefix ((♯‘𝑥) − 1)) ∈ Word 𝐵 ∧ (lastS‘𝑥) ∈ 𝐵) → ([(𝑥 prefix ((♯‘𝑥) − 1)) / 𝑥]𝜑[((𝑥 prefix ((♯‘𝑥) − 1)) ++ ⟨“(lastS‘𝑥)”⟩) / 𝑥]𝜑))
8157, 65, 80syl2anc 415 . . . . . . . . . 10 (((𝑚 ∈ ℕ0 ∧ ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒)) ∧ (𝑥 ∈ Word 𝐵 ∧ (♯‘𝑥) = (𝑚 + 1))) → ([(𝑥 prefix ((♯‘𝑥) − 1)) / 𝑥]𝜑[((𝑥 prefix ((♯‘𝑥) − 1)) ++ ⟨“(lastS‘𝑥)”⟩) / 𝑥]𝜑))
8259, 81mpd 13 . . . . . . . . 9 (((𝑚 ∈ ℕ0 ∧ ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒)) ∧ (𝑥 ∈ Word 𝐵 ∧ (♯‘𝑥) = (𝑚 + 1))) → [((𝑥 prefix ((♯‘𝑥) − 1)) ++ ⟨“(lastS‘𝑥)”⟩) / 𝑥]𝜑)
8314ad2antrl 494 . . . . . . . . . . . . 13 (((𝑚 ∈ ℕ0 ∧ ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒)) ∧ (𝑥 ∈ Word 𝐵 ∧ (♯‘𝑥) = (𝑚 + 1))) → 𝑥 ∈ Fin)
84 hashnncl 11236 . . . . . . . . . . . . 13 (𝑥 ∈ Fin → ((♯‘𝑥) ∈ ℕ ↔ 𝑥 ≠ ∅))
8583, 84syl 14 . . . . . . . . . . . 12 (((𝑚 ∈ ℕ0 ∧ ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒)) ∧ (𝑥 ∈ Word 𝐵 ∧ (♯‘𝑥) = (𝑚 + 1))) → ((♯‘𝑥) ∈ ℕ ↔ 𝑥 ≠ ∅))
8631, 85mpbid 147 . . . . . . . . . . 11 (((𝑚 ∈ ℕ0 ∧ ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒)) ∧ (𝑥 ∈ Word 𝐵 ∧ (♯‘𝑥) = (𝑚 + 1))) → 𝑥 ≠ ∅)
87 pfxlswccat 11487 . . . . . . . . . . . 12 ((𝑥 ∈ Word 𝐵𝑥 ≠ ∅) → ((𝑥 prefix ((♯‘𝑥) − 1)) ++ ⟨“(lastS‘𝑥)”⟩) = 𝑥)
8887eqcomd 2244 . . . . . . . . . . 11 ((𝑥 ∈ Word 𝐵𝑥 ≠ ∅) → 𝑥 = ((𝑥 prefix ((♯‘𝑥) − 1)) ++ ⟨“(lastS‘𝑥)”⟩))
8926, 86, 88syl2anc 415 . . . . . . . . . 10 (((𝑚 ∈ ℕ0 ∧ ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒)) ∧ (𝑥 ∈ Word 𝐵 ∧ (♯‘𝑥) = (𝑚 + 1))) → 𝑥 = ((𝑥 prefix ((♯‘𝑥) − 1)) ++ ⟨“(lastS‘𝑥)”⟩))
90 sbceq1a 3061 . . . . . . . . . 10 (𝑥 = ((𝑥 prefix ((♯‘𝑥) − 1)) ++ ⟨“(lastS‘𝑥)”⟩) → (𝜑[((𝑥 prefix ((♯‘𝑥) − 1)) ++ ⟨“(lastS‘𝑥)”⟩) / 𝑥]𝜑))
9189, 90syl 14 . . . . . . . . 9 (((𝑚 ∈ ℕ0 ∧ ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒)) ∧ (𝑥 ∈ Word 𝐵 ∧ (♯‘𝑥) = (𝑚 + 1))) → (𝜑[((𝑥 prefix ((♯‘𝑥) − 1)) ++ ⟨“(lastS‘𝑥)”⟩) / 𝑥]𝜑))
9282, 91mpbird 167 . . . . . . . 8 (((𝑚 ∈ ℕ0 ∧ ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒)) ∧ (𝑥 ∈ Word 𝐵 ∧ (♯‘𝑥) = (𝑚 + 1))) → 𝜑)
9392expr 375 . . . . . . 7 (((𝑚 ∈ ℕ0 ∧ ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒)) ∧ 𝑥 ∈ Word 𝐵) → ((♯‘𝑥) = (𝑚 + 1) → 𝜑))
9493ralrimiva 2623 . . . . . 6 ((𝑚 ∈ ℕ0 ∧ ∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒)) → ∀𝑥 ∈ Word 𝐵((♯‘𝑥) = (𝑚 + 1) → 𝜑))
9594ex 115 . . . . 5 (𝑚 ∈ ℕ0 → (∀𝑦 ∈ Word 𝐵((♯‘𝑦) = 𝑚𝜒) → ∀𝑥 ∈ Word 𝐵((♯‘𝑥) = (𝑚 + 1) → 𝜑)))
9625, 95biimtrid 152 . . . 4 (𝑚 ∈ ℕ0 → (∀𝑥 ∈ Word 𝐵((♯‘𝑥) = 𝑚𝜑) → ∀𝑥 ∈ Word 𝐵((♯‘𝑥) = (𝑚 + 1) → 𝜑)))
974, 7, 10, 13, 21, 96nn0ind 9762 . . 3 ((♯‘𝐴) ∈ ℕ0 → ∀𝑥 ∈ Word 𝐵((♯‘𝑥) = (♯‘𝐴) → 𝜑))
981, 97syl 14 . 2 (𝐴 ∈ Word 𝐵 → ∀𝑥 ∈ Word 𝐵((♯‘𝑥) = (♯‘𝐴) → 𝜑))
99 eqidd 2239 . 2 (𝐴 ∈ Word 𝐵 → (♯‘𝐴) = (♯‘𝐴))
100 fveqeq2 5704 . . . 4 (𝑥 = 𝐴 → ((♯‘𝑥) = (♯‘𝐴) ↔ (♯‘𝐴) = (♯‘𝐴)))
101 wrdind.4 . . . 4 (𝑥 = 𝐴 → (𝜑𝜏))
102100, 101imbi12d 234 . . 3 (𝑥 = 𝐴 → (((♯‘𝑥) = (♯‘𝐴) → 𝜑) ↔ ((♯‘𝐴) = (♯‘𝐴) → 𝜏)))
103102rspcv 2925 . 2 (𝐴 ∈ Word 𝐵 → (∀𝑥 ∈ Word 𝐵((♯‘𝑥) = (♯‘𝐴) → 𝜑) → ((♯‘𝐴) = (♯‘𝐴) → 𝜏)))
10498, 99, 103mp2d 47 1 (𝐴 ∈ Word 𝐵𝜏)
Colors of variables:    wff set class
This proof depends on syntax axioms:  wi 4  wa 104  wb 105   = wceq 1402  wcel 2209  wne 2420  wral 2528  [wsbc 3051  c0 3520   class class class wbr 4130  cfv 5377  (class class class)co 6085  Fincfn 7022  cc 8177  0cc0 8179  1c1 8180   + caddc 8182  cle 8361  cmin 8497  cn 9305  0cn0 9565  cz 9646  ...cfz 10413  ..^cfzo 10551  chash 11216  Word cword 11306  lastSclsw 11351   ++ cconcat 11360  ⟨“cs1 11385   prefix cpfx 11446
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-1o 6687  df-er 6807  df-en 7023  df-dom 7024  df-fin 7025  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8904  df-ap 8911  df-inn 9306  df-n0 9566  df-z 9647  df-uz 9924  df-fz 10414  df-fzo 10552  df-ihash 11217  df-word 11307  df-lsw 11352  df-concat 11361  df-s1 11386  df-substr 11420  df-pfx 11447
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator