![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > wrdsymb0 | Structured version Visualization version GIF version |
Description: A symbol at a position "outside" of a word. (Contributed by Alexander van der Vekens, 26-May-2018.) (Proof shortened by AV, 2-May-2020.) |
Ref | Expression |
---|---|
wrdsymb0 | ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℤ) → ((𝐼 < 0 ∨ (♯‘𝑊) ≤ 𝐼) → (𝑊‘𝐼) = ∅)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | wrddm 13677 | . . . 4 ⊢ (𝑊 ∈ Word 𝑉 → dom 𝑊 = (0..^(♯‘𝑊))) | |
2 | lencl 13692 | . . . . 5 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℕ0) | |
3 | 2 | nn0zd 11896 | . . . 4 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℤ) |
4 | simpr 477 | . . . . . . . . 9 ⊢ (((♯‘𝑊) ∈ ℤ ∧ 𝐼 ∈ ℤ) → 𝐼 ∈ ℤ) | |
5 | 0zd 11803 | . . . . . . . . 9 ⊢ (((♯‘𝑊) ∈ ℤ ∧ 𝐼 ∈ ℤ) → 0 ∈ ℤ) | |
6 | simpl 475 | . . . . . . . . 9 ⊢ (((♯‘𝑊) ∈ ℤ ∧ 𝐼 ∈ ℤ) → (♯‘𝑊) ∈ ℤ) | |
7 | nelfzo 12857 | . . . . . . . . 9 ⊢ ((𝐼 ∈ ℤ ∧ 0 ∈ ℤ ∧ (♯‘𝑊) ∈ ℤ) → (𝐼 ∉ (0..^(♯‘𝑊)) ↔ (𝐼 < 0 ∨ (♯‘𝑊) ≤ 𝐼))) | |
8 | 4, 5, 6, 7 | syl3anc 1351 | . . . . . . . 8 ⊢ (((♯‘𝑊) ∈ ℤ ∧ 𝐼 ∈ ℤ) → (𝐼 ∉ (0..^(♯‘𝑊)) ↔ (𝐼 < 0 ∨ (♯‘𝑊) ≤ 𝐼))) |
9 | 8 | biimpar 470 | . . . . . . 7 ⊢ ((((♯‘𝑊) ∈ ℤ ∧ 𝐼 ∈ ℤ) ∧ (𝐼 < 0 ∨ (♯‘𝑊) ≤ 𝐼)) → 𝐼 ∉ (0..^(♯‘𝑊))) |
10 | df-nel 3068 | . . . . . . 7 ⊢ (𝐼 ∉ (0..^(♯‘𝑊)) ↔ ¬ 𝐼 ∈ (0..^(♯‘𝑊))) | |
11 | 9, 10 | sylib 210 | . . . . . 6 ⊢ ((((♯‘𝑊) ∈ ℤ ∧ 𝐼 ∈ ℤ) ∧ (𝐼 < 0 ∨ (♯‘𝑊) ≤ 𝐼)) → ¬ 𝐼 ∈ (0..^(♯‘𝑊))) |
12 | eleq2 2848 | . . . . . . 7 ⊢ (dom 𝑊 = (0..^(♯‘𝑊)) → (𝐼 ∈ dom 𝑊 ↔ 𝐼 ∈ (0..^(♯‘𝑊)))) | |
13 | 12 | notbid 310 | . . . . . 6 ⊢ (dom 𝑊 = (0..^(♯‘𝑊)) → (¬ 𝐼 ∈ dom 𝑊 ↔ ¬ 𝐼 ∈ (0..^(♯‘𝑊)))) |
14 | 11, 13 | syl5ibr 238 | . . . . 5 ⊢ (dom 𝑊 = (0..^(♯‘𝑊)) → ((((♯‘𝑊) ∈ ℤ ∧ 𝐼 ∈ ℤ) ∧ (𝐼 < 0 ∨ (♯‘𝑊) ≤ 𝐼)) → ¬ 𝐼 ∈ dom 𝑊)) |
15 | 14 | exp4c 425 | . . . 4 ⊢ (dom 𝑊 = (0..^(♯‘𝑊)) → ((♯‘𝑊) ∈ ℤ → (𝐼 ∈ ℤ → ((𝐼 < 0 ∨ (♯‘𝑊) ≤ 𝐼) → ¬ 𝐼 ∈ dom 𝑊)))) |
16 | 1, 3, 15 | sylc 65 | . . 3 ⊢ (𝑊 ∈ Word 𝑉 → (𝐼 ∈ ℤ → ((𝐼 < 0 ∨ (♯‘𝑊) ≤ 𝐼) → ¬ 𝐼 ∈ dom 𝑊))) |
17 | 16 | imp 398 | . 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℤ) → ((𝐼 < 0 ∨ (♯‘𝑊) ≤ 𝐼) → ¬ 𝐼 ∈ dom 𝑊)) |
18 | ndmfv 6526 | . 2 ⊢ (¬ 𝐼 ∈ dom 𝑊 → (𝑊‘𝐼) = ∅) | |
19 | 17, 18 | syl6 35 | 1 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℤ) → ((𝐼 < 0 ∨ (♯‘𝑊) ≤ 𝐼) → (𝑊‘𝐼) = ∅)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 198 ∧ wa 387 ∨ wo 833 = wceq 1507 ∈ wcel 2050 ∉ wnel 3067 ∅c0 4172 class class class wbr 4925 dom cdm 5403 ‘cfv 6185 (class class class)co 6974 0cc0 10333 < clt 10472 ≤ cle 10473 ℤcz 11791 ..^cfzo 12847 ♯chash 13503 Word cword 13670 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1758 ax-4 1772 ax-5 1869 ax-6 1928 ax-7 1965 ax-8 2052 ax-9 2059 ax-10 2079 ax-11 2093 ax-12 2106 ax-13 2301 ax-ext 2744 ax-rep 5045 ax-sep 5056 ax-nul 5063 ax-pow 5115 ax-pr 5182 ax-un 7277 ax-cnex 10389 ax-resscn 10390 ax-1cn 10391 ax-icn 10392 ax-addcl 10393 ax-addrcl 10394 ax-mulcl 10395 ax-mulrcl 10396 ax-mulcom 10397 ax-addass 10398 ax-mulass 10399 ax-distr 10400 ax-i2m1 10401 ax-1ne0 10402 ax-1rid 10403 ax-rnegex 10404 ax-rrecex 10405 ax-cnre 10406 ax-pre-lttri 10407 ax-pre-lttrn 10408 ax-pre-ltadd 10409 ax-pre-mulgt0 10410 |
This theorem depends on definitions: df-bi 199 df-an 388 df-or 834 df-3or 1069 df-3an 1070 df-tru 1510 df-ex 1743 df-nf 1747 df-sb 2016 df-mo 2547 df-eu 2584 df-clab 2753 df-cleq 2765 df-clel 2840 df-nfc 2912 df-ne 2962 df-nel 3068 df-ral 3087 df-rex 3088 df-reu 3089 df-rab 3091 df-v 3411 df-sbc 3676 df-csb 3781 df-dif 3826 df-un 3828 df-in 3830 df-ss 3837 df-pss 3839 df-nul 4173 df-if 4345 df-pw 4418 df-sn 4436 df-pr 4438 df-tp 4440 df-op 4442 df-uni 4709 df-int 4746 df-iun 4790 df-br 4926 df-opab 4988 df-mpt 5005 df-tr 5027 df-id 5308 df-eprel 5313 df-po 5322 df-so 5323 df-fr 5362 df-we 5364 df-xp 5409 df-rel 5410 df-cnv 5411 df-co 5412 df-dm 5413 df-rn 5414 df-res 5415 df-ima 5416 df-pred 5983 df-ord 6029 df-on 6030 df-lim 6031 df-suc 6032 df-iota 6149 df-fun 6187 df-fn 6188 df-f 6189 df-f1 6190 df-fo 6191 df-f1o 6192 df-fv 6193 df-riota 6935 df-ov 6977 df-oprab 6978 df-mpo 6979 df-om 7395 df-1st 7499 df-2nd 7500 df-wrecs 7748 df-recs 7810 df-rdg 7848 df-1o 7903 df-oadd 7907 df-er 8087 df-en 8305 df-dom 8306 df-sdom 8307 df-fin 8308 df-card 9160 df-pnf 10474 df-mnf 10475 df-xr 10476 df-ltxr 10477 df-le 10478 df-sub 10670 df-neg 10671 df-nn 11438 df-n0 11706 df-z 11792 df-uz 12057 df-fz 12707 df-fzo 12848 df-hash 13504 df-word 13671 |
This theorem is referenced by: ccatsymb 13743 |
Copyright terms: Public domain | W3C validator |