![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > s111 | Structured version Visualization version GIF version |
Description: The singleton word function is injective. (Contributed by Mario Carneiro, 1-Oct-2015.) (Revised by Mario Carneiro, 26-Feb-2016.) |
Ref | Expression |
---|---|
s111 | ⊢ ((𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) → (〈“𝑆”〉 = 〈“𝑇”〉 ↔ 𝑆 = 𝑇)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | s1val 14646 | . . 3 ⊢ (𝑆 ∈ 𝐴 → 〈“𝑆”〉 = {〈0, 𝑆〉}) | |
2 | s1val 14646 | . . 3 ⊢ (𝑇 ∈ 𝐴 → 〈“𝑇”〉 = {〈0, 𝑇〉}) | |
3 | 1, 2 | eqeqan12d 2754 | . 2 ⊢ ((𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) → (〈“𝑆”〉 = 〈“𝑇”〉 ↔ {〈0, 𝑆〉} = {〈0, 𝑇〉})) |
4 | opex 5484 | . . 3 ⊢ 〈0, 𝑆〉 ∈ V | |
5 | sneqbg 4868 | . . 3 ⊢ (〈0, 𝑆〉 ∈ V → ({〈0, 𝑆〉} = {〈0, 𝑇〉} ↔ 〈0, 𝑆〉 = 〈0, 𝑇〉)) | |
6 | 4, 5 | mp1i 13 | . 2 ⊢ ((𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) → ({〈0, 𝑆〉} = {〈0, 𝑇〉} ↔ 〈0, 𝑆〉 = 〈0, 𝑇〉)) |
7 | 0z 12650 | . . . 4 ⊢ 0 ∈ ℤ | |
8 | eqid 2740 | . . . . 5 ⊢ 0 = 0 | |
9 | opthg 5497 | . . . . . 6 ⊢ ((0 ∈ ℤ ∧ 𝑆 ∈ 𝐴) → (〈0, 𝑆〉 = 〈0, 𝑇〉 ↔ (0 = 0 ∧ 𝑆 = 𝑇))) | |
10 | 9 | baibd 539 | . . . . 5 ⊢ (((0 ∈ ℤ ∧ 𝑆 ∈ 𝐴) ∧ 0 = 0) → (〈0, 𝑆〉 = 〈0, 𝑇〉 ↔ 𝑆 = 𝑇)) |
11 | 8, 10 | mpan2 690 | . . . 4 ⊢ ((0 ∈ ℤ ∧ 𝑆 ∈ 𝐴) → (〈0, 𝑆〉 = 〈0, 𝑇〉 ↔ 𝑆 = 𝑇)) |
12 | 7, 11 | mpan 689 | . . 3 ⊢ (𝑆 ∈ 𝐴 → (〈0, 𝑆〉 = 〈0, 𝑇〉 ↔ 𝑆 = 𝑇)) |
13 | 12 | adantr 480 | . 2 ⊢ ((𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) → (〈0, 𝑆〉 = 〈0, 𝑇〉 ↔ 𝑆 = 𝑇)) |
14 | 3, 6, 13 | 3bitrd 305 | 1 ⊢ ((𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) → (〈“𝑆”〉 = 〈“𝑇”〉 ↔ 𝑆 = 𝑇)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1537 ∈ wcel 2108 Vcvv 3488 {csn 4648 〈cop 4654 0cc0 11184 ℤcz 12639 〈“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 ax-1cn 11242 ax-addrcl 11245 ax-rnegex 11255 ax-cnre 11257 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 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-ov 7451 df-neg 11523 df-z 12640 df-s1 14644 |
This theorem is referenced by: ccats1alpha 14667 pfxsuff1eqwrdeq 14747 s2eq2seq 14986 s3eq3seq 14988 2swrd2eqwrdeq 15002 efgredlemc 19787 mvhf1 35527 |
Copyright terms: Public domain | W3C validator |