Theorem onuniss2 4639

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 3953	1 ⊢ (𝐴 ∈ On → ∪ {𝑥 ∈ On ∣ 𝑥 ⊆ 𝐴} = 𝐴)

Syntax hints:   → wi 4   = wceq 1398   ∈ wcel 2205  {crab 2526   ⊆ wss 3214  ∪ cuni 3919  Oncon0 4489

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2216

This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rab 2531  df-v 2817  df-in 3220  df-ss 3227  df-uni 3920

This theorem is referenced by: (None)