| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > s1s7d | GIF version | ||
| Description: Concatenation of fixed length strings. (Contributed by Mario Carneiro, 26-Feb-2016.) |
| Ref | Expression |
|---|---|
| s1s2d.a | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| s1s2d.b | ⊢ (𝜑 → 𝐵 ∈ 𝑊) |
| s1s2d.c | ⊢ (𝜑 → 𝐶 ∈ 𝑋) |
| s1s3d.d | ⊢ (𝜑 → 𝐷 ∈ 𝑌) |
| s1s4d.e | ⊢ (𝜑 → 𝐸 ∈ 𝑍) |
| s1s5d.f | ⊢ (𝜑 → 𝐹 ∈ 𝑃) |
| s1s6d.g | ⊢ (𝜑 → 𝐺 ∈ 𝑄) |
| s1s7d.h | ⊢ (𝜑 → 𝐻 ∈ 𝑅) |
| Ref | Expression |
|---|---|
| s1s7d | ⊢ (𝜑 → 〈“𝐴𝐵𝐶𝐷𝐸𝐹𝐺𝐻”〉 = (〈“𝐴”〉 ++ 〈“𝐵𝐶𝐷𝐸𝐹𝐺𝐻”〉)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-s7 11391 | . 2 ⊢ 〈“𝐵𝐶𝐷𝐸𝐹𝐺𝐻”〉 = (〈“𝐵𝐶𝐷𝐸𝐹𝐺”〉 ++ 〈“𝐻”〉) | |
| 2 | s1s2d.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 3 | 2 | elexd 2817 | . . 3 ⊢ (𝜑 → 𝐴 ∈ V) |
| 4 | 3 | s1cld 11248 | . 2 ⊢ (𝜑 → 〈“𝐴”〉 ∈ Word V) |
| 5 | s1s2d.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑊) | |
| 6 | 5 | elexd 2817 | . . 3 ⊢ (𝜑 → 𝐵 ∈ V) |
| 7 | s1s2d.c | . . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑋) | |
| 8 | 7 | elexd 2817 | . . 3 ⊢ (𝜑 → 𝐶 ∈ V) |
| 9 | s1s3d.d | . . . 4 ⊢ (𝜑 → 𝐷 ∈ 𝑌) | |
| 10 | 9 | elexd 2817 | . . 3 ⊢ (𝜑 → 𝐷 ∈ V) |
| 11 | s1s4d.e | . . . 4 ⊢ (𝜑 → 𝐸 ∈ 𝑍) | |
| 12 | 11 | elexd 2817 | . . 3 ⊢ (𝜑 → 𝐸 ∈ V) |
| 13 | s1s5d.f | . . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝑃) | |
| 14 | 13 | elexd 2817 | . . 3 ⊢ (𝜑 → 𝐹 ∈ V) |
| 15 | s1s6d.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ 𝑄) | |
| 16 | 15 | elexd 2817 | . . 3 ⊢ (𝜑 → 𝐺 ∈ V) |
| 17 | 6, 8, 10, 12, 14, 16 | s6cld 11412 | . 2 ⊢ (𝜑 → 〈“𝐵𝐶𝐷𝐸𝐹𝐺”〉 ∈ Word V) |
| 18 | s1s7d.h | . 2 ⊢ (𝜑 → 𝐻 ∈ 𝑅) | |
| 19 | df-s8 11392 | . . 3 ⊢ 〈“𝐴𝐵𝐶𝐷𝐸𝐹𝐺𝐻”〉 = (〈“𝐴𝐵𝐶𝐷𝐸𝐹𝐺”〉 ++ 〈“𝐻”〉) | |
| 20 | 19 | a1i 9 | . 2 ⊢ (𝜑 → 〈“𝐴𝐵𝐶𝐷𝐸𝐹𝐺𝐻”〉 = (〈“𝐴𝐵𝐶𝐷𝐸𝐹𝐺”〉 ++ 〈“𝐻”〉)) |
| 21 | 2, 5, 7, 9, 11, 13, 15 | s1s6d 11428 | . 2 ⊢ (𝜑 → 〈“𝐴𝐵𝐶𝐷𝐸𝐹𝐺”〉 = (〈“𝐴”〉 ++ 〈“𝐵𝐶𝐷𝐸𝐹𝐺”〉)) |
| 22 | 1, 4, 17, 18, 20, 21 | cats1catd 11398 | 1 ⊢ (𝜑 → 〈“𝐴𝐵𝐶𝐷𝐸𝐹𝐺𝐻”〉 = (〈“𝐴”〉 ++ 〈“𝐵𝐶𝐷𝐸𝐹𝐺𝐻”〉)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 ∈ wcel 2202 Vcvv 2803 (class class class)co 6028 ++ cconcat 11216 〈“cs1 11241 〈“cs6 11383 〈“cs7 11384 〈“cs8 11385 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-nul 4220 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-iinf 4692 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-addcom 8175 ax-addass 8177 ax-distr 8179 ax-i2m1 8180 ax-0lt1 8181 ax-0id 8183 ax-rnegex 8184 ax-cnre 8186 ax-pre-ltirr 8187 ax-pre-ltwlin 8188 ax-pre-lttrn 8189 ax-pre-apti 8190 ax-pre-ltadd 8191 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-if 3608 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-tr 4193 df-id 4396 df-iord 4469 df-on 4471 df-ilim 4472 df-suc 4474 df-iom 4695 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-recs 6514 df-frec 6600 df-1o 6625 df-er 6745 df-en 6953 df-dom 6954 df-fin 6955 df-pnf 8258 df-mnf 8259 df-xr 8260 df-ltxr 8261 df-le 8262 df-sub 8394 df-neg 8395 df-inn 9186 df-n0 9445 df-z 9524 df-uz 9800 df-fz 10289 df-fzo 10423 df-ihash 11084 df-word 11163 df-concat 11217 df-s1 11242 df-s2 11386 df-s3 11387 df-s4 11388 df-s5 11389 df-s6 11390 df-s7 11391 df-s8 11392 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |