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

Theorem fsng 6369
Description: A function maps a singleton to a singleton iff it is the singleton of an ordered pair. (Contributed by NM, 26-Oct-2012.)
Assertion
Ref Expression
fsng ((𝐴𝐶𝐵𝐷) → (𝐹:{𝐴}⟶{𝐵} ↔ 𝐹 = {⟨𝐴, 𝐵⟩}))

Proof of Theorem fsng
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 sneq 4165 . . . 4 (𝑎 = 𝐴 → {𝑎} = {𝐴})
21feq2d 5998 . . 3 (𝑎 = 𝐴 → (𝐹:{𝑎}⟶{𝑏} ↔ 𝐹:{𝐴}⟶{𝑏}))
3 opeq1 4377 . . . . 5 (𝑎 = 𝐴 → ⟨𝑎, 𝑏⟩ = ⟨𝐴, 𝑏⟩)
43sneqd 4167 . . . 4 (𝑎 = 𝐴 → {⟨𝑎, 𝑏⟩} = {⟨𝐴, 𝑏⟩})
54eqeq2d 2631 . . 3 (𝑎 = 𝐴 → (𝐹 = {⟨𝑎, 𝑏⟩} ↔ 𝐹 = {⟨𝐴, 𝑏⟩}))
62, 5bibi12d 335 . 2 (𝑎 = 𝐴 → ((𝐹:{𝑎}⟶{𝑏} ↔ 𝐹 = {⟨𝑎, 𝑏⟩}) ↔ (𝐹:{𝐴}⟶{𝑏} ↔ 𝐹 = {⟨𝐴, 𝑏⟩})))
7 sneq 4165 . . . 4 (𝑏 = 𝐵 → {𝑏} = {𝐵})
87feq3d 5999 . . 3 (𝑏 = 𝐵 → (𝐹:{𝐴}⟶{𝑏} ↔ 𝐹:{𝐴}⟶{𝐵}))
9 opeq2 4378 . . . . 5 (𝑏 = 𝐵 → ⟨𝐴, 𝑏⟩ = ⟨𝐴, 𝐵⟩)
109sneqd 4167 . . . 4 (𝑏 = 𝐵 → {⟨𝐴, 𝑏⟩} = {⟨𝐴, 𝐵⟩})
1110eqeq2d 2631 . . 3 (𝑏 = 𝐵 → (𝐹 = {⟨𝐴, 𝑏⟩} ↔ 𝐹 = {⟨𝐴, 𝐵⟩}))
128, 11bibi12d 335 . 2 (𝑏 = 𝐵 → ((𝐹:{𝐴}⟶{𝑏} ↔ 𝐹 = {⟨𝐴, 𝑏⟩}) ↔ (𝐹:{𝐴}⟶{𝐵} ↔ 𝐹 = {⟨𝐴, 𝐵⟩})))
13 vex 3193 . . 3 𝑎 ∈ V
14 vex 3193 . . 3 𝑏 ∈ V
1513, 14fsn 6367 . 2 (𝐹:{𝑎}⟶{𝑏} ↔ 𝐹 = {⟨𝑎, 𝑏⟩})
166, 12, 15vtocl2g 3260 1 ((𝐴𝐶𝐵𝐷) → (𝐹:{𝐴}⟶{𝐵} ↔ 𝐹 = {⟨𝐴, 𝐵⟩}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384   = wceq 1480  wcel 1987  {csn 4155  cop 4161  wf 5853
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4751  ax-nul 4759  ax-pr 4877
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ral 2913  df-rex 2914  df-reu 2915  df-rab 2917  df-v 3192  df-dif 3563  df-un 3565  df-in 3567  df-ss 3574  df-nul 3898  df-if 4065  df-sn 4156  df-pr 4158  df-op 4162  df-br 4624  df-opab 4684  df-id 4999  df-xp 5090  df-rel 5091  df-cnv 5092  df-co 5093  df-dm 5094  df-rn 5095  df-fun 5859  df-fn 5860  df-f 5861  df-f1 5862  df-fo 5863  df-f1o 5864
This theorem is referenced by:  xpsng  6371  ftpg  6388  axdc3lem4  9235  fseq1p1m1  12371  cats1un  13429  intopsn  17193  grp1inv  17463  symg1bas  17756  esumsnf  29949  bnj149  30706  rngosn3  33394  k0004lem3  37968  mapsnd  38897  ovnovollem1  40207  mapsnop  41441  snlindsntorlem  41577  lmod1zr  41600
  Copyright terms: Public domain W3C validator