Theorem mptsnun 38467

Description: A class 𝐵 is equal to the union of the class of all singletons of elements of 𝐵. (Contributed by ML, 16-Jul-2020.)

Hypotheses

Ref	Expression
mptsnun.f	⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ {𝑥})
mptsnun.r	⊢ 𝑅 = {𝑢 ∣ ∃𝑥 ∈ 𝐴 𝑢 = {𝑥}}

Assertion

Ref	Expression
mptsnun	⊢ (𝐵 ⊆ 𝐴 → 𝐵 = ∪ (𝐹 “ 𝐵))

Distinct variable groups:   𝑢,𝐴,𝑥   𝑢,𝐵,𝑥

Allowed substitution hints:   𝑅(𝑥, 𝑢)   𝐹(𝑥, 𝑢)

Proof of Theorem mptsnun

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		sneq 4594	. . . . 5 ⊢ (𝑥 = 𝑦 → {𝑥} = {𝑦})
2	1	cbvmptv 5213	. . . 4 ⊢ (𝑥 ∈ 𝐴 ↦ {𝑥}) = (𝑦 ∈ 𝐴 ↦ {𝑦})
3	2	eqcomi 2772	. . 3 ⊢ (𝑦 ∈ 𝐴 ↦ {𝑦}) = (𝑥 ∈ 𝐴 ↦ {𝑥})
4		mptsnun.r	. . 3 ⊢ 𝑅 = {𝑢 ∣ ∃𝑥 ∈ 𝐴 𝑢 = {𝑥}}
5	3, 4	mptsnunlem 38466	. 2 ⊢ (𝐵 ⊆ 𝐴 → 𝐵 = ∪ ((𝑦 ∈ 𝐴 ↦ {𝑦}) “ 𝐵))
6		mptsnun.f	. . . . 5 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ {𝑥})
7	6, 2	eqtri 2786	. . . 4 ⊢ 𝐹 = (𝑦 ∈ 𝐴 ↦ {𝑦})
8	7	imaeq1i 6062	. . 3 ⊢ (𝐹 “ 𝐵) = ((𝑦 ∈ 𝐴 ↦ {𝑦}) “ 𝐵)
9	8	unieqi 4882	. 2 ⊢ ∪ (𝐹 “ 𝐵) = ∪ ((𝑦 ∈ 𝐴 ↦ {𝑦}) “ 𝐵)
10	5, 9	eqtr4di 2816	1 ⊢ (𝐵 ⊆ 𝐴 → 𝐵 = ∪ (𝐹 “ 𝐵))

This proof depends on syntax axioms:   → wi 4   = wceq 1570  {cab 2741  ∃wrex 3090   ⊆ wss 3900  {csn 4588  ∪ cuni 4870   ↦ cmpt 5190   “ cima 5659

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 5253  ax-pr 5396

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-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  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 5172  df-mpt 5191  df-xp 5662  df-rel 5663  df-cnv 5664  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669

This theorem is used by:  dissneqlem  38468