Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ofs1 | Structured version Visualization version GIF version |
Description: Letterwise operations on a single letter word. (Contributed by Thierry Arnoux, 7-Oct-2018.) |
Ref | Expression |
---|---|
ofs1 | ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑇) → (〈“𝐴”〉 ∘f 𝑅〈“𝐵”〉) = 〈“(𝐴𝑅𝐵)”〉) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | snex 5376 | . . . 4 ⊢ {0} ∈ V | |
2 | 1 | a1i 11 | . . 3 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑇) → {0} ∈ V) |
3 | simpll 764 | . . 3 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑇) ∧ 𝑖 ∈ {0}) → 𝐴 ∈ 𝑆) | |
4 | simplr 766 | . . 3 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑇) ∧ 𝑖 ∈ {0}) → 𝐵 ∈ 𝑇) | |
5 | s1val 14402 | . . . . 5 ⊢ (𝐴 ∈ 𝑆 → 〈“𝐴”〉 = {〈0, 𝐴〉}) | |
6 | 0nn0 12349 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
7 | fmptsn 7095 | . . . . . 6 ⊢ ((0 ∈ ℕ0 ∧ 𝐴 ∈ 𝑆) → {〈0, 𝐴〉} = (𝑖 ∈ {0} ↦ 𝐴)) | |
8 | 6, 7 | mpan 687 | . . . . 5 ⊢ (𝐴 ∈ 𝑆 → {〈0, 𝐴〉} = (𝑖 ∈ {0} ↦ 𝐴)) |
9 | 5, 8 | eqtrd 2776 | . . . 4 ⊢ (𝐴 ∈ 𝑆 → 〈“𝐴”〉 = (𝑖 ∈ {0} ↦ 𝐴)) |
10 | 9 | adantr 481 | . . 3 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑇) → 〈“𝐴”〉 = (𝑖 ∈ {0} ↦ 𝐴)) |
11 | s1val 14402 | . . . . 5 ⊢ (𝐵 ∈ 𝑇 → 〈“𝐵”〉 = {〈0, 𝐵〉}) | |
12 | fmptsn 7095 | . . . . . 6 ⊢ ((0 ∈ ℕ0 ∧ 𝐵 ∈ 𝑇) → {〈0, 𝐵〉} = (𝑖 ∈ {0} ↦ 𝐵)) | |
13 | 6, 12 | mpan 687 | . . . . 5 ⊢ (𝐵 ∈ 𝑇 → {〈0, 𝐵〉} = (𝑖 ∈ {0} ↦ 𝐵)) |
14 | 11, 13 | eqtrd 2776 | . . . 4 ⊢ (𝐵 ∈ 𝑇 → 〈“𝐵”〉 = (𝑖 ∈ {0} ↦ 𝐵)) |
15 | 14 | adantl 482 | . . 3 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑇) → 〈“𝐵”〉 = (𝑖 ∈ {0} ↦ 𝐵)) |
16 | 2, 3, 4, 10, 15 | offval2 7615 | . 2 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑇) → (〈“𝐴”〉 ∘f 𝑅〈“𝐵”〉) = (𝑖 ∈ {0} ↦ (𝐴𝑅𝐵))) |
17 | ovex 7370 | . . . 4 ⊢ (𝐴𝑅𝐵) ∈ V | |
18 | s1val 14402 | . . . 4 ⊢ ((𝐴𝑅𝐵) ∈ V → 〈“(𝐴𝑅𝐵)”〉 = {〈0, (𝐴𝑅𝐵)〉}) | |
19 | 17, 18 | ax-mp 5 | . . 3 ⊢ 〈“(𝐴𝑅𝐵)”〉 = {〈0, (𝐴𝑅𝐵)〉} |
20 | fmptsn 7095 | . . . 4 ⊢ ((0 ∈ ℕ0 ∧ (𝐴𝑅𝐵) ∈ V) → {〈0, (𝐴𝑅𝐵)〉} = (𝑖 ∈ {0} ↦ (𝐴𝑅𝐵))) | |
21 | 6, 17, 20 | mp2an 689 | . . 3 ⊢ {〈0, (𝐴𝑅𝐵)〉} = (𝑖 ∈ {0} ↦ (𝐴𝑅𝐵)) |
22 | 19, 21 | eqtri 2764 | . 2 ⊢ 〈“(𝐴𝑅𝐵)”〉 = (𝑖 ∈ {0} ↦ (𝐴𝑅𝐵)) |
23 | 16, 22 | eqtr4di 2794 | 1 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑇) → (〈“𝐴”〉 ∘f 𝑅〈“𝐵”〉) = 〈“(𝐴𝑅𝐵)”〉) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1540 ∈ wcel 2105 Vcvv 3441 {csn 4573 〈cop 4579 ↦ cmpt 5175 (class class class)co 7337 ∘f cof 7593 0cc0 10972 ℕ0cn0 12334 〈“cs1 14399 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2707 ax-rep 5229 ax-sep 5243 ax-nul 5250 ax-pr 5372 ax-1cn 11030 ax-icn 11031 ax-addcl 11032 ax-mulcl 11034 ax-i2m1 11040 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2886 df-ne 2941 df-ral 3062 df-rex 3071 df-reu 3350 df-rab 3404 df-v 3443 df-sbc 3728 df-csb 3844 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4270 df-if 4474 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4853 df-iun 4943 df-br 5093 df-opab 5155 df-mpt 5176 df-id 5518 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-iota 6431 df-fun 6481 df-fn 6482 df-f 6483 df-f1 6484 df-fo 6485 df-f1o 6486 df-fv 6487 df-ov 7340 df-oprab 7341 df-mpo 7342 df-of 7595 df-n0 12335 df-s1 14400 |
This theorem is referenced by: ofs2 14781 |
Copyright terms: Public domain | W3C validator |