| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > s2rn | Structured version Visualization version GIF version | ||
| Description: Range of a length 2 string. (Contributed by Thierry Arnoux, 19-Sep-2023.) (Proof shortened by AV, 1-Aug-2025.) |
| Ref | Expression |
|---|---|
| s2rn.i | ⊢ (𝜑 → 𝐼 ∈ 𝐷) |
| s2rn.j | ⊢ (𝜑 → 𝐽 ∈ 𝐷) |
| Ref | Expression |
|---|---|
| s2rn | ⊢ (𝜑 → ran 〈“𝐼𝐽”〉 = {𝐼, 𝐽}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-s2 15041 | . . . 4 ⊢ 〈“𝐼𝐽”〉 = (〈“𝐼”〉 ++ 〈“𝐽”〉) | |
| 2 | 1 | a1i 11 | . . 3 ⊢ (𝜑 → 〈“𝐼𝐽”〉 = (〈“𝐼”〉 ++ 〈“𝐽”〉)) |
| 3 | 2 | rneqd 5932 | . 2 ⊢ (𝜑 → ran 〈“𝐼𝐽”〉 = ran (〈“𝐼”〉 ++ 〈“𝐽”〉)) |
| 4 | s1cli 14793 | . . . 4 ⊢ 〈“𝐼”〉 ∈ Word V | |
| 5 | s1cli 14793 | . . . 4 ⊢ 〈“𝐽”〉 ∈ Word V | |
| 6 | 4, 5 | pm3.2i 476 | . . 3 ⊢ (〈“𝐼”〉 ∈ Word V ∧ 〈“𝐽”〉 ∈ Word V) |
| 7 | ccatrn 14776 | . . 3 ⊢ ((〈“𝐼”〉 ∈ Word V ∧ 〈“𝐽”〉 ∈ Word V) → ran (〈“𝐼”〉 ++ 〈“𝐽”〉) = (ran 〈“𝐼”〉 ∪ ran 〈“𝐽”〉)) | |
| 8 | 6, 7 | mp1i 14 | . 2 ⊢ (𝜑 → ran (〈“𝐼”〉 ++ 〈“𝐽”〉) = (ran 〈“𝐼”〉 ∪ ran 〈“𝐽”〉)) |
| 9 | s2rn.i | . . . . 5 ⊢ (𝜑 → 𝐼 ∈ 𝐷) | |
| 10 | s1rn 14787 | . . . . 5 ⊢ (𝐼 ∈ 𝐷 → ran 〈“𝐼”〉 = {𝐼}) | |
| 11 | 9, 10 | syl 18 | . . . 4 ⊢ (𝜑 → ran 〈“𝐼”〉 = {𝐼}) |
| 12 | s2rn.j | . . . . 5 ⊢ (𝜑 → 𝐽 ∈ 𝐷) | |
| 13 | s1rn 14787 | . . . . 5 ⊢ (𝐽 ∈ 𝐷 → ran 〈“𝐽”〉 = {𝐽}) | |
| 14 | 12, 13 | syl 18 | . . . 4 ⊢ (𝜑 → ran 〈“𝐽”〉 = {𝐽}) |
| 15 | 11, 14 | uneq12d 4171 | . . 3 ⊢ (𝜑 → (ran 〈“𝐼”〉 ∪ ran 〈“𝐽”〉) = ({𝐼} ∪ {𝐽})) |
| 16 | df-pr 4591 | . . 3 ⊢ {𝐼, 𝐽} = ({𝐼} ∪ {𝐽}) | |
| 17 | 15, 16 | eqtr4di 2816 | . 2 ⊢ (𝜑 → (ran 〈“𝐼”〉 ∪ ran 〈“𝐽”〉) = {𝐼, 𝐽}) |
| 18 | 3, 8, 17 | 3eqtrd 2802 | 1 ⊢ (𝜑 → ran 〈“𝐼𝐽”〉 = {𝐼, 𝐽}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 Vcvv 3454 ∪ cun 4152 {csn 4588 {cpr 4590 ran crn 5659 (class class class)co 7451 Word cword 14699 ++ cconcat 14756 〈“cs1 14783 〈“cs2 15034 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-n0 12647 df-z 12734 df-uz 13006 df-fz 13680 df-fzo 13829 df-hash 14516 df-word 14700 df-concat 14757 df-s1 14784 df-s2 15041 |
| This theorem is used by: s3rn 15160 cycpm2tr 33779 cycpmco2 33793 cyc2fvx 33794 cyc3co2 33800 cyc3conja 33817 |
| Copyright terms: Public domain | W3C validator |