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 37325
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 4599 . . . . . 6 (𝑥 = 𝑎 → {𝑥} = {𝑎})
21cbvmptv 5211 . . . . 5 (𝑥𝐴 ↦ {𝑥}) = (𝑎𝐴 ↦ {𝑎})
32eqcomi 2738 . . . 4 (𝑎𝐴 ↦ {𝑎}) = (𝑥𝐴 ↦ {𝑥})
4 id 22 . . . . . . . 8 (𝑢 = 𝑧𝑢 = 𝑧)
54, 1eqeqan12d 2743 . . . . . . 7 ((𝑢 = 𝑧𝑥 = 𝑎) → (𝑢 = {𝑥} ↔ 𝑧 = {𝑎}))
65cbvrexdva 3218 . . . . . 6 (𝑢 = 𝑧 → (∃𝑥𝐴 𝑢 = {𝑥} ↔ ∃𝑎𝐴 𝑧 = {𝑎}))
76cbvabv 2799 . . . . 5 {𝑢 ∣ ∃𝑥𝐴 𝑢 = {𝑥}} = {𝑧 ∣ ∃𝑎𝐴 𝑧 = {𝑎}}
87eqcomi 2738 . . . 4 {𝑧 ∣ ∃𝑎𝐴 𝑧 = {𝑎}} = {𝑢 ∣ ∃𝑥𝐴 𝑢 = {𝑥}}
93, 8f1omptsnlem 37324 . . 3 (𝑎𝐴 ↦ {𝑎}):𝐴1-1-onto→{𝑧 ∣ ∃𝑎𝐴 𝑧 = {𝑎}}
10 f1omptsn.r . . . . 5 𝑅 = {𝑢 ∣ ∃𝑥𝐴 𝑢 = {𝑥}}
1110, 7eqtri 2752 . . . 4 𝑅 = {𝑧 ∣ ∃𝑎𝐴 𝑧 = {𝑎}}
12 f1oeq3 6790 . . . 4 (𝑅 = {𝑧 ∣ ∃𝑎𝐴 𝑧 = {𝑎}} → ((𝑎𝐴 ↦ {𝑎}):𝐴1-1-onto𝑅 ↔ (𝑎𝐴 ↦ {𝑎}):𝐴1-1-onto→{𝑧 ∣ ∃𝑎𝐴 𝑧 = {𝑎}}))
1311, 12ax-mp 5 . . 3 ((𝑎𝐴 ↦ {𝑎}):𝐴1-1-onto𝑅 ↔ (𝑎𝐴 ↦ {𝑎}):𝐴1-1-onto→{𝑧 ∣ ∃𝑎𝐴 𝑧 = {𝑎}})
149, 13mpbir 231 . 2 (𝑎𝐴 ↦ {𝑎}):𝐴1-1-onto𝑅
15 f1omptsn.f . . . 4 𝐹 = (𝑥𝐴 ↦ {𝑥})
1615, 2eqtri 2752 . . 3 𝐹 = (𝑎𝐴 ↦ {𝑎})
17 f1oeq1 6788 . . 3 (𝐹 = (𝑎𝐴 ↦ {𝑎}) → (𝐹:𝐴1-1-onto𝑅 ↔ (𝑎𝐴 ↦ {𝑎}):𝐴1-1-onto𝑅))
1816, 17ax-mp 5 . 2 (𝐹:𝐴1-1-onto𝑅 ↔ (𝑎𝐴 ↦ {𝑎}):𝐴1-1-onto𝑅)
1914, 18mpbir 231 1 𝐹:𝐴1-1-onto𝑅
Colors of variables: wff setvar class
Syntax hints:  wb 206   = wceq 1540  {cab 2707  wrex 3053  {csn 4589  cmpt 5188  1-1-ontowf1o 6510
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator