Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  orduniss2 Structured version   Visualization version   GIF version

Theorem orduniss2 6925
 Description: The union of the ordinal subsets of an ordinal number is that number. (Contributed by NM, 30-Jan-2005.)
Assertion
Ref Expression
orduniss2 (Ord 𝐴 {𝑥 ∈ On ∣ 𝑥𝐴} = 𝐴)
Distinct variable group:   𝑥,𝐴

Proof of Theorem orduniss2
StepHypRef Expression
1 df-rab 2905 . . . . 5 {𝑥 ∈ On ∣ 𝑥𝐴} = {𝑥 ∣ (𝑥 ∈ On ∧ 𝑥𝐴)}
2 incom 3767 . . . . . 6 ({𝑥𝑥 ∈ On} ∩ {𝑥𝑥𝐴}) = ({𝑥𝑥𝐴} ∩ {𝑥𝑥 ∈ On})
3 inab 3854 . . . . . 6 ({𝑥𝑥 ∈ On} ∩ {𝑥𝑥𝐴}) = {𝑥 ∣ (𝑥 ∈ On ∧ 𝑥𝐴)}
4 df-pw 4110 . . . . . . . 8 𝒫 𝐴 = {𝑥𝑥𝐴}
54eqcomi 2619 . . . . . . 7 {𝑥𝑥𝐴} = 𝒫 𝐴
6 abid2 2732 . . . . . . 7 {𝑥𝑥 ∈ On} = On
75, 6ineq12i 3774 . . . . . 6 ({𝑥𝑥𝐴} ∩ {𝑥𝑥 ∈ On}) = (𝒫 𝐴 ∩ On)
82, 3, 73eqtr3i 2640 . . . . 5 {𝑥 ∣ (𝑥 ∈ On ∧ 𝑥𝐴)} = (𝒫 𝐴 ∩ On)
91, 8eqtri 2632 . . . 4 {𝑥 ∈ On ∣ 𝑥𝐴} = (𝒫 𝐴 ∩ On)
10 ordpwsuc 6907 . . . 4 (Ord 𝐴 → (𝒫 𝐴 ∩ On) = suc 𝐴)
119, 10syl5eq 2656 . . 3 (Ord 𝐴 → {𝑥 ∈ On ∣ 𝑥𝐴} = suc 𝐴)
1211unieqd 4382 . 2 (Ord 𝐴 {𝑥 ∈ On ∣ 𝑥𝐴} = suc 𝐴)
13 ordunisuc 6924 . 2 (Ord 𝐴 suc 𝐴 = 𝐴)
1412, 13eqtrd 2644 1 (Ord 𝐴 {𝑥 ∈ On ∣ 𝑥𝐴} = 𝐴)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977  {cab 2596  {crab 2900   ∩ cin 3539   ⊆ wss 3540  𝒫 cpw 4108  ∪ cuni 4372  Ord word 5639  Oncon0 5640  suc csuc 5642 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833  ax-un 6847 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-tr 4681  df-eprel 4949  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-ord 5643  df-on 5644  df-suc 5646 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator