Theorem onuniss2 4610

Description: The union of the ordinal subsets of an ordinal number is that number. (Contributed by Jim Kingdon, 2-Aug-2019.)

Assertion

Ref	Expression
onuniss2	⊢ (𝐴 ∈ On → ∪ {𝑥 ∈ On ∣ 𝑥 ⊆ 𝐴} = 𝐴)

Distinct variable group:   𝑥,𝐴

Proof of Theorem onuniss2

Step	Hyp	Ref	Expression
1		unimax 3927	1 ⊢ (𝐴 ∈ On → ∪ {𝑥 ∈ On ∣ 𝑥 ⊆ 𝐴} = 𝐴)

Syntax hints:   → wi 4   = wceq 1397   ∈ wcel 2202  {crab 2514   ⊆ wss 3200  ∪ cuni 3893  Oncon0 4460

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213

This theorem depends on definitions:  df-bi 117  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rab 2519  df-v 2804  df-in 3206  df-ss 3213  df-uni 3894

This theorem is referenced by: (None)