| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > s1val | Structured version Visualization version GIF version | ||
| Description: Value of a singleton word. (Contributed by Stefan O'Rear, 15-Aug-2015.) (Revised by Mario Carneiro, 26-Feb-2016.) |
| Ref | Expression |
|---|---|
| s1val | ⊢ (𝐴 ∈ 𝑉 → 〈“𝐴”〉 = {〈0, 𝐴〉}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-s1 14504 | . 2 ⊢ 〈“𝐴”〉 = {〈0, ( I ‘𝐴)〉} | |
| 2 | fvi 6898 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → ( I ‘𝐴) = 𝐴) | |
| 3 | 2 | opeq2d 4829 | . . 3 ⊢ (𝐴 ∈ 𝑉 → 〈0, ( I ‘𝐴)〉 = 〈0, 𝐴〉) |
| 4 | 3 | sneqd 4585 | . 2 ⊢ (𝐴 ∈ 𝑉 → {〈0, ( I ‘𝐴)〉} = {〈0, 𝐴〉}) |
| 5 | 1, 4 | eqtrid 2778 | 1 ⊢ (𝐴 ∈ 𝑉 → 〈“𝐴”〉 = {〈0, 𝐴〉}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2111 {csn 4573 〈cop 4579 I cid 5508 ‘cfv 6481 0cc0 11006 〈“cs1 14503 |
| 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 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-12 2180 ax-ext 2703 ax-sep 5232 ax-nul 5242 ax-pr 5368 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-ral 3048 df-rex 3057 df-rab 3396 df-v 3438 df-dif 3900 df-un 3902 df-ss 3914 df-nul 4281 df-if 4473 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4857 df-br 5090 df-opab 5152 df-id 5509 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-iota 6437 df-fun 6483 df-fv 6489 df-s1 14504 |
| This theorem is referenced by: s1rn 14507 s1cl 14510 s1dmALT 14517 s1fv 14518 s111 14523 repsw1 14690 s1co 14740 s2prop 14814 ofs1 14877 gsumws1 18746 uspgr1ewop 29226 usgr2v1e2w 29230 0wlkons1 30101 s1f1 32924 cshw1s2 32941 ofcs1 34557 signstf0 34581 |
| Copyright terms: Public domain | W3C validator |