| 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 5404 | . . . 4 ⊢ {0} ∈ V | |
| 2 | 1 | a1i 11 | . . 3 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑇) → {0} ∈ V) |
| 3 | simpr 490 | . . 3 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑇) → 𝐵 ∈ 𝑇) | |
| 4 | simpll 779 | . . 3 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑇) ∧ 𝑖 ∈ {0}) → 𝐴 ∈ 𝑆) | |
| 5 | s1val 14665 | . . . . 5 ⊢ (𝐴 ∈ 𝑆 → 〈“𝐴”〉 = {〈0, 𝐴〉}) | |
| 6 | 0nn0 12543 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
| 7 | fmptsn 7165 | . . . . . 6 ⊢ ((0 ∈ ℕ0 ∧ 𝐴 ∈ 𝑆) → {〈0, 𝐴〉} = (𝑖 ∈ {0} ↦ 𝐴)) | |
| 8 | 6, 7 | mpan 703 | . . . . 5 ⊢ (𝐴 ∈ 𝑆 → {〈0, 𝐴〉} = (𝑖 ∈ {0} ↦ 𝐴)) |
| 9 | 5, 8 | eqtrd 2795 | . . . 4 ⊢ (𝐴 ∈ 𝑆 → 〈“𝐴”〉 = (𝑖 ∈ {0} ↦ 𝐴)) |
| 10 | 9 | adantr 486 | . . 3 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑇) → 〈“𝐴”〉 = (𝑖 ∈ {0} ↦ 𝐴)) |
| 11 | 2, 3, 4, 10 | ofcfval2 34614 | . 2 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑇) → (〈“𝐴”〉 ∘f/c 𝑅𝐵) = (𝑖 ∈ {0} ↦ (𝐴𝑅𝐵))) |
| 12 | ovex 7446 | . . . 4 ⊢ (𝐴𝑅𝐵) ∈ V | |
| 13 | s1val 14665 | . . . 4 ⊢ ((𝐴𝑅𝐵) ∈ V → 〈“(𝐴𝑅𝐵)”〉 = {〈0, (𝐴𝑅𝐵)〉}) | |
| 14 | 12, 13 | ax-mp 5 | . . 3 ⊢ 〈“(𝐴𝑅𝐵)”〉 = {〈0, (𝐴𝑅𝐵)〉} |
| 15 | fmptsn 7165 | . . . 4 ⊢ ((0 ∈ ℕ0 ∧ (𝐴𝑅𝐵) ∈ V) → {〈0, (𝐴𝑅𝐵)〉} = (𝑖 ∈ {0} ↦ (𝐴𝑅𝐵))) | |
| 16 | 6, 12, 15 | mp2an 705 | . . 3 ⊢ {〈0, (𝐴𝑅𝐵)〉} = (𝑖 ∈ {0} ↦ (𝐴𝑅𝐵)) |
| 17 | 14, 16 | eqtri 2783 | . 2 ⊢ 〈“(𝐴𝑅𝐵)”〉 = (𝑖 ∈ {0} ↦ (𝐴𝑅𝐵)) |
| 18 | 11, 17 | eqtr4di 2813 | 1 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑇) → (〈“𝐴”〉 ∘f/c 𝑅𝐵) = 〈“(𝐴𝑅𝐵)”〉) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 Vcvv 3450 {csn 4584 〈cop 4590 ↦ cmpt 5186 (class class class)co 7413 0cc0 11124 ℕ0cn0 12528 〈“cs1 14662 ∘f/c cofc 34605 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pr 5398 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-mulcl 11186 ax-i2m1 11192 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-ov 7416 df-oprab 7417 df-mpo 7418 df-n0 12529 df-s1 14663 df-ofc 34606 |
| This theorem is used by: ofcs2 35056 |
| Copyright terms: Public domain | W3C validator |