![]() |
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 14644 | . 2 ⊢ 〈“𝐴”〉 = {〈0, ( I ‘𝐴)〉} | |
2 | fvi 6998 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → ( I ‘𝐴) = 𝐴) | |
3 | 2 | opeq2d 4904 | . . 3 ⊢ (𝐴 ∈ 𝑉 → 〈0, ( I ‘𝐴)〉 = 〈0, 𝐴〉) |
4 | 3 | sneqd 4660 | . 2 ⊢ (𝐴 ∈ 𝑉 → {〈0, ( I ‘𝐴)〉} = {〈0, 𝐴〉}) |
5 | 1, 4 | eqtrid 2792 | 1 ⊢ (𝐴 ∈ 𝑉 → 〈“𝐴”〉 = {〈0, 𝐴〉}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2108 {csn 4648 〈cop 4654 I cid 5592 ‘cfv 6573 0cc0 11184 〈“cs1 14643 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pr 5447 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-ral 3068 df-rex 3077 df-rab 3444 df-v 3490 df-dif 3979 df-un 3981 df-ss 3993 df-nul 4353 df-if 4549 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-br 5167 df-opab 5229 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-iota 6525 df-fun 6575 df-fv 6581 df-s1 14644 |
This theorem is referenced by: s1rn 14647 s1cl 14650 s1dmALT 14657 s1fv 14658 s111 14663 repsw1 14831 s1co 14882 s2prop 14956 ofs1 15019 gsumws1 18873 uspgr1ewop 29283 usgr2v1e2w 29287 0wlkons1 30153 s1f1 32909 cshw1s2 32927 ofcs1 34521 signstf0 34545 |
Copyright terms: Public domain | W3C validator |