Users' Mathboxes Mathbox for ML < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  f1omptsn Structured version   Visualization version   GIF version

Theorem f1omptsn 36206
Description: A function mapping to singletons is bijective onto a set of singletons. (Contributed by ML, 16-Jul-2020.)
Hypotheses
Ref Expression
f1omptsn.f 𝐹 = (𝑥𝐴 ↦ {𝑥})
f1omptsn.r 𝑅 = {𝑢 ∣ ∃𝑥𝐴 𝑢 = {𝑥}}
Assertion
Ref Expression
f1omptsn 𝐹:𝐴1-1-onto𝑅
Distinct variable group:   𝑢,𝐴,𝑥
Allowed substitution hints:   𝑅(𝑥,𝑢)   𝐹(𝑥,𝑢)

Proof of Theorem f1omptsn
Dummy variables 𝑎 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 sneq 4637 . . . . . 6 (𝑥 = 𝑎 → {𝑥} = {𝑎})
21cbvmptv 5260 . . . . 5 (𝑥𝐴 ↦ {𝑥}) = (𝑎𝐴 ↦ {𝑎})
32eqcomi 2741 . . . 4 (𝑎𝐴 ↦ {𝑎}) = (𝑥𝐴 ↦ {𝑥})
4 id 22 . . . . . . . 8 (𝑢 = 𝑧𝑢 = 𝑧)
54, 1eqeqan12d 2746 . . . . . . 7 ((𝑢 = 𝑧𝑥 = 𝑎) → (𝑢 = {𝑥} ↔ 𝑧 = {𝑎}))
65cbvrexdva 3237 . . . . . 6 (𝑢 = 𝑧 → (∃𝑥𝐴 𝑢 = {𝑥} ↔ ∃𝑎𝐴 𝑧 = {𝑎}))
76cbvabv 2805 . . . . 5 {𝑢 ∣ ∃𝑥𝐴 𝑢 = {𝑥}} = {𝑧 ∣ ∃𝑎𝐴 𝑧 = {𝑎}}
87eqcomi 2741 . . . 4 {𝑧 ∣ ∃𝑎𝐴 𝑧 = {𝑎}} = {𝑢 ∣ ∃𝑥𝐴 𝑢 = {𝑥}}
93, 8f1omptsnlem 36205 . . 3 (𝑎𝐴 ↦ {𝑎}):𝐴1-1-onto→{𝑧 ∣ ∃𝑎𝐴 𝑧 = {𝑎}}
10 f1omptsn.r . . . . 5 𝑅 = {𝑢 ∣ ∃𝑥𝐴 𝑢 = {𝑥}}
1110, 7eqtri 2760 . . . 4 𝑅 = {𝑧 ∣ ∃𝑎𝐴 𝑧 = {𝑎}}
12 f1oeq3 6820 . . . 4 (𝑅 = {𝑧 ∣ ∃𝑎𝐴 𝑧 = {𝑎}} → ((𝑎𝐴 ↦ {𝑎}):𝐴1-1-onto𝑅 ↔ (𝑎𝐴 ↦ {𝑎}):𝐴1-1-onto→{𝑧 ∣ ∃𝑎𝐴 𝑧 = {𝑎}}))
1311, 12ax-mp 5 . . 3 ((𝑎𝐴 ↦ {𝑎}):𝐴1-1-onto𝑅 ↔ (𝑎𝐴 ↦ {𝑎}):𝐴1-1-onto→{𝑧 ∣ ∃𝑎𝐴 𝑧 = {𝑎}})
149, 13mpbir 230 . 2 (𝑎𝐴 ↦ {𝑎}):𝐴1-1-onto𝑅
15 f1omptsn.f . . . 4 𝐹 = (𝑥𝐴 ↦ {𝑥})
1615, 2eqtri 2760 . . 3 𝐹 = (𝑎𝐴 ↦ {𝑎})
17 f1oeq1 6818 . . 3 (𝐹 = (𝑎𝐴 ↦ {𝑎}) → (𝐹:𝐴1-1-onto𝑅 ↔ (𝑎𝐴 ↦ {𝑎}):𝐴1-1-onto𝑅))
1816, 17ax-mp 5 . 2 (𝐹:𝐴1-1-onto𝑅 ↔ (𝑎𝐴 ↦ {𝑎}):𝐴1-1-onto𝑅)
1914, 18mpbir 230 1 𝐹:𝐴1-1-onto𝑅
Colors of variables: wff setvar class
Syntax hints:  wb 205   = wceq 1541  {cab 2709  wrex 3070  {csn 4627  cmpt 5230  1-1-ontowf1o 6539
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  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 2703  ax-sep 5298  ax-nul 5305  ax-pr 5426
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-br 5148  df-opab 5210  df-mpt 5231  df-id 5573  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-iota 6492  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator