| 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 14462 | . . . 4 ⊢ (𝑊 ∈ Word 𝑉 → dom 𝑊 = (0..^(♯‘𝑊))) | |
| 2 | lencl 14474 | . . . . 5 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℕ0) | |
| 3 | 2 | nn0zd 12531 | . . . 4 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℤ) |
| 4 | simpr 484 | . . . . . . . . 9 ⊢ (((♯‘𝑊) ∈ ℤ ∧ 𝐼 ∈ ℤ) → 𝐼 ∈ ℤ) | |
| 5 | 0zd 12517 | . . . . . . . . 9 ⊢ (((♯‘𝑊) ∈ ℤ ∧ 𝐼 ∈ ℤ) → 0 ∈ ℤ) | |
| 6 | simpl 482 | . . . . . . . . 9 ⊢ (((♯‘𝑊) ∈ ℤ ∧ 𝐼 ∈ ℤ) → (♯‘𝑊) ∈ ℤ) | |
| 7 | nelfzo 13601 | . . . . . . . . 9 ⊢ ((𝐼 ∈ ℤ ∧ 0 ∈ ℤ ∧ (♯‘𝑊) ∈ ℤ) → (𝐼 ∉ (0..^(♯‘𝑊)) ↔ (𝐼 < 0 ∨ (♯‘𝑊) ≤ 𝐼))) | |
| 8 | 4, 5, 6, 7 | syl3anc 1373 | . . . . . . . 8 ⊢ (((♯‘𝑊) ∈ ℤ ∧ 𝐼 ∈ ℤ) → (𝐼 ∉ (0..^(♯‘𝑊)) ↔ (𝐼 < 0 ∨ (♯‘𝑊) ≤ 𝐼))) |
| 9 | 8 | biimpar 477 | . . . . . . 7 ⊢ ((((♯‘𝑊) ∈ ℤ ∧ 𝐼 ∈ ℤ) ∧ (𝐼 < 0 ∨ (♯‘𝑊) ≤ 𝐼)) → 𝐼 ∉ (0..^(♯‘𝑊))) |
| 10 | df-nel 3030 | . . . . . . 7 ⊢ (𝐼 ∉ (0..^(♯‘𝑊)) ↔ ¬ 𝐼 ∈ (0..^(♯‘𝑊))) | |
| 11 | 9, 10 | sylib 218 | . . . . . 6 ⊢ ((((♯‘𝑊) ∈ ℤ ∧ 𝐼 ∈ ℤ) ∧ (𝐼 < 0 ∨ (♯‘𝑊) ≤ 𝐼)) → ¬ 𝐼 ∈ (0..^(♯‘𝑊))) |
| 12 | eleq2 2817 | . . . . . . 7 ⊢ (dom 𝑊 = (0..^(♯‘𝑊)) → (𝐼 ∈ dom 𝑊 ↔ 𝐼 ∈ (0..^(♯‘𝑊)))) | |
| 13 | 12 | notbid 318 | . . . . . 6 ⊢ (dom 𝑊 = (0..^(♯‘𝑊)) → (¬ 𝐼 ∈ dom 𝑊 ↔ ¬ 𝐼 ∈ (0..^(♯‘𝑊)))) |
| 14 | 11, 13 | imbitrrid 246 | . . . . 5 ⊢ (dom 𝑊 = (0..^(♯‘𝑊)) → ((((♯‘𝑊) ∈ ℤ ∧ 𝐼 ∈ ℤ) ∧ (𝐼 < 0 ∨ (♯‘𝑊) ≤ 𝐼)) → ¬ 𝐼 ∈ dom 𝑊)) |
| 15 | 14 | exp4c 432 | . . . 4 ⊢ (dom 𝑊 = (0..^(♯‘𝑊)) → ((♯‘𝑊) ∈ ℤ → (𝐼 ∈ ℤ → ((𝐼 < 0 ∨ (♯‘𝑊) ≤ 𝐼) → ¬ 𝐼 ∈ dom 𝑊)))) |
| 16 | 1, 3, 15 | sylc 65 | . . 3 ⊢ (𝑊 ∈ Word 𝑉 → (𝐼 ∈ ℤ → ((𝐼 < 0 ∨ (♯‘𝑊) ≤ 𝐼) → ¬ 𝐼 ∈ dom 𝑊))) |
| 17 | 16 | imp 406 | . 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℤ) → ((𝐼 < 0 ∨ (♯‘𝑊) ≤ 𝐼) → ¬ 𝐼 ∈ dom 𝑊)) |
| 18 | ndmfv 6875 | . 2 ⊢ (¬ 𝐼 ∈ dom 𝑊 → (𝑊‘𝐼) = ∅) | |
| 19 | 17, 18 | syl6 35 | 1 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐼 ∈ ℤ) → ((𝐼 < 0 ∨ (♯‘𝑊) ≤ 𝐼) → (𝑊‘𝐼) = ∅)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 = wceq 1540 ∈ wcel 2109 ∉ wnel 3029 ∅c0 4292 class class class wbr 5102 dom cdm 5631 ‘cfv 6499 (class class class)co 7369 0cc0 11044 < clt 11184 ≤ cle 11185 ℤcz 12505 ..^cfzo 13591 ♯chash 14271 Word cword 14454 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5229 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-cnex 11100 ax-resscn 11101 ax-1cn 11102 ax-icn 11103 ax-addcl 11104 ax-addrcl 11105 ax-mulcl 11106 ax-mulrcl 11107 ax-mulcom 11108 ax-addass 11109 ax-mulass 11110 ax-distr 11111 ax-i2m1 11112 ax-1ne0 11113 ax-1rid 11114 ax-rnegex 11115 ax-rrecex 11116 ax-cnre 11117 ax-pre-lttri 11118 ax-pre-lttrn 11119 ax-pre-ltadd 11120 ax-pre-mulgt0 11121 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-int 4907 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6262 df-ord 6323 df-on 6324 df-lim 6325 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7326 df-ov 7372 df-oprab 7373 df-mpo 7374 df-om 7823 df-1st 7947 df-2nd 7948 df-frecs 8237 df-wrecs 8268 df-recs 8317 df-rdg 8355 df-1o 8411 df-er 8648 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-card 9868 df-pnf 11186 df-mnf 11187 df-xr 11188 df-ltxr 11189 df-le 11190 df-sub 11383 df-neg 11384 df-nn 12163 df-n0 12419 df-z 12506 df-uz 12770 df-fz 13445 df-fzo 13592 df-hash 14272 df-word 14455 |
| This theorem is referenced by: ccatsymb 14523 |
| Copyright terms: Public domain | W3C validator |