| 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 6883 | . . . 4 ⊢ (𝐴 = 𝐵 → ( I ‘𝐴) = ( I ‘𝐵)) | |
| 2 | 1 | opeq2d 4846 | . . 3 ⊢ (𝐴 = 𝐵 → 〈0, ( I ‘𝐴)〉 = 〈0, ( I ‘𝐵)〉) |
| 3 | 2 | sneqd 4602 | . 2 ⊢ (𝐴 = 𝐵 → {〈0, ( I ‘𝐴)〉} = {〈0, ( I ‘𝐵)〉}) |
| 4 | df-s1 14636 | . 2 ⊢ 〈“𝐴”〉 = {〈0, ( I ‘𝐴)〉} | |
| 5 | df-s1 14636 | . 2 ⊢ 〈“𝐵”〉 = {〈0, ( I ‘𝐵)〉} | |
| 6 | 3, 4, 5 | 3eqtr4g 2823 | 1 ⊢ (𝐴 = 𝐵 → 〈“𝐴”〉 = 〈“𝐵”〉) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1570 {csn 4590 〈cop 4596 I cid 5557 ‘cfv 6538 0cc0 11101 〈“cs1 14635 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-rab 3417 df-v 3457 df-dif 3909 df-un 3911 df-ss 3923 df-nul 4288 df-if 4489 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-br 5111 df-iota 6494 df-fv 6546 df-s1 14636 |
| This theorem is referenced by: s1eqd 14641 wrdl1exs1 14653 wrdl1s1 14654 ccats1pfxeqrex 14754 wrdind 14761 wrd2ind 14762 reuccatpfxs1lem 14785 reuccatpfxs1 14786 revs1 14804 chninf 18692 vrmdval 18917 frgpup3lem 19848 vdegp1ci 29869 clwwlknonwwlknonb 30438 mrsubcv 35983 mrsubrn 35986 elmrsubrn 35993 mrsubvrs 35995 mvhval 36007 |
| Copyright terms: Public domain | W3C validator |