Theorem mptsnun 38101

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 4597	. . . . 5 ⊢ (𝑥 = 𝑦 → {𝑥} = {𝑦})
2	1	cbvmptv 5213	. . . 4 ⊢ (𝑥 ∈ 𝐴 ↦ {𝑥}) = (𝑦 ∈ 𝐴 ↦ {𝑦})
3	2	eqcomi 2771	. . 3 ⊢ (𝑦 ∈ 𝐴 ↦ {𝑦}) = (𝑥 ∈ 𝐴 ↦ {𝑥})
4		mptsnun.r	. . 3 ⊢ 𝑅 = {𝑢 ∣ ∃𝑥 ∈ 𝐴 𝑢 = {𝑥}}
5	3, 4	mptsnunlem 38100	. 2 ⊢ (𝐵 ⊆ 𝐴 → 𝐵 = ∪ ((𝑦 ∈ 𝐴 ↦ {𝑦}) “ 𝐵))
6		mptsnun.f	. . . . 5 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ {𝑥})
7	6, 2	eqtri 2785	. . . 4 ⊢ 𝐹 = (𝑦 ∈ 𝐴 ↦ {𝑦})
8	7	imaeq1i 6057	. . 3 ⊢ (𝐹 “ 𝐵) = ((𝑦 ∈ 𝐴 ↦ {𝑦}) “ 𝐵)
9	8	unieqi 4882	. 2 ⊢ ∪ (𝐹 “ 𝐵) = ∪ ((𝑦 ∈ 𝐴 ↦ {𝑦}) “ 𝐵)
10	5, 9	eqtr4di 2815	1 ⊢ (𝐵 ⊆ 𝐴 → 𝐵 = ∪ (𝐹 “ 𝐵))

This proof depends on syntax axioms:   → wi 4   = wceq 1570  {cab 2740  ∃wrex 3088   ⊆ wss 3902  {csn 4587  ∪ cuni 4870   ↦ cmpt 5190   “ cima 5662

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 2215  ax-ext 2734  ax-sep 5255  ax-pr 5402

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-xp 5665  df-rel 5666  df-cnv 5667  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672

This theorem is used by:  dissneqlem  38102