Theorem f1omptsn 38094

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 5209	. . . . 5 ⊢ (𝑥 ∈ 𝐴 ↦ {𝑥}) = (𝑎 ∈ 𝐴 ↦ {𝑎})
3	2	eqcomi 2769	. . . 4 ⊢ (𝑎 ∈ 𝐴 ↦ {𝑎}) = (𝑥 ∈ 𝐴 ↦ {𝑥})
4		id 23	. . . . . . . 8 ⊢ (𝑢 = 𝑧 → 𝑢 = 𝑧)
5	4, 1	eqeqan12d 2774	. . . . . . 7 ⊢ ((𝑢 = 𝑧 ∧ 𝑥 = 𝑎) → (𝑢 = {𝑥} ↔ 𝑧 = {𝑎}))
6	5	cbvrexdva 3243	. . . . . 6 ⊢ (𝑢 = 𝑧 → (∃𝑥 ∈ 𝐴 𝑢 = {𝑥} ↔ ∃𝑎 ∈ 𝐴 𝑧 = {𝑎}))
7	6	cbvabv 2830	. . . . 5 ⊢ {𝑢 ∣ ∃𝑥 ∈ 𝐴 𝑢 = {𝑥}} = {𝑧 ∣ ∃𝑎 ∈ 𝐴 𝑧 = {𝑎}}
8	7	eqcomi 2769	. . . 4 ⊢ {𝑧 ∣ ∃𝑎 ∈ 𝐴 𝑧 = {𝑎}} = {𝑢 ∣ ∃𝑥 ∈ 𝐴 𝑢 = {𝑥}}
9	3, 8	f1omptsnlem 38093	. . 3 ⊢ (𝑎 ∈ 𝐴 ↦ {𝑎}):𝐴–1-1-onto→{𝑧 ∣ ∃𝑎 ∈ 𝐴 𝑧 = {𝑎}}
10		f1omptsn.r	. . . . 5 ⊢ 𝑅 = {𝑢 ∣ ∃𝑥 ∈ 𝐴 𝑢 = {𝑥}}
11	10, 7	eqtri 2783	. . . 4 ⊢ 𝑅 = {𝑧 ∣ ∃𝑎 ∈ 𝐴 𝑧 = {𝑎}}
12		f1oeq3 6808	. . . 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 2783	. . 3 ⊢ 𝐹 = (𝑎 ∈ 𝐴 ↦ {𝑎})
17		f1oeq1 6806	. . 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 1570  {cab 2738  ∃wrex 3086  {csn 4584   ↦ cmpt 5186  –1-1-onto→wf1o 6532

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  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 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541

This theorem is used by: (None)