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 38528
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-1onto𝑅
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 4594 . . . . . 6 (𝑥 = 𝑎 → {𝑥} = {𝑎})
21cbvmptv 5215 . . . . 5 (𝑥 ∈ 𝐴 ↦ {𝑥}) = (𝑎 ∈ 𝐴 ↦ {𝑎})
32eqcomi 2772 . . . 4 (𝑎 ∈ 𝐴 ↦ {𝑎}) = (𝑥 ∈ 𝐴 ↦ {𝑥})
4 id 23 . . . . . . . 8 (𝑢 = 𝑧 → 𝑢 = 𝑧)
54, 1eqeqan12d 2777 . . . . . . 7 ((𝑢 = 𝑧 ∧ 𝑥 = 𝑎) → (𝑢 = {𝑥} ↔ 𝑧 = {𝑎}))
65cbvrexdva 3247 . . . . . 6 (𝑢 = 𝑧 → (∃𝑥 ∈ 𝐴 𝑢 = {𝑥} ↔ ∃𝑎 ∈ 𝐴 𝑧 = {𝑎}))
76cbvabv 2834 . . . . 5 {𝑢 ∣ ∃𝑥 ∈ 𝐴 𝑢 = {𝑥}} = {𝑧 ∣ ∃𝑎 ∈ 𝐴 𝑧 = {𝑎}}
87eqcomi 2772 . . . 4 {𝑧 ∣ ∃𝑎 ∈ 𝐴 𝑧 = {𝑎}} = {𝑢 ∣ ∃𝑥 ∈ 𝐴 𝑢 = {𝑥}}
93, 8f1omptsnlem 38527 . . 3 (𝑎 ∈ 𝐴 ↦ {𝑎}):𝐴⟶1-1onto{𝑧 ∣ ∃𝑎 ∈ 𝐴 𝑧 = {𝑎}}
10 f1omptsn.r . . . . 5 𝑅 = {𝑢 ∣ ∃𝑥 ∈ 𝐴 𝑢 = {𝑥}}
1110, 7eqtri 2786 . . . 4 𝑅 = {𝑧 ∣ ∃𝑎 ∈ 𝐴 𝑧 = {𝑎}}
12 f1oeq3 6844 . . . 4 (𝑅 = {𝑧 ∣ ∃𝑎 ∈ 𝐴 𝑧 = {𝑎}} → ((𝑎 ∈ 𝐴 ↦ {𝑎}):𝐴⟶1-1onto𝑅 ↔ (𝑎 ∈ 𝐴 ↦ {𝑎}):𝐴⟶1-1onto{𝑧 ∣ ∃𝑎 ∈ 𝐴 𝑧 = {𝑎}}))
1311, 12ax-mp 5 . . 3 ((𝑎 ∈ 𝐴 ↦ {𝑎}):𝐴⟶1-1onto𝑅 ↔ (𝑎 ∈ 𝐴 ↦ {𝑎}):𝐴⟶1-1onto{𝑧 ∣ ∃𝑎 ∈ 𝐴 𝑧 = {𝑎}})
149, 13mpbir 234 . 2 (𝑎 ∈ 𝐴 ↦ {𝑎}):𝐴⟶1-1onto𝑅
15 f1omptsn.f . . . 4 𝐹 = (𝑥 ∈ 𝐴 ↦ {𝑥})
1615, 2eqtri 2786 . . 3 𝐹 = (𝑎 ∈ 𝐴 ↦ {𝑎})
17 f1oeq1 6842 . . 3 (𝐹 = (𝑎 ∈ 𝐴 ↦ {𝑎}) → (𝐹:𝐴⟶1-1onto𝑅 ↔ (𝑎 ∈ 𝐴 ↦ {𝑎}):𝐴⟶1-1onto𝑅))
1816, 17ax-mp 5 . 2 (𝐹:𝐴⟶1-1onto𝑅 ↔ (𝑎 ∈ 𝐴 ↦ {𝑎}):𝐴⟶1-1onto𝑅)
1914, 18mpbir 234 1 𝐹:𝐴⟶1-1onto𝑅
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   = wceq 1570  {cab 2741  ∃wrex 3090  {csn 4588   ↦ cmpt 5192  ⟶1-1ontowf1o 6565
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator