| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > s1eq | Structured version Visualization version GIF version | ||
| Description: Equality theorem for a singleton word. (Contributed by Mario Carneiro, 26-Feb-2016.) |
| Ref | Expression |
|---|---|
| s1eq | ⊢ (𝐴 = 𝐵 → 〈“𝐴”〉 = 〈“𝐵”〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fveq2 6877 | . . . 4 ⊢ (𝐴 = 𝐵 → ( I ‘𝐴) = ( I ‘𝐵)) | |
| 2 | 1 | opeq2d 4840 | . . 3 ⊢ (𝐴 = 𝐵 → 〈0, ( I ‘𝐴)〉 = 〈0, ( I ‘𝐵)〉) |
| 3 | 2 | sneqd 4596 | . 2 ⊢ (𝐴 = 𝐵 → {〈0, ( I ‘𝐴)〉} = {〈0, ( I ‘𝐵)〉}) |
| 4 | df-s1 14723 | . 2 ⊢ 〈“𝐴”〉 = {〈0, ( I ‘𝐴)〉} | |
| 5 | df-s1 14723 | . 2 ⊢ 〈“𝐵”〉 = {〈0, ( I ‘𝐵)〉} | |
| 6 | 3, 4, 5 | 3eqtr4g 2821 | 1 ⊢ (𝐴 = 𝐵 → 〈“𝐴”〉 = 〈“𝐵”〉) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 {csn 4584 〈cop 4590 I cid 5545 ‘cfv 6531 0cc0 11181 〈“cs1 14722 |
| 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-ext 2733 |
| 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-sb 2100 df-clab 2740 df-cleq 2753 df-clel 2836 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-iota 6487 df-fv 6539 df-s1 14723 |
| This theorem is used by: s1eqd 14728 wrdl1exs1 14741 wrdl1s1 14742 ccats1pfxeqrex 14844 wrdind 14851 wrd2ind 14852 reuccatpfxs1lem 14875 reuccatpfxs1 14876 revs1 14894 chninf 18789 vrmdval 19033 frgpup3lem 19971 vdegp1ci 30101 clwwlknonwwlknonb 30679 mrsubcv 36244 mrsubrn 36247 elmrsubrn 36254 mrsubvrs 36256 mvhval 36268 |
| Copyright terms: Public domain | W3C validator |