Theorem dfmpt3 6620

Description: Alternate definition for the maps-to notation df-mpt 5177. (Contributed by Mario Carneiro, 30-Dec-2016.)

Assertion

Ref	Expression
dfmpt3	⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = ∪ 𝑥 ∈ 𝐴 ({𝑥} × {𝐵})

Proof of Theorem dfmpt3

Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-mpt 5177	. 2 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)}
2		velsn 4595	. . . . . . 7 ⊢ (𝑦 ∈ {𝐵} ↔ 𝑦 = 𝐵)
3	2	anbi2i 623	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ {𝐵}) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵))
4	3	anbi2i 623	. . . . 5 ⊢ ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ {𝐵})) ↔ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)))
5	4	2exbii 1849	. . . 4 ⊢ (∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ {𝐵})) ↔ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)))
6		eliunxp 5784	. . . 4 ⊢ (𝑧 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × {𝐵}) ↔ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ {𝐵})))
7		elopab 5474	. . . 4 ⊢ (𝑧 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} ↔ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)))
8	5, 6, 7	3bitr4i 303	. . 3 ⊢ (𝑧 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × {𝐵}) ↔ 𝑧 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)})
9	8	eqriv 2726	. 2 ⊢ ∪ 𝑥 ∈ 𝐴 ({𝑥} × {𝐵}) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)}
10	1, 9	eqtr4i 2755	1 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = ∪ 𝑥 ∈ 𝐴 ({𝑥} × {𝐵})

Syntax hints:   ∧ wa 395   = wceq 1540  ∃wex 1779   ∈ wcel 2109  {csn 4579  ⟨cop 4585  ∪ ciun 4944  {copab 5157   ↦ cmpt 5176   × cxp 5621

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 5238  ax-nul 5248  ax-pr 5374

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-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ral 3045  df-rex 3054  df-rab 3397  df-v 3440  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-ss 3922  df-nul 4287  df-if 4479  df-sn 4580  df-pr 4582  df-op 4586  df-iun 4946  df-opab 5158  df-mpt 5177  df-xp 5629  df-rel 5630

This theorem is referenced by:  dfmpt  7082  taylpfval  26289  indval2  32816