| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > iswrdsymb | GIF version | ||
| Description: An arbitrary word is a word over an alphabet if all of its symbols belong to the alphabet. (Contributed by AV, 23-Jan-2021.) |
| Ref | Expression |
|---|---|
| iswrdsymb | ⊢ ((𝑊 ∈ Word V ∧ ∀𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ∈ 𝑉) → 𝑊 ∈ Word 𝑉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | wrdfn 11344 | . . . 4 ⊢ (𝑊 ∈ Word V → 𝑊 Fn (0..^(♯‘𝑊))) | |
| 2 | 1 | anim1i 340 | . . 3 ⊢ ((𝑊 ∈ Word V ∧ ∀𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ∈ 𝑉) → (𝑊 Fn (0..^(♯‘𝑊)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ∈ 𝑉)) |
| 3 | ffnfv 5872 | . . 3 ⊢ (𝑊:(0..^(♯‘𝑊))⟶𝑉 ↔ (𝑊 Fn (0..^(♯‘𝑊)) ∧ ∀𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ∈ 𝑉)) | |
| 4 | 2, 3 | sylibr 134 | . 2 ⊢ ((𝑊 ∈ Word V ∧ ∀𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ∈ 𝑉) → 𝑊:(0..^(♯‘𝑊))⟶𝑉) |
| 5 | lencl 11333 | . . 3 ⊢ (𝑊 ∈ Word V → (♯‘𝑊) ∈ ℕ0) | |
| 6 | 5 | adantr 276 | . 2 ⊢ ((𝑊 ∈ Word V ∧ ∀𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ∈ 𝑉) → (♯‘𝑊) ∈ ℕ0) |
| 7 | iswrdinn0 11334 | . 2 ⊢ ((𝑊:(0..^(♯‘𝑊))⟶𝑉 ∧ (♯‘𝑊) ∈ ℕ0) → 𝑊 ∈ Word 𝑉) | |
| 8 | 4, 6, 7 | syl2anc 415 | 1 ⊢ ((𝑊 ∈ Word V ∧ ∀𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ∈ 𝑉) → 𝑊 ∈ Word 𝑉) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 ∈ wcel 2209 ∀wral 2528 Vcvv 2821 Fn wfn 5378 ⟶wf 5379 ‘cfv 5383 (class class class)co 6091 0cc0 8189 ℕ0cn0 9578 ..^cfzo 10569 ♯chash 11239 Word cword 11329 |
| 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 4248 ax-sep 4251 ax-nul 4261 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-iinf 4737 ax-cnex 8280 ax-resscn 8281 ax-1cn 8282 ax-1re 8283 ax-icn 8284 ax-addcl 8285 ax-addrcl 8286 ax-mulcl 8287 ax-addcom 8289 ax-addass 8291 ax-distr 8293 ax-i2m1 8294 ax-0lt1 8295 ax-0id 8297 ax-rnegex 8298 ax-cnre 8300 ax-pre-ltirr 8301 ax-pre-ltwlin 8302 ax-pre-lttrn 8303 ax-pre-apti 8304 ax-pre-ltadd 8305 |
| 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 4132 df-opab 4194 df-mpt 4195 df-tr 4232 df-id 4440 df-iord 4513 df-on 4515 df-ilim 4516 df-suc 4518 df-iom 4740 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5343 df-fun 5385 df-fn 5386 df-f 5387 df-f1 5388 df-fo 5389 df-f1o 5390 df-fv 5391 df-riota 6044 df-ov 6094 df-oprab 6095 df-mpo 6096 df-1st 6381 df-2nd 6382 df-recs 6584 df-frec 6670 df-1o 6695 df-er 6815 df-en 7032 df-dom 7033 df-fin 7034 df-pnf 8372 df-mnf 8373 df-xr 8374 df-ltxr 8375 df-le 8376 df-sub 8510 df-neg 8511 df-inn 9318 df-n0 9579 df-z 9658 df-uz 9941 df-fz 10432 df-fzo 10570 df-ihash 11240 df-word 11330 |
| This theorem is used by: ccatalpha 11406 |
| Copyright terms: Public domain | W3C validator |