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

Theorem f1osng 6757
Description: A singleton of an ordered pair is one-to-one onto function. (Contributed by Mario Carneiro, 12-Jan-2013.)
Assertion
Ref Expression
f1osng ((𝐴𝑉𝐵𝑊) → {⟨𝐴, 𝐵⟩}:{𝐴}–1-1-onto→{𝐵})

Proof of Theorem f1osng
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 sneq 4571 . . . 4 (𝑎 = 𝐴 → {𝑎} = {𝐴})
21f1oeq2d 6712 . . 3 (𝑎 = 𝐴 → ({⟨𝑎, 𝑏⟩}:{𝑎}–1-1-onto→{𝑏} ↔ {⟨𝑎, 𝑏⟩}:{𝐴}–1-1-onto→{𝑏}))
3 opeq1 4804 . . . . 5 (𝑎 = 𝐴 → ⟨𝑎, 𝑏⟩ = ⟨𝐴, 𝑏⟩)
43sneqd 4573 . . . 4 (𝑎 = 𝐴 → {⟨𝑎, 𝑏⟩} = {⟨𝐴, 𝑏⟩})
54f1oeq1d 6711 . . 3 (𝑎 = 𝐴 → ({⟨𝑎, 𝑏⟩}:{𝐴}–1-1-onto→{𝑏} ↔ {⟨𝐴, 𝑏⟩}:{𝐴}–1-1-onto→{𝑏}))
62, 5bitrd 278 . 2 (𝑎 = 𝐴 → ({⟨𝑎, 𝑏⟩}:{𝑎}–1-1-onto→{𝑏} ↔ {⟨𝐴, 𝑏⟩}:{𝐴}–1-1-onto→{𝑏}))
7 sneq 4571 . . . 4 (𝑏 = 𝐵 → {𝑏} = {𝐵})
87f1oeq3d 6713 . . 3 (𝑏 = 𝐵 → ({⟨𝐴, 𝑏⟩}:{𝐴}–1-1-onto→{𝑏} ↔ {⟨𝐴, 𝑏⟩}:{𝐴}–1-1-onto→{𝐵}))
9 opeq2 4805 . . . . 5 (𝑏 = 𝐵 → ⟨𝐴, 𝑏⟩ = ⟨𝐴, 𝐵⟩)
109sneqd 4573 . . . 4 (𝑏 = 𝐵 → {⟨𝐴, 𝑏⟩} = {⟨𝐴, 𝐵⟩})
1110f1oeq1d 6711 . . 3 (𝑏 = 𝐵 → ({⟨𝐴, 𝑏⟩}:{𝐴}–1-1-onto→{𝐵} ↔ {⟨𝐴, 𝐵⟩}:{𝐴}–1-1-onto→{𝐵}))
128, 11bitrd 278 . 2 (𝑏 = 𝐵 → ({⟨𝐴, 𝑏⟩}:{𝐴}–1-1-onto→{𝑏} ↔ {⟨𝐴, 𝐵⟩}:{𝐴}–1-1-onto→{𝐵}))
13 vex 3436 . . 3 𝑎 ∈ V
14 vex 3436 . . 3 𝑏 ∈ V
1513, 14f1osn 6756 . 2 {⟨𝑎, 𝑏⟩}:{𝑎}–1-1-onto→{𝑏}
166, 12, 15vtocl2g 3510 1 ((𝐴𝑉𝐵𝑊) → {⟨𝐴, 𝐵⟩}:{𝐴}–1-1-onto→{𝐵})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1539  wcel 2106  {csn 4561  cop 4567  1-1-ontowf1o 6432
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-br 5075  df-opab 5137  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440
This theorem is referenced by:  f1sng  6758  f1oprswap  6760  f1oprg  6761  f1o2sn  7014  fsnunf  7057  fsnex  7155  suppsnop  7994  mapsnd  8674  ralxpmap  8684  en2sn  8831  en2snOLD  8832  enfixsn  8868  fseqenlem1  9780  canthp1lem2  10409  sumsnf  15455  prodsn  15672  prodsnf  15674  vdwlem8  16689  gsumws1  18476  symg1bas  18998  dprdsn  19639  eupthp1  28580  s1f1  31217  poimirlem16  35793  poimirlem17  35794  poimirlem19  35796  poimirlem20  35797  metakunt25  40149  mapfzcons  40538  sumsnd  42569  1hegrlfgr  45294
  Copyright terms: Public domain W3C validator