MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  s111 Structured version   Visualization version   GIF version

Theorem s111 14638
Description: The singleton word function is injective. (Contributed by Mario Carneiro, 1-Oct-2015.) (Revised by Mario Carneiro, 26-Feb-2016.)
Assertion
Ref Expression
s111 ((𝑆𝐴𝑇𝐴) → (⟨“𝑆”⟩ = ⟨“𝑇”⟩ ↔ 𝑆 = 𝑇))

Proof of Theorem s111
StepHypRef Expression
1 s1val 14621 . . 3 (𝑆𝐴 → ⟨“𝑆”⟩ = {⟨0, 𝑆⟩})
2 s1val 14621 . . 3 (𝑇𝐴 → ⟨“𝑇”⟩ = {⟨0, 𝑇⟩})
31, 2eqeqan12d 2750 . 2 ((𝑆𝐴𝑇𝐴) → (⟨“𝑆”⟩ = ⟨“𝑇”⟩ ↔ {⟨0, 𝑆⟩} = {⟨0, 𝑇⟩}))
4 opex 5444 . . 3 ⟨0, 𝑆⟩ ∈ V
5 sneqbg 4824 . . 3 (⟨0, 𝑆⟩ ∈ V → ({⟨0, 𝑆⟩} = {⟨0, 𝑇⟩} ↔ ⟨0, 𝑆⟩ = ⟨0, 𝑇⟩))
64, 5mp1i 13 . 2 ((𝑆𝐴𝑇𝐴) → ({⟨0, 𝑆⟩} = {⟨0, 𝑇⟩} ↔ ⟨0, 𝑆⟩ = ⟨0, 𝑇⟩))
7 0z 12604 . . . 4 0 ∈ ℤ
8 eqid 2736 . . . . 5 0 = 0
9 opthg 5457 . . . . . 6 ((0 ∈ ℤ ∧ 𝑆𝐴) → (⟨0, 𝑆⟩ = ⟨0, 𝑇⟩ ↔ (0 = 0 ∧ 𝑆 = 𝑇)))
109baibd 539 . . . . 5 (((0 ∈ ℤ ∧ 𝑆𝐴) ∧ 0 = 0) → (⟨0, 𝑆⟩ = ⟨0, 𝑇⟩ ↔ 𝑆 = 𝑇))
118, 10mpan2 691 . . . 4 ((0 ∈ ℤ ∧ 𝑆𝐴) → (⟨0, 𝑆⟩ = ⟨0, 𝑇⟩ ↔ 𝑆 = 𝑇))
127, 11mpan 690 . . 3 (𝑆𝐴 → (⟨0, 𝑆⟩ = ⟨0, 𝑇⟩ ↔ 𝑆 = 𝑇))
1312adantr 480 . 2 ((𝑆𝐴𝑇𝐴) → (⟨0, 𝑆⟩ = ⟨0, 𝑇⟩ ↔ 𝑆 = 𝑇))
143, 6, 133bitrd 305 1 ((𝑆𝐴𝑇𝐴) → (⟨“𝑆”⟩ = ⟨“𝑇”⟩ ↔ 𝑆 = 𝑇))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1540  wcel 2109  Vcvv 3464  {csn 4606  cop 4612  0cc0 11134  cz 12593  ⟨“cs1 14618
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-12 2178  ax-ext 2708  ax-sep 5271  ax-nul 5281  ax-pr 5407  ax-1cn 11192  ax-addrcl 11195  ax-rnegex 11205  ax-cnre 11207
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-ral 3053  df-rex 3062  df-rab 3421  df-v 3466  df-dif 3934  df-un 3936  df-ss 3948  df-nul 4314  df-if 4506  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-br 5125  df-opab 5187  df-id 5553  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-iota 6489  df-fun 6538  df-fv 6544  df-ov 7413  df-neg 11474  df-z 12594  df-s1 14619
This theorem is referenced by:  ccats1alpha  14642  pfxsuff1eqwrdeq  14722  s2eq2seq  14961  s3eq3seq  14963  2swrd2eqwrdeq  14977  efgredlemc  19731  mvhf1  35586
  Copyright terms: Public domain W3C validator