![]() |
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 6847 | . . . 4 ⊢ (𝐴 = 𝐵 → ( I ‘𝐴) = ( I ‘𝐵)) | |
2 | 1 | opeq2d 4842 | . . 3 ⊢ (𝐴 = 𝐵 → 〈0, ( I ‘𝐴)〉 = 〈0, ( I ‘𝐵)〉) |
3 | 2 | sneqd 4603 | . 2 ⊢ (𝐴 = 𝐵 → {〈0, ( I ‘𝐴)〉} = {〈0, ( I ‘𝐵)〉}) |
4 | df-s1 14496 | . 2 ⊢ 〈“𝐴”〉 = {〈0, ( I ‘𝐴)〉} | |
5 | df-s1 14496 | . 2 ⊢ 〈“𝐵”〉 = {〈0, ( I ‘𝐵)〉} | |
6 | 3, 4, 5 | 3eqtr4g 2796 | 1 ⊢ (𝐴 = 𝐵 → 〈“𝐴”〉 = 〈“𝐵”〉) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1541 {csn 4591 〈cop 4597 I cid 5535 ‘cfv 6501 0cc0 11060 〈“cs1 14495 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2702 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-sb 2068 df-clab 2709 df-cleq 2723 df-clel 2809 df-rab 3406 df-v 3448 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4288 df-if 4492 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4871 df-br 5111 df-iota 6453 df-fv 6509 df-s1 14496 |
This theorem is referenced by: s1eqd 14501 wrdl1exs1 14513 wrdl1s1 14514 ccats1pfxeqrex 14615 wrdind 14622 wrd2ind 14623 reuccatpfxs1lem 14646 reuccatpfxs1 14647 revs1 14665 vrmdval 18681 frgpup3lem 19573 vdegp1ci 28549 clwwlknonwwlknonb 29113 mrsubcv 34191 mrsubrn 34194 elmrsubrn 34201 mrsubvrs 34203 mvhval 34215 |
Copyright terms: Public domain | W3C validator |