| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ccatclab | GIF version | ||
| Description: The concatenation of words over two sets is a word over the union of those sets. (Contributed by Jim Kingdon, 19-Dec-2025.) |
| Ref | Expression |
|---|---|
| ccatclab | ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐵) → (𝑆 ++ 𝑇) ∈ Word (𝐴 ∪ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssun1 3392 | . . . 4 ⊢ 𝐴 ⊆ (𝐴 ∪ 𝐵) | |
| 2 | sswrd 11291 | . . . 4 ⊢ (𝐴 ⊆ (𝐴 ∪ 𝐵) → Word 𝐴 ⊆ Word (𝐴 ∪ 𝐵)) | |
| 3 | 1, 2 | ax-mp 5 | . . 3 ⊢ Word 𝐴 ⊆ Word (𝐴 ∪ 𝐵) |
| 4 | 3 | sseli 3244 | . 2 ⊢ (𝑆 ∈ Word 𝐴 → 𝑆 ∈ Word (𝐴 ∪ 𝐵)) |
| 5 | ssun2 3393 | . . . 4 ⊢ 𝐵 ⊆ (𝐴 ∪ 𝐵) | |
| 6 | sswrd 11291 | . . . 4 ⊢ (𝐵 ⊆ (𝐴 ∪ 𝐵) → Word 𝐵 ⊆ Word (𝐴 ∪ 𝐵)) | |
| 7 | 5, 6 | ax-mp 5 | . . 3 ⊢ Word 𝐵 ⊆ Word (𝐴 ∪ 𝐵) |
| 8 | 7 | sseli 3244 | . 2 ⊢ (𝑇 ∈ Word 𝐵 → 𝑇 ∈ Word (𝐴 ∪ 𝐵)) |
| 9 | ccatcl 11339 | . 2 ⊢ ((𝑆 ∈ Word (𝐴 ∪ 𝐵) ∧ 𝑇 ∈ Word (𝐴 ∪ 𝐵)) → (𝑆 ++ 𝑇) ∈ Word (𝐴 ∪ 𝐵)) | |
| 10 | 4, 8, 9 | syl2an 289 | 1 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐵) → (𝑆 ++ 𝑇) ∈ Word (𝐴 ∪ 𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∈ wcel 2209 ∪ cun 3218 ⊆ wss 3220 (class class class)co 6075 Word cword 11282 ++ cconcat 11336 |
| 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 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 4241 ax-sep 4244 ax-nul 4254 ax-pow 4306 ax-pr 4341 ax-un 4573 ax-setind 4679 ax-iinf 4730 ax-cnex 8260 ax-resscn 8261 ax-1cn 8262 ax-1re 8263 ax-icn 8264 ax-addcl 8265 ax-addrcl 8266 ax-mulcl 8267 ax-addcom 8269 ax-addass 8271 ax-distr 8273 ax-i2m1 8274 ax-0lt1 8275 ax-0id 8277 ax-rnegex 8278 ax-cnre 8280 ax-pre-ltirr 8281 ax-pre-ltwlin 8282 ax-pre-lttrn 8283 ax-pre-apti 8284 ax-pre-ltadd 8285 |
| This theorem 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 3636 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-int 3966 df-iun 4009 df-br 4126 df-opab 4188 df-mpt 4189 df-tr 4225 df-id 4433 df-iord 4506 df-on 4508 df-ilim 4509 df-suc 4511 df-iom 4733 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-rn 4780 df-res 4781 df-ima 4782 df-iota 5332 df-fun 5374 df-fn 5375 df-f 5376 df-f1 5377 df-fo 5378 df-f1o 5379 df-fv 5380 df-riota 6028 df-ov 6078 df-oprab 6079 df-mpo 6080 df-1st 6364 df-2nd 6365 df-recs 6566 df-frec 6652 df-1o 6677 df-er 6797 df-en 7013 df-dom 7014 df-fin 7015 df-pnf 8352 df-mnf 8353 df-xr 8354 df-ltxr 8355 df-le 8356 df-sub 8489 df-neg 8490 df-inn 9284 df-n0 9543 df-z 9624 df-uz 9901 df-fz 10391 df-fzo 10528 df-ihash 11193 df-word 11283 df-concat 11337 |
| This theorem is referenced by: ccat0 11342 |
| Copyright terms: Public domain | W3C validator |