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

Theorem fsn 5335
 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 5062 . . . . . . . 8 ((𝐹:{𝐴}⟶{𝐵} ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹) → (𝑥 ∈ {𝐴} ∧ 𝑦 ∈ {𝐵}))
2 velsn 3392 . . . . . . . . 9 (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴)
3 velsn 3392 . . . . . . . . 9 (𝑦 ∈ {𝐵} ↔ 𝑦 = 𝐵)
42, 3anbi12i 433 . . . . . . . 8 ((𝑥 ∈ {𝐴} ∧ 𝑦 ∈ {𝐵}) ↔ (𝑥 = 𝐴𝑦 = 𝐵))
51, 4sylib 127 . . . . . . 7 ((𝐹:{𝐴}⟶{𝐵} ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹) → (𝑥 = 𝐴𝑦 = 𝐵))
65ex 108 . . . . . 6 (𝐹:{𝐴}⟶{𝐵} → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (𝑥 = 𝐴𝑦 = 𝐵)))
7 fsn.1 . . . . . . . . . 10 𝐴 ∈ V
87snid 3402 . . . . . . . . 9 𝐴 ∈ {𝐴}
9 feu 5072 . . . . . . . . 9 ((𝐹:{𝐴}⟶{𝐵} ∧ 𝐴 ∈ {𝐴}) → ∃!𝑦 ∈ {𝐵}⟨𝐴, 𝑦⟩ ∈ 𝐹)
108, 9mpan2 401 . . . . . . . 8 (𝐹:{𝐴}⟶{𝐵} → ∃!𝑦 ∈ {𝐵}⟨𝐴, 𝑦⟩ ∈ 𝐹)
113anbi1i 431 . . . . . . . . . . 11 ((𝑦 ∈ {𝐵} ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ↔ (𝑦 = 𝐵 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹))
12 opeq2 3550 . . . . . . . . . . . . . 14 (𝑦 = 𝐵 → ⟨𝐴, 𝑦⟩ = ⟨𝐴, 𝐵⟩)
1312eleq1d 2106 . . . . . . . . . . . . 13 (𝑦 = 𝐵 → (⟨𝐴, 𝑦⟩ ∈ 𝐹 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝐹))
1413pm5.32i 427 . . . . . . . . . . . 12 ((𝑦 = 𝐵 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ↔ (𝑦 = 𝐵 ∧ ⟨𝐴, 𝐵⟩ ∈ 𝐹))
15 ancom 253 . . . . . . . . . . . 12 ((⟨𝐴, 𝐵⟩ ∈ 𝐹𝑦 = 𝐵) ↔ (𝑦 = 𝐵 ∧ ⟨𝐴, 𝐵⟩ ∈ 𝐹))
1614, 15bitr4i 176 . . . . . . . . . . 11 ((𝑦 = 𝐵 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹) ↔ (⟨𝐴, 𝐵⟩ ∈ 𝐹𝑦 = 𝐵))
1711, 16bitr2i 174 . . . . . . . . . 10 ((⟨𝐴, 𝐵⟩ ∈ 𝐹𝑦 = 𝐵) ↔ (𝑦 ∈ {𝐵} ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹))
1817eubii 1909 . . . . . . . . 9 (∃!𝑦(⟨𝐴, 𝐵⟩ ∈ 𝐹𝑦 = 𝐵) ↔ ∃!𝑦(𝑦 ∈ {𝐵} ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹))
19 fsn.2 . . . . . . . . . . . 12 𝐵 ∈ V
2019eueq1 2713 . . . . . . . . . . 11 ∃!𝑦 𝑦 = 𝐵
2120biantru 286 . . . . . . . . . 10 (⟨𝐴, 𝐵⟩ ∈ 𝐹 ↔ (⟨𝐴, 𝐵⟩ ∈ 𝐹 ∧ ∃!𝑦 𝑦 = 𝐵))
22 euanv 1957 . . . . . . . . . 10 (∃!𝑦(⟨𝐴, 𝐵⟩ ∈ 𝐹𝑦 = 𝐵) ↔ (⟨𝐴, 𝐵⟩ ∈ 𝐹 ∧ ∃!𝑦 𝑦 = 𝐵))
2321, 22bitr4i 176 . . . . . . . . 9 (⟨𝐴, 𝐵⟩ ∈ 𝐹 ↔ ∃!𝑦(⟨𝐴, 𝐵⟩ ∈ 𝐹𝑦 = 𝐵))
24 df-reu 2313 . . . . . . . . 9 (∃!𝑦 ∈ {𝐵}⟨𝐴, 𝑦⟩ ∈ 𝐹 ↔ ∃!𝑦(𝑦 ∈ {𝐵} ∧ ⟨𝐴, 𝑦⟩ ∈ 𝐹))
2518, 23, 243bitr4i 201 . . . . . . . 8 (⟨𝐴, 𝐵⟩ ∈ 𝐹 ↔ ∃!𝑦 ∈ {𝐵}⟨𝐴, 𝑦⟩ ∈ 𝐹)
2610, 25sylibr 137 . . . . . . 7 (𝐹:{𝐴}⟶{𝐵} → ⟨𝐴, 𝐵⟩ ∈ 𝐹)
27 opeq12 3551 . . . . . . . 8 ((𝑥 = 𝐴𝑦 = 𝐵) → ⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩)
2827eleq1d 2106 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵) → (⟨𝑥, 𝑦⟩ ∈ 𝐹 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝐹))
2926, 28syl5ibrcom 146 . . . . . 6 (𝐹:{𝐴}⟶{𝐵} → ((𝑥 = 𝐴𝑦 = 𝐵) → ⟨𝑥, 𝑦⟩ ∈ 𝐹))
306, 29impbid 120 . . . . 5 (𝐹:{𝐴}⟶{𝐵} → (⟨𝑥, 𝑦⟩ ∈ 𝐹 ↔ (𝑥 = 𝐴𝑦 = 𝐵)))
31 vex 2560 . . . . . . . 8 𝑥 ∈ V
32 vex 2560 . . . . . . . 8 𝑦 ∈ V
3331, 32opex 3966 . . . . . . 7 𝑥, 𝑦⟩ ∈ V
3433elsn 3391 . . . . . 6 (⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩} ↔ ⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩)
357, 19opth2 3977 . . . . . 6 (⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩ ↔ (𝑥 = 𝐴𝑦 = 𝐵))
3634, 35bitr2i 174 . . . . 5 ((𝑥 = 𝐴𝑦 = 𝐵) ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩})
3730, 36syl6bb 185 . . . 4 (𝐹:{𝐴}⟶{𝐵} → (⟨𝑥, 𝑦⟩ ∈ 𝐹 ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩}))
3837alrimivv 1755 . . 3 (𝐹:{𝐴}⟶{𝐵} → ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐹 ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩}))
39 frel 5049 . . . 4 (𝐹:{𝐴}⟶{𝐵} → Rel 𝐹)
407, 19relsnop 4444 . . . 4 Rel {⟨𝐴, 𝐵⟩}
41 eqrel 4429 . . . 4 ((Rel 𝐹 ∧ Rel {⟨𝐴, 𝐵⟩}) → (𝐹 = {⟨𝐴, 𝐵⟩} ↔ ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐹 ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩})))
4239, 40, 41sylancl 392 . . 3 (𝐹:{𝐴}⟶{𝐵} → (𝐹 = {⟨𝐴, 𝐵⟩} ↔ ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐹 ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩})))
4338, 42mpbird 156 . 2 (𝐹:{𝐴}⟶{𝐵} → 𝐹 = {⟨𝐴, 𝐵⟩})
447, 19f1osn 5166 . . . 4 {⟨𝐴, 𝐵⟩}:{𝐴}–1-1-onto→{𝐵}
45 f1oeq1 5117 . . . 4 (𝐹 = {⟨𝐴, 𝐵⟩} → (𝐹:{𝐴}–1-1-onto→{𝐵} ↔ {⟨𝐴, 𝐵⟩}:{𝐴}–1-1-onto→{𝐵}))
4644, 45mpbiri 157 . . 3 (𝐹 = {⟨𝐴, 𝐵⟩} → 𝐹:{𝐴}–1-1-onto→{𝐵})
47 f1of 5126 . . 3 (𝐹:{𝐴}–1-1-onto→{𝐵} → 𝐹:{𝐴}⟶{𝐵})
4846, 47syl 14 . 2 (𝐹 = {⟨𝐴, 𝐵⟩} → 𝐹:{𝐴}⟶{𝐵})
4943, 48impbii 117 1 (𝐹:{𝐴}⟶{𝐵} ↔ 𝐹 = {⟨𝐴, 𝐵⟩})
 Colors of variables: wff set class Syntax hints:   ∧ wa 97   ↔ wb 98  ∀wal 1241   = wceq 1243   ∈ wcel 1393  ∃!weu 1900  ∃!wreu 2308  Vcvv 2557  {csn 3375  ⟨cop 3378  Rel wrel 4350  ⟶wf 4898  –1-1-onto→wf1o 4901 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944 This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-reu 2313  df-v 2559  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-br 3765  df-opab 3819  df-id 4030  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-fun 4904  df-fn 4905  df-f 4906  df-f1 4907  df-fo 4908  df-f1o 4909 This theorem is referenced by:  fsng  5336
 Copyright terms: Public domain W3C validator