Theorem f1omptsn 38406

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.

Step	Hyp	Ref	Expression
1		sneq 4594	. . . . . 6 ⊢ (𝑥 = 𝑎 → {𝑥} = {𝑎})
2	1	cbvmptv 5212	. . . . 5 ⊢ (𝑥 ∈ 𝐴 ↦ {𝑥}) = (𝑎 ∈ 𝐴 ↦ {𝑎})
3	2	eqcomi 2772	. . . 4 ⊢ (𝑎 ∈ 𝐴 ↦ {𝑎}) = (𝑥 ∈ 𝐴 ↦ {𝑥})
4		id 23	. . . . . . . 8 ⊢ (𝑢 = 𝑧 → 𝑢 = 𝑧)
5	4, 1	eqeqan12d 2777	. . . . . . 7 ⊢ ((𝑢 = 𝑧 ∧ 𝑥 = 𝑎) → (𝑢 = {𝑥} ↔ 𝑧 = {𝑎}))
6	5	cbvrexdva 3247	. . . . . 6 ⊢ (𝑢 = 𝑧 → (∃𝑥 ∈ 𝐴 𝑢 = {𝑥} ↔ ∃𝑎 ∈ 𝐴 𝑧 = {𝑎}))
7	6	cbvabv 2834	. . . . 5 ⊢ {𝑢 ∣ ∃𝑥 ∈ 𝐴 𝑢 = {𝑥}} = {𝑧 ∣ ∃𝑎 ∈ 𝐴 𝑧 = {𝑎}}
8	7	eqcomi 2772	. . . 4 ⊢ {𝑧 ∣ ∃𝑎 ∈ 𝐴 𝑧 = {𝑎}} = {𝑢 ∣ ∃𝑥 ∈ 𝐴 𝑢 = {𝑥}}
9	3, 8	f1omptsnlem 38405	. . 3 ⊢ (𝑎 ∈ 𝐴 ↦ {𝑎}):𝐴–1-1-onto→{𝑧 ∣ ∃𝑎 ∈ 𝐴 𝑧 = {𝑎}}
10		f1omptsn.r	. . . . 5 ⊢ 𝑅 = {𝑢 ∣ ∃𝑥 ∈ 𝐴 𝑢 = {𝑥}}
11	10, 7	eqtri 2786	. . . 4 ⊢ 𝑅 = {𝑧 ∣ ∃𝑎 ∈ 𝐴 𝑧 = {𝑎}}
12		f1oeq3 6825	. . . 4 ⊢ (𝑅 = {𝑧 ∣ ∃𝑎 ∈ 𝐴 𝑧 = {𝑎}} → ((𝑎 ∈ 𝐴 ↦ {𝑎}):𝐴–1-1-onto→𝑅 ↔ (𝑎 ∈ 𝐴 ↦ {𝑎}):𝐴–1-1-onto→{𝑧 ∣ ∃𝑎 ∈ 𝐴 𝑧 = {𝑎}}))
13	11, 12	ax-mp 5	. . 3 ⊢ ((𝑎 ∈ 𝐴 ↦ {𝑎}):𝐴–1-1-onto→𝑅 ↔ (𝑎 ∈ 𝐴 ↦ {𝑎}):𝐴–1-1-onto→{𝑧 ∣ ∃𝑎 ∈ 𝐴 𝑧 = {𝑎}})
14	9, 13	mpbir 234	. 2 ⊢ (𝑎 ∈ 𝐴 ↦ {𝑎}):𝐴–1-1-onto→𝑅
15		f1omptsn.f	. . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ {𝑥})
16	15, 2	eqtri 2786	. . 3 ⊢ 𝐹 = (𝑎 ∈ 𝐴 ↦ {𝑎})
17		f1oeq1 6823	. . 3 ⊢ (𝐹 = (𝑎 ∈ 𝐴 ↦ {𝑎}) → (𝐹:𝐴–1-1-onto→𝑅 ↔ (𝑎 ∈ 𝐴 ↦ {𝑎}):𝐴–1-1-onto→𝑅))
18	16, 17	ax-mp 5	. 2 ⊢ (𝐹:𝐴–1-1-onto→𝑅 ↔ (𝑎 ∈ 𝐴 ↦ {𝑎}):𝐴–1-1-onto→𝑅)
19	14, 18	mpbir 234	1 ⊢ 𝐹:𝐴–1-1-onto→𝑅

This proof depends on syntax axioms:   ↔ wb 209   = wceq 1569  {cab 2741  ∃wrex 3090  {csn 4588   ↦ cmpt 5189  –1-1-onto→wf1o 6546

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  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 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6501  df-fun 6549  df-fn 6550  df-f 6551  df-f1 6552  df-fo 6553  df-f1o 6554  df-fv 6555

This theorem is used by: (None)