| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > wrdl1s1 | GIF version | ||
| Description: A word of length 1 is a singleton word consisting of the first symbol of the word. (Contributed by AV, 22-Jul-2018.) (Proof shortened by AV, 14-Oct-2018.) |
| Ref | Expression |
|---|---|
| wrdl1s1 | ⊢ (𝑆 ∈ 𝑉 → (𝑊 = 〈“𝑆”〉 ↔ (𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = 1 ∧ (𝑊‘0) = 𝑆))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | s1cl 11197 | . . . 4 ⊢ (𝑆 ∈ 𝑉 → 〈“𝑆”〉 ∈ Word 𝑉) | |
| 2 | s1leng 11200 | . . . 4 ⊢ (𝑆 ∈ 𝑉 → (♯‘〈“𝑆”〉) = 1) | |
| 3 | s1fv 11202 | . . . 4 ⊢ (𝑆 ∈ 𝑉 → (〈“𝑆”〉‘0) = 𝑆) | |
| 4 | 1, 2, 3 | 3jca 1203 | . . 3 ⊢ (𝑆 ∈ 𝑉 → (〈“𝑆”〉 ∈ Word 𝑉 ∧ (♯‘〈“𝑆”〉) = 1 ∧ (〈“𝑆”〉‘0) = 𝑆)) |
| 5 | eleq1 2294 | . . . 4 ⊢ (𝑊 = 〈“𝑆”〉 → (𝑊 ∈ Word 𝑉 ↔ 〈“𝑆”〉 ∈ Word 𝑉)) | |
| 6 | fveqeq2 5648 | . . . 4 ⊢ (𝑊 = 〈“𝑆”〉 → ((♯‘𝑊) = 1 ↔ (♯‘〈“𝑆”〉) = 1)) | |
| 7 | fveq1 5638 | . . . . 5 ⊢ (𝑊 = 〈“𝑆”〉 → (𝑊‘0) = (〈“𝑆”〉‘0)) | |
| 8 | 7 | eqeq1d 2240 | . . . 4 ⊢ (𝑊 = 〈“𝑆”〉 → ((𝑊‘0) = 𝑆 ↔ (〈“𝑆”〉‘0) = 𝑆)) |
| 9 | 5, 6, 8 | 3anbi123d 1348 | . . 3 ⊢ (𝑊 = 〈“𝑆”〉 → ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = 1 ∧ (𝑊‘0) = 𝑆) ↔ (〈“𝑆”〉 ∈ Word 𝑉 ∧ (♯‘〈“𝑆”〉) = 1 ∧ (〈“𝑆”〉‘0) = 𝑆))) |
| 10 | 4, 9 | syl5ibrcom 157 | . 2 ⊢ (𝑆 ∈ 𝑉 → (𝑊 = 〈“𝑆”〉 → (𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = 1 ∧ (𝑊‘0) = 𝑆))) |
| 11 | eqs1 11204 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = 1) → 𝑊 = 〈“(𝑊‘0)”〉) | |
| 12 | s1eq 11195 | . . . . 5 ⊢ ((𝑊‘0) = 𝑆 → 〈“(𝑊‘0)”〉 = 〈“𝑆”〉) | |
| 13 | 12 | eqeq2d 2243 | . . . 4 ⊢ ((𝑊‘0) = 𝑆 → (𝑊 = 〈“(𝑊‘0)”〉 ↔ 𝑊 = 〈“𝑆”〉)) |
| 14 | 11, 13 | syl5ibcom 155 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = 1) → ((𝑊‘0) = 𝑆 → 𝑊 = 〈“𝑆”〉)) |
| 15 | 14 | 3impia 1226 | . 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = 1 ∧ (𝑊‘0) = 𝑆) → 𝑊 = 〈“𝑆”〉) |
| 16 | 10, 15 | impbid1 142 | 1 ⊢ (𝑆 ∈ 𝑉 → (𝑊 = 〈“𝑆”〉 ↔ (𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = 1 ∧ (𝑊‘0) = 𝑆))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1004 = wceq 1397 ∈ wcel 2202 ‘cfv 5326 0cc0 8031 1c1 8032 ♯chash 11036 Word cword 11112 〈“cs1 11191 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-nul 4215 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-iinf 4686 ax-cnex 8122 ax-resscn 8123 ax-1cn 8124 ax-1re 8125 ax-icn 8126 ax-addcl 8127 ax-addrcl 8128 ax-mulcl 8129 ax-addcom 8131 ax-addass 8133 ax-distr 8135 ax-i2m1 8136 ax-0lt1 8137 ax-0id 8139 ax-rnegex 8140 ax-cnre 8142 ax-pre-ltirr 8143 ax-pre-ltwlin 8144 ax-pre-lttrn 8145 ax-pre-apti 8146 ax-pre-ltadd 8147 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-if 3606 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-tr 4188 df-id 4390 df-iord 4463 df-on 4465 df-ilim 4466 df-suc 4468 df-iom 4689 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-riota 5970 df-ov 6020 df-oprab 6021 df-mpo 6022 df-1st 6302 df-2nd 6303 df-recs 6470 df-frec 6556 df-1o 6581 df-er 6701 df-en 6909 df-dom 6910 df-fin 6911 df-pnf 8215 df-mnf 8216 df-xr 8217 df-ltxr 8218 df-le 8219 df-sub 8351 df-neg 8352 df-inn 9143 df-n0 9402 df-z 9479 df-uz 9755 df-fz 10243 df-fzo 10377 df-ihash 11037 df-word 11113 df-s1 11192 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |