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 13999 | . . 3 ⊢ (𝑆 ∈ 𝐴 → 〈“𝑆”〉 = {〈0, 𝑆〉}) | |
2 | s1val 13999 | . . 3 ⊢ (𝑇 ∈ 𝐴 → 〈“𝑇”〉 = {〈0, 𝑇〉}) | |
3 | 1, 2 | eqeqan12d 2775 | . 2 ⊢ ((𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) → (〈“𝑆”〉 = 〈“𝑇”〉 ↔ {〈0, 𝑆〉} = {〈0, 𝑇〉})) |
4 | opex 5324 | . . 3 ⊢ 〈0, 𝑆〉 ∈ V | |
5 | sneqbg 4731 | . . 3 ⊢ (〈0, 𝑆〉 ∈ V → ({〈0, 𝑆〉} = {〈0, 𝑇〉} ↔ 〈0, 𝑆〉 = 〈0, 𝑇〉)) | |
6 | 4, 5 | mp1i 13 | . 2 ⊢ ((𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) → ({〈0, 𝑆〉} = {〈0, 𝑇〉} ↔ 〈0, 𝑆〉 = 〈0, 𝑇〉)) |
7 | 0z 12031 | . . . 4 ⊢ 0 ∈ ℤ | |
8 | eqid 2758 | . . . . 5 ⊢ 0 = 0 | |
9 | opthg 5337 | . . . . . 6 ⊢ ((0 ∈ ℤ ∧ 𝑆 ∈ 𝐴) → (〈0, 𝑆〉 = 〈0, 𝑇〉 ↔ (0 = 0 ∧ 𝑆 = 𝑇))) | |
10 | 9 | baibd 543 | . . . . 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 484 | . 2 ⊢ ((𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) → (〈0, 𝑆〉 = 〈0, 𝑇〉 ↔ 𝑆 = 𝑇)) |
14 | 3, 6, 13 | 3bitrd 308 | 1 ⊢ ((𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) → (〈“𝑆”〉 = 〈“𝑇”〉 ↔ 𝑆 = 𝑇)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1538 ∈ wcel 2111 Vcvv 3409 {csn 4522 〈cop 4528 0cc0 10575 ℤcz 12020 〈“cs1 13996 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2729 ax-sep 5169 ax-nul 5176 ax-pr 5298 ax-1cn 10633 ax-addrcl 10636 ax-rnegex 10646 ax-cnre 10648 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-fal 1551 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2557 df-eu 2588 df-clab 2736 df-cleq 2750 df-clel 2830 df-nfc 2901 df-ral 3075 df-rex 3076 df-rab 3079 df-v 3411 df-sbc 3697 df-dif 3861 df-un 3863 df-in 3865 df-ss 3875 df-nul 4226 df-if 4421 df-sn 4523 df-pr 4525 df-op 4529 df-uni 4799 df-br 5033 df-opab 5095 df-id 5430 df-xp 5530 df-rel 5531 df-cnv 5532 df-co 5533 df-dm 5534 df-iota 6294 df-fun 6337 df-fv 6343 df-ov 7153 df-neg 10911 df-z 12021 df-s1 13997 |
This theorem is referenced by: ccats1alpha 14020 pfxsuff1eqwrdeq 14108 s2eq2seq 14346 s3eq3seq 14348 2swrd2eqwrdeq 14362 efgredlemc 18938 mvhf1 33037 |
Copyright terms: Public domain | W3C validator |