![]() |
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 13663 | . 2 ⊢ 〈“𝐴”〉 = {〈0, ( I ‘𝐴)〉} | |
2 | fvi 6506 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → ( I ‘𝐴) = 𝐴) | |
3 | 2 | opeq2d 4632 | . . 3 ⊢ (𝐴 ∈ 𝑉 → 〈0, ( I ‘𝐴)〉 = 〈0, 𝐴〉) |
4 | 3 | sneqd 4411 | . 2 ⊢ (𝐴 ∈ 𝑉 → {〈0, ( I ‘𝐴)〉} = {〈0, 𝐴〉}) |
5 | 1, 4 | syl5eq 2873 | 1 ⊢ (𝐴 ∈ 𝑉 → 〈“𝐴”〉 = {〈0, 𝐴〉}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1656 ∈ wcel 2164 {csn 4399 〈cop 4405 I cid 5251 ‘cfv 6127 0cc0 10259 〈“cs1 13662 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1894 ax-4 1908 ax-5 2009 ax-6 2075 ax-7 2112 ax-9 2173 ax-10 2192 ax-11 2207 ax-12 2220 ax-13 2389 ax-ext 2803 ax-sep 5007 ax-nul 5015 ax-pr 5129 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 879 df-3an 1113 df-tru 1660 df-ex 1879 df-nf 1883 df-sb 2068 df-mo 2605 df-eu 2640 df-clab 2812 df-cleq 2818 df-clel 2821 df-nfc 2958 df-ral 3122 df-rex 3123 df-rab 3126 df-v 3416 df-sbc 3663 df-dif 3801 df-un 3803 df-in 3805 df-ss 3812 df-nul 4147 df-if 4309 df-sn 4400 df-pr 4402 df-op 4406 df-uni 4661 df-br 4876 df-opab 4938 df-id 5252 df-xp 5352 df-rel 5353 df-cnv 5354 df-co 5355 df-dm 5356 df-iota 6090 df-fun 6129 df-fv 6135 df-s1 13663 |
This theorem is referenced by: s1rn 13666 s1cl 13669 s1dmALT 13676 s1fv 13677 s111 13682 repsw1 13906 s1co 13961 s2prop 14035 ofs1 14095 gsumws1 17736 uspgr1ewop 26552 usgr2v1e2w 26556 0wlkons1 27493 ofcs1 31164 signstf0 31188 |
Copyright terms: Public domain | W3C validator |