| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > ofcs1 | Structured version Visualization version GIF version | ||
| Description: Letterwise operations on a single letter word. (Contributed by Thierry Arnoux, 7-Oct-2018.) |
| Ref | Expression |
|---|---|
| ofcs1 | ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑇) → (〈“𝐴”〉 ∘f/c 𝑅𝐵) = 〈“(𝐴𝑅𝐵)”〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | snex 5412 | . . . 4 ⊢ {0} ∈ V | |
| 2 | 1 | a1i 11 | . . 3 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑇) → {0} ∈ V) |
| 3 | simpr 490 | . . 3 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑇) → 𝐵 ∈ 𝑇) | |
| 4 | simpll 779 | . . 3 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑇) ∧ 𝑖 ∈ {0}) → 𝐴 ∈ 𝑆) | |
| 5 | s1val 14655 | . . . . 5 ⊢ (𝐴 ∈ 𝑆 → 〈“𝐴”〉 = {〈0, 𝐴〉}) | |
| 6 | 0nn0 12534 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
| 7 | fmptsn 7171 | . . . . . 6 ⊢ ((0 ∈ ℕ0 ∧ 𝐴 ∈ 𝑆) → {〈0, 𝐴〉} = (𝑖 ∈ {0} ↦ 𝐴)) | |
| 8 | 6, 7 | mpan 703 | . . . . 5 ⊢ (𝐴 ∈ 𝑆 → {〈0, 𝐴〉} = (𝑖 ∈ {0} ↦ 𝐴)) |
| 9 | 5, 8 | eqtrd 2800 | . . . 4 ⊢ (𝐴 ∈ 𝑆 → 〈“𝐴”〉 = (𝑖 ∈ {0} ↦ 𝐴)) |
| 10 | 9 | adantr 486 | . . 3 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑇) → 〈“𝐴”〉 = (𝑖 ∈ {0} ↦ 𝐴)) |
| 11 | 2, 3, 4, 10 | ofcfval2 34558 | . 2 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑇) → (〈“𝐴”〉 ∘f/c 𝑅𝐵) = (𝑖 ∈ {0} ↦ (𝐴𝑅𝐵))) |
| 12 | ovex 7452 | . . . 4 ⊢ (𝐴𝑅𝐵) ∈ V | |
| 13 | s1val 14655 | . . . 4 ⊢ ((𝐴𝑅𝐵) ∈ V → 〈“(𝐴𝑅𝐵)”〉 = {〈0, (𝐴𝑅𝐵)〉}) | |
| 14 | 12, 13 | ax-mp 5 | . . 3 ⊢ 〈“(𝐴𝑅𝐵)”〉 = {〈0, (𝐴𝑅𝐵)〉} |
| 15 | fmptsn 7171 | . . . 4 ⊢ ((0 ∈ ℕ0 ∧ (𝐴𝑅𝐵) ∈ V) → {〈0, (𝐴𝑅𝐵)〉} = (𝑖 ∈ {0} ↦ (𝐴𝑅𝐵))) | |
| 16 | 6, 12, 15 | mp2an 705 | . . 3 ⊢ {〈0, (𝐴𝑅𝐵)〉} = (𝑖 ∈ {0} ↦ (𝐴𝑅𝐵)) |
| 17 | 14, 16 | eqtri 2788 | . 2 ⊢ 〈“(𝐴𝑅𝐵)”〉 = (𝑖 ∈ {0} ↦ (𝐴𝑅𝐵)) |
| 18 | 11, 17 | eqtr4di 2818 | 1 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑇) → (〈“𝐴”〉 ∘f/c 𝑅𝐵) = 〈“(𝐴𝑅𝐵)”〉) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 Vcvv 3457 {csn 4591 〈cop 4597 ↦ cmpt 5194 (class class class)co 7419 0cc0 11115 ℕ0cn0 12519 〈“cs1 14652 ∘f/c cofc 34549 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pr 5406 ax-1cn 11173 ax-icn 11174 ax-addcl 11175 ax-mulcl 11177 ax-i2m1 11183 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-ov 7422 df-oprab 7423 df-mpo 7424 df-n0 12520 df-s1 14653 df-ofc 34550 |
| This theorem is used by: ofcs2 35000 |
| Copyright terms: Public domain | W3C validator |