| 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 14655 | . 2 ⊢ 〈“𝐴”〉 = {〈0, ( I ‘𝐴)〉} | |
| 2 | fvi 6964 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → ( I ‘𝐴) = 𝐴) | |
| 3 | 2 | opeq2d 4850 | . . 3 ⊢ (𝐴 ∈ 𝑉 → 〈0, ( I ‘𝐴)〉 = 〈0, 𝐴〉) |
| 4 | 3 | sneqd 4606 | . 2 ⊢ (𝐴 ∈ 𝑉 → {〈0, ( I ‘𝐴)〉} = {〈0, 𝐴〉}) |
| 5 | 1, 4 | eqtrid 2813 | 1 ⊢ (𝐴 ∈ 𝑉 → 〈“𝐴”〉 = {〈0, 𝐴〉}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2146 {csn 4594 〈cop 4600 I cid 5560 ‘cfv 6543 0cc0 11118 〈“cs1 14654 |
| 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 2148 ax-9 2156 ax-10 2179 ax-12 2216 ax-ext 2738 ax-sep 5262 ax-pr 5409 |
| 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-nf 1817 df-sb 2100 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-ral 3083 df-rex 3093 df-rab 3420 df-v 3460 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-br 5115 df-opab 5179 df-id 5561 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-iota 6499 df-fun 6545 df-fv 6551 df-s1 14655 |
| This theorem is used by: s1rn 14658 s1cl 14661 s1f1 14668 s1dmALT 14669 s1fv 14670 s111 14675 repsw1 14846 s1co 14896 s2prop 14970 ofs1 15033 gsumws1 18928 uspgr1ewop 29635 usgr2v1e2w 29639 0wlkons1 30509 cshw1s2 33311 ofcs1 34966 signstf0 34987 |
| Copyright terms: Public domain | W3C validator |