| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > s1eqd | Structured version Visualization version GIF version | ||
| Description: Equality theorem for a singleton word. (Contributed by Mario Carneiro, 26-Feb-2016.) |
| Ref | Expression |
|---|---|
| s1eqd.1 | ⊢ (𝜑 → 𝐴 = 𝐵) |
| Ref | Expression |
|---|---|
| s1eqd | ⊢ (𝜑 → 〈“𝐴”〉 = 〈“𝐵”〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | s1eqd.1 | . 2 ⊢ (𝜑 → 𝐴 = 𝐵) | |
| 2 | s1eq 14727 | . 2 ⊢ (𝐴 = 𝐵 → 〈“𝐴”〉 = 〈“𝐵”〉) | |
| 3 | 1, 2 | syl 18 | 1 ⊢ (𝜑 → 〈“𝐴”〉 = 〈“𝐵”〉) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 〈“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: s1prc 14731 ccat1st1st 14756 swrds1 14796 swrdlsw 14797 reuccatpfxs1lem 14875 s2eqd 14994 s3eqd 14995 s4eqd 14996 s5eqd 14997 s6eqd 14998 s7eqd 14999 s8eqd 15000 frmdgsum 19038 psgnunilem5 19688 efgredlemc 19939 vrgpval 19961 vrgpinv 19963 frgpup2 19970 frgpup3lem 19971 pfx1s2 33488 pfxlsw2ccat 33495 ccatws1f1olast 33497 wrdpmtrlast 33636 1arithidomlem2 34050 iwrdsplit 35002 sseqval 35003 sseqf 35007 sseqp1 35010 signsvtn0 35182 signstfveq0 35189 mrsubcv 36244 |
| Copyright terms: Public domain | W3C validator |