Theorem bdcuni 17068

Description: The union of a setvar is a bounded class. (Contributed by BJ, 15-Oct-2019.)

Assertion

Ref	Expression
bdcuni	⊢ BOUNDED ∪ 𝑥

Proof of Theorem bdcuni

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

Step	Hyp	Ref	Expression
1		ax-bdel 17013	. . . . 5 ⊢ BOUNDED 𝑦 ∈ 𝑧
2	1	ax-bdex 17011	. . . 4 ⊢ BOUNDED ∃𝑧 ∈ 𝑥 𝑦 ∈ 𝑧
3	2	bdcab 17041	. . 3 ⊢ BOUNDED {𝑦 ∣ ∃𝑧 ∈ 𝑥 𝑦 ∈ 𝑧}
4		df-rex 2534	. . . . 5 ⊢ (∃𝑧 ∈ 𝑥 𝑦 ∈ 𝑧 ↔ ∃𝑧(𝑧 ∈ 𝑥 ∧ 𝑦 ∈ 𝑧))
5		exancom 1661	. . . . 5 ⊢ (∃𝑧(𝑧 ∈ 𝑥 ∧ 𝑦 ∈ 𝑧) ↔ ∃𝑧(𝑦 ∈ 𝑧 ∧ 𝑧 ∈ 𝑥))
6	4, 5	bitri 184	. . . 4 ⊢ (∃𝑧 ∈ 𝑥 𝑦 ∈ 𝑧 ↔ ∃𝑧(𝑦 ∈ 𝑧 ∧ 𝑧 ∈ 𝑥))
7	6	abbii 2354	. . 3 ⊢ {𝑦 ∣ ∃𝑧 ∈ 𝑥 𝑦 ∈ 𝑧} = {𝑦 ∣ ∃𝑧(𝑦 ∈ 𝑧 ∧ 𝑧 ∈ 𝑥)}
8	3, 7	bdceqi 17035	. 2 ⊢ BOUNDED {𝑦 ∣ ∃𝑧(𝑦 ∈ 𝑧 ∧ 𝑧 ∈ 𝑥)}
9		df-uni 3936	. 2 ⊢ ∪ 𝑥 = {𝑦 ∣ ∃𝑧(𝑦 ∈ 𝑧 ∧ 𝑧 ∈ 𝑥)}
10	8, 9	bdceqir 17036	1 ⊢ BOUNDED ∪ 𝑥

This proof depends on syntax axioms:   ∧ wa 104  ∃wex 1545  {cab 2224  ∃wrex 2529  ∪ cuni 3935  BOUNDED wbdc 17032

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-11 1559  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220  ax-bd0 17005  ax-bdex 17011  ax-bdel 17013  ax-bdsb 17014

This proof depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-rex 2534  df-uni 3936  df-bdc 17033

This theorem is used by: (None)