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

Theorem dfom2 7689
Description: An alternate definition of the set of natural numbers ω. Definition 7.28 of [TakeutiZaring] p. 42, who use the symbol KI for the restricted class abstraction of non-limit ordinal numbers (see nlimon 7673). (Contributed by NM, 1-Nov-2004.)
Assertion
Ref Expression
dfom2 ω = {𝑥 ∈ On ∣ suc 𝑥 ⊆ {𝑦 ∈ On ∣ ¬ Lim 𝑦}}

Proof of Theorem dfom2
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 df-om 7688 . 2 ω = {𝑥 ∈ On ∣ ∀𝑧(Lim 𝑧𝑥𝑧)}
2 vex 3426 . . . . . . . . . . 11 𝑧 ∈ V
3 limelon 6314 . . . . . . . . . . 11 ((𝑧 ∈ V ∧ Lim 𝑧) → 𝑧 ∈ On)
42, 3mpan 686 . . . . . . . . . 10 (Lim 𝑧𝑧 ∈ On)
54pm4.71ri 560 . . . . . . . . 9 (Lim 𝑧 ↔ (𝑧 ∈ On ∧ Lim 𝑧))
65imbi1i 349 . . . . . . . 8 ((Lim 𝑧𝑥𝑧) ↔ ((𝑧 ∈ On ∧ Lim 𝑧) → 𝑥𝑧))
7 impexp 450 . . . . . . . 8 (((𝑧 ∈ On ∧ Lim 𝑧) → 𝑥𝑧) ↔ (𝑧 ∈ On → (Lim 𝑧𝑥𝑧)))
8 con34b 315 . . . . . . . . . 10 ((Lim 𝑧𝑥𝑧) ↔ (¬ 𝑥𝑧 → ¬ Lim 𝑧))
9 ibar 528 . . . . . . . . . . 11 (𝑧 ∈ On → (¬ Lim 𝑧 ↔ (𝑧 ∈ On ∧ ¬ Lim 𝑧)))
109imbi2d 340 . . . . . . . . . 10 (𝑧 ∈ On → ((¬ 𝑥𝑧 → ¬ Lim 𝑧) ↔ (¬ 𝑥𝑧 → (𝑧 ∈ On ∧ ¬ Lim 𝑧))))
118, 10syl5bb 282 . . . . . . . . 9 (𝑧 ∈ On → ((Lim 𝑧𝑥𝑧) ↔ (¬ 𝑥𝑧 → (𝑧 ∈ On ∧ ¬ Lim 𝑧))))
1211pm5.74i 270 . . . . . . . 8 ((𝑧 ∈ On → (Lim 𝑧𝑥𝑧)) ↔ (𝑧 ∈ On → (¬ 𝑥𝑧 → (𝑧 ∈ On ∧ ¬ Lim 𝑧))))
136, 7, 123bitri 296 . . . . . . 7 ((Lim 𝑧𝑥𝑧) ↔ (𝑧 ∈ On → (¬ 𝑥𝑧 → (𝑧 ∈ On ∧ ¬ Lim 𝑧))))
14 onsssuc 6338 . . . . . . . . . . 11 ((𝑧 ∈ On ∧ 𝑥 ∈ On) → (𝑧𝑥𝑧 ∈ suc 𝑥))
15 ontri1 6285 . . . . . . . . . . 11 ((𝑧 ∈ On ∧ 𝑥 ∈ On) → (𝑧𝑥 ↔ ¬ 𝑥𝑧))
1614, 15bitr3d 280 . . . . . . . . . 10 ((𝑧 ∈ On ∧ 𝑥 ∈ On) → (𝑧 ∈ suc 𝑥 ↔ ¬ 𝑥𝑧))
1716ancoms 458 . . . . . . . . 9 ((𝑥 ∈ On ∧ 𝑧 ∈ On) → (𝑧 ∈ suc 𝑥 ↔ ¬ 𝑥𝑧))
18 limeq 6263 . . . . . . . . . . . 12 (𝑦 = 𝑧 → (Lim 𝑦 ↔ Lim 𝑧))
1918notbid 317 . . . . . . . . . . 11 (𝑦 = 𝑧 → (¬ Lim 𝑦 ↔ ¬ Lim 𝑧))
2019elrab 3617 . . . . . . . . . 10 (𝑧 ∈ {𝑦 ∈ On ∣ ¬ Lim 𝑦} ↔ (𝑧 ∈ On ∧ ¬ Lim 𝑧))
2120a1i 11 . . . . . . . . 9 ((𝑥 ∈ On ∧ 𝑧 ∈ On) → (𝑧 ∈ {𝑦 ∈ On ∣ ¬ Lim 𝑦} ↔ (𝑧 ∈ On ∧ ¬ Lim 𝑧)))
2217, 21imbi12d 344 . . . . . . . 8 ((𝑥 ∈ On ∧ 𝑧 ∈ On) → ((𝑧 ∈ suc 𝑥𝑧 ∈ {𝑦 ∈ On ∣ ¬ Lim 𝑦}) ↔ (¬ 𝑥𝑧 → (𝑧 ∈ On ∧ ¬ Lim 𝑧))))
2322pm5.74da 800 . . . . . . 7 (𝑥 ∈ On → ((𝑧 ∈ On → (𝑧 ∈ suc 𝑥𝑧 ∈ {𝑦 ∈ On ∣ ¬ Lim 𝑦})) ↔ (𝑧 ∈ On → (¬ 𝑥𝑧 → (𝑧 ∈ On ∧ ¬ Lim 𝑧)))))
2413, 23bitr4id 289 . . . . . 6 (𝑥 ∈ On → ((Lim 𝑧𝑥𝑧) ↔ (𝑧 ∈ On → (𝑧 ∈ suc 𝑥𝑧 ∈ {𝑦 ∈ On ∣ ¬ Lim 𝑦}))))
25 impexp 450 . . . . . . 7 (((𝑧 ∈ On ∧ 𝑧 ∈ suc 𝑥) → 𝑧 ∈ {𝑦 ∈ On ∣ ¬ Lim 𝑦}) ↔ (𝑧 ∈ On → (𝑧 ∈ suc 𝑥𝑧 ∈ {𝑦 ∈ On ∣ ¬ Lim 𝑦})))
26 simpr 484 . . . . . . . . 9 ((𝑧 ∈ On ∧ 𝑧 ∈ suc 𝑥) → 𝑧 ∈ suc 𝑥)
27 suceloni 7635 . . . . . . . . . . 11 (𝑥 ∈ On → suc 𝑥 ∈ On)
28 onelon 6276 . . . . . . . . . . . 12 ((suc 𝑥 ∈ On ∧ 𝑧 ∈ suc 𝑥) → 𝑧 ∈ On)
2928ex 412 . . . . . . . . . . 11 (suc 𝑥 ∈ On → (𝑧 ∈ suc 𝑥𝑧 ∈ On))
3027, 29syl 17 . . . . . . . . . 10 (𝑥 ∈ On → (𝑧 ∈ suc 𝑥𝑧 ∈ On))
3130ancrd 551 . . . . . . . . 9 (𝑥 ∈ On → (𝑧 ∈ suc 𝑥 → (𝑧 ∈ On ∧ 𝑧 ∈ suc 𝑥)))
3226, 31impbid2 225 . . . . . . . 8 (𝑥 ∈ On → ((𝑧 ∈ On ∧ 𝑧 ∈ suc 𝑥) ↔ 𝑧 ∈ suc 𝑥))
3332imbi1d 341 . . . . . . 7 (𝑥 ∈ On → (((𝑧 ∈ On ∧ 𝑧 ∈ suc 𝑥) → 𝑧 ∈ {𝑦 ∈ On ∣ ¬ Lim 𝑦}) ↔ (𝑧 ∈ suc 𝑥𝑧 ∈ {𝑦 ∈ On ∣ ¬ Lim 𝑦})))
3425, 33bitr3id 284 . . . . . 6 (𝑥 ∈ On → ((𝑧 ∈ On → (𝑧 ∈ suc 𝑥𝑧 ∈ {𝑦 ∈ On ∣ ¬ Lim 𝑦})) ↔ (𝑧 ∈ suc 𝑥𝑧 ∈ {𝑦 ∈ On ∣ ¬ Lim 𝑦})))
3524, 34bitrd 278 . . . . 5 (𝑥 ∈ On → ((Lim 𝑧𝑥𝑧) ↔ (𝑧 ∈ suc 𝑥𝑧 ∈ {𝑦 ∈ On ∣ ¬ Lim 𝑦})))
3635albidv 1924 . . . 4 (𝑥 ∈ On → (∀𝑧(Lim 𝑧𝑥𝑧) ↔ ∀𝑧(𝑧 ∈ suc 𝑥𝑧 ∈ {𝑦 ∈ On ∣ ¬ Lim 𝑦})))
37 dfss2 3903 . . . 4 (suc 𝑥 ⊆ {𝑦 ∈ On ∣ ¬ Lim 𝑦} ↔ ∀𝑧(𝑧 ∈ suc 𝑥𝑧 ∈ {𝑦 ∈ On ∣ ¬ Lim 𝑦}))
3836, 37bitr4di 288 . . 3 (𝑥 ∈ On → (∀𝑧(Lim 𝑧𝑥𝑧) ↔ suc 𝑥 ⊆ {𝑦 ∈ On ∣ ¬ Lim 𝑦}))
3938rabbiia 3396 . 2 {𝑥 ∈ On ∣ ∀𝑧(Lim 𝑧𝑥𝑧)} = {𝑥 ∈ On ∣ suc 𝑥 ⊆ {𝑦 ∈ On ∣ ¬ Lim 𝑦}}
401, 39eqtri 2766 1 ω = {𝑥 ∈ On ∣ suc 𝑥 ⊆ {𝑦 ∈ On ∣ ¬ Lim 𝑦}}
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 395  wal 1537   = wceq 1539  wcel 2108  {crab 3067  Vcvv 3422  wss 3883  Oncon0 6251  Lim wlim 6252  suc csuc 6253  ωcom 7687
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-lim 6256  df-suc 6257  df-om 7688
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator