ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fsn GIF version

Theorem fsn 5560
Description: A function maps a singleton to a singleton iff it is the singleton of an ordered pair. (Contributed by NM, 10-Dec-2003.)
Hypotheses
Ref Expression
fsn.1 𝐴 ∈ V
fsn.2 𝐵 ∈ V
Assertion
Ref Expression
fsn (𝐹:{𝐴}⟶{𝐵} ↔ 𝐹 = {⟨𝐴, 𝐵⟩})

Proof of Theorem fsn
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 opelf 5264 . . . . . . . 8 ((𝐹:{𝐴}⟶{𝐵} ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹) → (𝑥 ∈ {𝐴} ∧ 𝑦 ∈ {𝐵}))
2 velsn 3514 . . . . . . . . 9 (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴)
3 velsn 3514 . . . . . . . . 9 (𝑦 ∈ {𝐵} ↔ 𝑦 = 𝐵)
42, 3anbi12i 455 . . . . . . . 8 ((𝑥 ∈ {𝐴} ∧ 𝑦 ∈ {𝐵}) ↔ (𝑥 = 𝐴𝑦 = 𝐵))
51, 4sylib 121 . . . . . . 7 ((𝐹:{𝐴}⟶{𝐵} ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹) → (𝑥 = 𝐴𝑦 = 𝐵))
65ex 114 . . . . . 6 (𝐹:{𝐴}⟶{𝐵} → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (𝑥 = 𝐴𝑦 = 𝐵)))
7 fsn.1 . . . . . . . . . 10 𝐴 ∈ V
87snid 3526 . . . . . . . . 9 𝐴 ∈ {𝐴}
9 feu 5275 . . . . . . . . 9 ((𝐹:{𝐴}⟶{𝐵} ∧ 𝐴 ∈ {𝐴}) → ∃!𝑦 ∈ {𝐵}⟨𝐴, 𝑦⟩ ∈ 𝐹)
108, 9mpan2 421 . . . . . . . 8 (𝐹:{𝐴}⟶{𝐵} → ∃!𝑦 ∈ {𝐵}⟨𝐴, 𝑦⟩ ∈ 𝐹)
113anbi1i 453 . . . . . . . . . . 11 ((𝑦 ∈ {𝐵} ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ↔ (𝑦 = 𝐵 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹))
12 opeq2 3676 . . . . . . . . . . . . . 14 (𝑦 = 𝐵 → ⟨𝐴, 𝑦⟩ = ⟨𝐴, 𝐵⟩)
1312eleq1d 2186 . . . . . . . . . . . . 13 (𝑦 = 𝐵 → (⟨𝐴, 𝑦⟩ ∈ 𝐹 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝐹))
1413pm5.32i 449 . . . . . . . . . . . 12 ((𝑦 = 𝐵 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ↔ (𝑦 = 𝐵 ∧ ⟨𝐴, 𝐵⟩ ∈ 𝐹))
15 ancom 264 . . . . . . . . . . . 12 ((⟨𝐴, 𝐵⟩ ∈ 𝐹𝑦 = 𝐵) ↔ (𝑦 = 𝐵 ∧ ⟨𝐴, 𝐵⟩ ∈ 𝐹))
1614, 15bitr4i 186 . . . . . . . . . . 11 ((𝑦 = 𝐵 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ↔ (⟨𝐴, 𝐵⟩ ∈ 𝐹𝑦 = 𝐵))
1711, 16bitr2i 184 . . . . . . . . . 10 ((⟨𝐴, 𝐵⟩ ∈ 𝐹𝑦 = 𝐵) ↔ (𝑦 ∈ {𝐵} ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹))
1817eubii 1986 . . . . . . . . 9 (∃!𝑦(⟨𝐴, 𝐵⟩ ∈ 𝐹𝑦 = 𝐵) ↔ ∃!𝑦(𝑦 ∈ {𝐵} ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹))
19 fsn.2 . . . . . . . . . . . 12 𝐵 ∈ V
2019eueq1 2829 . . . . . . . . . . 11 ∃!𝑦 𝑦 = 𝐵
2120biantru 300 . . . . . . . . . 10 (⟨𝐴, 𝐵⟩ ∈ 𝐹 ↔ (⟨𝐴, 𝐵⟩ ∈ 𝐹 ∧ ∃!𝑦 𝑦 = 𝐵))
22 euanv 2034 . . . . . . . . . 10 (∃!𝑦(⟨𝐴, 𝐵⟩ ∈ 𝐹𝑦 = 𝐵) ↔ (⟨𝐴, 𝐵⟩ ∈ 𝐹 ∧ ∃!𝑦 𝑦 = 𝐵))
2321, 22bitr4i 186 . . . . . . . . 9 (⟨𝐴, 𝐵⟩ ∈ 𝐹 ↔ ∃!𝑦(⟨𝐴, 𝐵⟩ ∈ 𝐹𝑦 = 𝐵))
24 df-reu 2400 . . . . . . . . 9 (∃!𝑦 ∈ {𝐵}⟨𝐴, 𝑦⟩ ∈ 𝐹 ↔ ∃!𝑦(𝑦 ∈ {𝐵} ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹))
2518, 23, 243bitr4i 211 . . . . . . . 8 (⟨𝐴, 𝐵⟩ ∈ 𝐹 ↔ ∃!𝑦 ∈ {𝐵}⟨𝐴, 𝑦⟩ ∈ 𝐹)
2610, 25sylibr 133 . . . . . . 7 (𝐹:{𝐴}⟶{𝐵} → ⟨𝐴, 𝐵⟩ ∈ 𝐹)
27 opeq12 3677 . . . . . . . 8 ((𝑥 = 𝐴𝑦 = 𝐵) → ⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩)
2827eleq1d 2186 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵) → (⟨𝑥, 𝑦⟩ ∈ 𝐹 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝐹))
2926, 28syl5ibrcom 156 . . . . . 6 (𝐹:{𝐴}⟶{𝐵} → ((𝑥 = 𝐴𝑦 = 𝐵) → ⟨𝑥, 𝑦⟩ ∈ 𝐹))
306, 29impbid 128 . . . . 5 (𝐹:{𝐴}⟶{𝐵} → (⟨𝑥, 𝑦⟩ ∈ 𝐹 ↔ (𝑥 = 𝐴𝑦 = 𝐵)))
31 vex 2663 . . . . . . . 8 𝑥 ∈ V
32 vex 2663 . . . . . . . 8 𝑦 ∈ V
3331, 32opex 4121 . . . . . . 7 𝑥, 𝑦⟩ ∈ V
3433elsn 3513 . . . . . 6 (⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩)
357, 19opth2 4132 . . . . . 6 (⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩ ↔ (𝑥 = 𝐴𝑦 = 𝐵))
3634, 35bitr2i 184 . . . . 5 ((𝑥 = 𝐴𝑦 = 𝐵) ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩})
3730, 36syl6bb 195 . . . 4 (𝐹:{𝐴}⟶{𝐵} → (⟨𝑥, 𝑦⟩ ∈ 𝐹 ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩}))
3837alrimivv 1831 . . 3 (𝐹:{𝐴}⟶{𝐵} → ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐹 ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩}))
39 frel 5247 . . . 4 (𝐹:{𝐴}⟶{𝐵} → Rel 𝐹)
407, 19relsnop 4615 . . . 4 Rel {⟨𝐴, 𝐵⟩}
41 eqrel 4598 . . . 4 ((Rel 𝐹 ∧ Rel {⟨𝐴, 𝐵⟩}) → (𝐹 = {⟨𝐴, 𝐵⟩} ↔ ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐹 ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩})))
4239, 40, 41sylancl 409 . . 3 (𝐹:{𝐴}⟶{𝐵} → (𝐹 = {⟨𝐴, 𝐵⟩} ↔ ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐹 ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩})))
4338, 42mpbird 166 . 2 (𝐹:{𝐴}⟶{𝐵} → 𝐹 = {⟨𝐴, 𝐵⟩})
447, 19f1osn 5375 . . . 4 {⟨𝐴, 𝐵⟩}:{𝐴}–1-1-onto→{𝐵}
45 f1oeq1 5326 . . . 4 (𝐹 = {⟨𝐴, 𝐵⟩} → (𝐹:{𝐴}–1-1-onto→{𝐵} ↔ {⟨𝐴, 𝐵⟩}:{𝐴}–1-1-onto→{𝐵}))
4644, 45mpbiri 167 . . 3 (𝐹 = {⟨𝐴, 𝐵⟩} → 𝐹:{𝐴}–1-1-onto→{𝐵})
47 f1of 5335 . . 3 (𝐹:{𝐴}–1-1-onto→{𝐵} → 𝐹:{𝐴}⟶{𝐵})
4846, 47syl 14 . 2 (𝐹 = {⟨𝐴, 𝐵⟩} → 𝐹:{𝐴}⟶{𝐵})
4943, 48impbii 125 1 (𝐹:{𝐴}⟶{𝐵} ↔ 𝐹 = {⟨𝐴, 𝐵⟩})
Colors of variables: wff set class
Syntax hints:  wa 103  wb 104  wal 1314   = wceq 1316  wcel 1465  ∃!weu 1977  ∃!wreu 2395  Vcvv 2660  {csn 3497  cop 3500  Rel wrel 4514  wf 5089  1-1-ontowf1o 5092
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 683  ax-5 1408  ax-7 1409  ax-gen 1410  ax-ie1 1454  ax-ie2 1455  ax-8 1467  ax-10 1468  ax-11 1469  ax-i12 1470  ax-bndl 1471  ax-4 1472  ax-14 1477  ax-17 1491  ax-i9 1495  ax-ial 1499  ax-i5r 1500  ax-ext 2099  ax-sep 4016  ax-pow 4068  ax-pr 4101
This theorem depends on definitions:  df-bi 116  df-3an 949  df-tru 1319  df-nf 1422  df-sb 1721  df-eu 1980  df-mo 1981  df-clab 2104  df-cleq 2110  df-clel 2113  df-nfc 2247  df-ral 2398  df-rex 2399  df-reu 2400  df-v 2662  df-un 3045  df-in 3047  df-ss 3054  df-pw 3482  df-sn 3503  df-pr 3504  df-op 3506  df-br 3900  df-opab 3960  df-id 4185  df-xp 4515  df-rel 4516  df-cnv 4517  df-co 4518  df-dm 4519  df-rn 4520  df-fun 5095  df-fn 5096  df-f 5097  df-f1 5098  df-fo 5099  df-f1o 5100
This theorem is referenced by:  fsng  5561  mapsn  6552
  Copyright terms: Public domain W3C validator