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

Theorem orduniss2 7655
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 3072 . . . . 5 {𝑥 ∈ On ∣ 𝑥𝐴} = {𝑥 ∣ (𝑥 ∈ On ∧ 𝑥𝐴)}
2 incom 4131 . . . . . 6 ({𝑥𝑥 ∈ On} ∩ {𝑥𝑥𝐴}) = ({𝑥𝑥𝐴} ∩ {𝑥𝑥 ∈ On})
3 inab 4230 . . . . . 6 ({𝑥𝑥 ∈ On} ∩ {𝑥𝑥𝐴}) = {𝑥 ∣ (𝑥 ∈ On ∧ 𝑥𝐴)}
4 df-pw 4532 . . . . . . . 8 𝒫 𝐴 = {𝑥𝑥𝐴}
54eqcomi 2747 . . . . . . 7 {𝑥𝑥𝐴} = 𝒫 𝐴
6 abid2 2881 . . . . . . 7 {𝑥𝑥 ∈ On} = On
75, 6ineq12i 4141 . . . . . 6 ({𝑥𝑥𝐴} ∩ {𝑥𝑥 ∈ On}) = (𝒫 𝐴 ∩ On)
82, 3, 73eqtr3i 2774 . . . . 5 {𝑥 ∣ (𝑥 ∈ On ∧ 𝑥𝐴)} = (𝒫 𝐴 ∩ On)
91, 8eqtri 2766 . . . 4 {𝑥 ∈ On ∣ 𝑥𝐴} = (𝒫 𝐴 ∩ On)
10 ordpwsuc 7637 . . . 4 (Ord 𝐴 → (𝒫 𝐴 ∩ On) = suc 𝐴)
119, 10eqtrid 2790 . . 3 (Ord 𝐴 → {𝑥 ∈ On ∣ 𝑥𝐴} = suc 𝐴)
1211unieqd 4850 . 2 (Ord 𝐴 {𝑥 ∈ On ∣ 𝑥𝐴} = suc 𝐴)
13 ordunisuc 7654 . 2 (Ord 𝐴 suc 𝐴 = 𝐴)
1412, 13eqtrd 2778 1 (Ord 𝐴 {𝑥 ∈ On ∣ 𝑥𝐴} = 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1539  wcel 2108  {cab 2715  {crab 3067  cin 3882  wss 3883  𝒫 cpw 4530   cuni 4836  Ord word 6250  Oncon0 6251  suc csuc 6253
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-11 2156  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347  ax-un 7566
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-tr 5188  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-ord 6254  df-on 6255  df-suc 6257
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator