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

Theorem dfom2 7815
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 7798). (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 7814 . 2 ω = {𝑥 ∈ On ∣ ∀𝑧(Lim 𝑧𝑥𝑧)}
2 vex 3436 . . . . . . . . . . 11 𝑧 ∈ V
3 limelon 6382 . . . . . . . . . . 11 ((𝑧 ∈ V ∧ Lim 𝑧) → 𝑧 ∈ On)
42, 3mpan 696 . . . . . . . . . 10 (Lim 𝑧𝑧 ∈ On)
54pm4.71ri 565 . . . . . . . . 9 (Lim 𝑧 ↔ (𝑧 ∈ On ∧ Lim 𝑧))
65imbi1i 350 . . . . . . . 8 ((Lim 𝑧𝑥𝑧) ↔ ((𝑧 ∈ On ∧ Lim 𝑧) → 𝑥𝑧))
7 impexp 451 . . . . . . . 8 (((𝑧 ∈ On ∧ Lim 𝑧) → 𝑥𝑧) ↔ (𝑧 ∈ On → (Lim 𝑧𝑥𝑧)))
8 con34b 317 . . . . . . . . . 10 ((Lim 𝑧𝑥𝑧) ↔ (¬ 𝑥𝑧 → ¬ Lim 𝑧))
9 ibar 533 . . . . . . . . . . 11 (𝑧 ∈ On → (¬ Lim 𝑧 ↔ (𝑧 ∈ On ∧ ¬ Lim 𝑧)))
109imbi2d 341 . . . . . . . . . 10 (𝑧 ∈ On → ((¬ 𝑥𝑧 → ¬ Lim 𝑧) ↔ (¬ 𝑥𝑧 → (𝑧 ∈ On ∧ ¬ Lim 𝑧))))
118, 10bitrid 284 . . . . . . . . 9 (𝑧 ∈ On → ((Lim 𝑧𝑥𝑧) ↔ (¬ 𝑥𝑧 → (𝑧 ∈ On ∧ ¬ Lim 𝑧))))
1211pm5.74i 272 . . . . . . . 8 ((𝑧 ∈ On → (Lim 𝑧𝑥𝑧)) ↔ (𝑧 ∈ On → (¬ 𝑥𝑧 → (𝑧 ∈ On ∧ ¬ Lim 𝑧))))
136, 7, 123bitri 298 . . . . . . 7 ((Lim 𝑧𝑥𝑧) ↔ (𝑧 ∈ On → (¬ 𝑥𝑧 → (𝑧 ∈ On ∧ ¬ Lim 𝑧))))
14 onsssuc 6409 . . . . . . . . . . 11 ((𝑧 ∈ On ∧ 𝑥 ∈ On) → (𝑧𝑥𝑧 ∈ suc 𝑥))
15 ontri1 6351 . . . . . . . . . . 11 ((𝑧 ∈ On ∧ 𝑥 ∈ On) → (𝑧𝑥 ↔ ¬ 𝑥𝑧))
1614, 15bitr3d 282 . . . . . . . . . 10 ((𝑧 ∈ On ∧ 𝑥 ∈ On) → (𝑧 ∈ suc 𝑥 ↔ ¬ 𝑥𝑧))
1716ancoms 459 . . . . . . . . 9 ((𝑥 ∈ On ∧ 𝑧 ∈ On) → (𝑧 ∈ suc 𝑥 ↔ ¬ 𝑥𝑧))
18 limeq 6329 . . . . . . . . . . . 12 (𝑦 = 𝑧 → (Lim 𝑦 ↔ Lim 𝑧))
1918notbid 319 . . . . . . . . . . 11 (𝑦 = 𝑧 → (¬ Lim 𝑦 ↔ ¬ Lim 𝑧))
2019elrab 3636 . . . . . . . . . 10 (𝑧 ∈ {𝑦 ∈ On ∣ ¬ Lim 𝑦} ↔ (𝑧 ∈ On ∧ ¬ Lim 𝑧))
2120a1i 11 . . . . . . . . 9 ((𝑥 ∈ On ∧ 𝑧 ∈ On) → (𝑧 ∈ {𝑦 ∈ On ∣ ¬ Lim 𝑦} ↔ (𝑧 ∈ On ∧ ¬ Lim 𝑧)))
2217, 21imbi12d 345 . . . . . . . 8 ((𝑥 ∈ On ∧ 𝑧 ∈ On) → ((𝑧 ∈ suc 𝑥𝑧 ∈ {𝑦 ∈ On ∣ ¬ Lim 𝑦}) ↔ (¬ 𝑥𝑧 → (𝑧 ∈ On ∧ ¬ Lim 𝑧))))
2322pm5.74da 809 . . . . . . 7 (𝑥 ∈ On → ((𝑧 ∈ On → (𝑧 ∈ suc 𝑥𝑧 ∈ {𝑦 ∈ On ∣ ¬ Lim 𝑦})) ↔ (𝑧 ∈ On → (¬ 𝑥𝑧 → (𝑧 ∈ On ∧ ¬ Lim 𝑧)))))
2413, 23bitr4id 291 . . . . . 6 (𝑥 ∈ On → ((Lim 𝑧𝑥𝑧) ↔ (𝑧 ∈ On → (𝑧 ∈ suc 𝑥𝑧 ∈ {𝑦 ∈ On ∣ ¬ Lim 𝑦}))))
25 impexp 451 . . . . . . 7 (((𝑧 ∈ On ∧ 𝑧 ∈ suc 𝑥) → 𝑧 ∈ {𝑦 ∈ On ∣ ¬ Lim 𝑦}) ↔ (𝑧 ∈ On → (𝑧 ∈ suc 𝑥𝑧 ∈ {𝑦 ∈ On ∣ ¬ Lim 𝑦})))
26 simpr 485 . . . . . . . . 9 ((𝑧 ∈ On ∧ 𝑧 ∈ suc 𝑥) → 𝑧 ∈ suc 𝑥)
27 onsuc 7760 . . . . . . . . . . 11 (𝑥 ∈ On → suc 𝑥 ∈ On)
28 onelon 6342 . . . . . . . . . . . 12 ((suc 𝑥 ∈ On ∧ 𝑧 ∈ suc 𝑥) → 𝑧 ∈ On)
2928ex 413 . . . . . . . . . . 11 (suc 𝑥 ∈ On → (𝑧 ∈ suc 𝑥𝑧 ∈ On))
3027, 29syl 17 . . . . . . . . . 10 (𝑥 ∈ On → (𝑧 ∈ suc 𝑥𝑧 ∈ On))
3130ancrd 556 . . . . . . . . 9 (𝑥 ∈ On → (𝑧 ∈ suc 𝑥 → (𝑧 ∈ On ∧ 𝑧 ∈ suc 𝑥)))
3226, 31impbid2 227 . . . . . . . 8 (𝑥 ∈ On → ((𝑧 ∈ On ∧ 𝑧 ∈ suc 𝑥) ↔ 𝑧 ∈ suc 𝑥))
3332imbi1d 342 . . . . . . 7 (𝑥 ∈ On → (((𝑧 ∈ On ∧ 𝑧 ∈ suc 𝑥) → 𝑧 ∈ {𝑦 ∈ On ∣ ¬ Lim 𝑦}) ↔ (𝑧 ∈ suc 𝑥𝑧 ∈ {𝑦 ∈ On ∣ ¬ Lim 𝑦})))
3425, 33bitr3id 286 . . . . . 6 (𝑥 ∈ On → ((𝑧 ∈ On → (𝑧 ∈ suc 𝑥𝑧 ∈ {𝑦 ∈ On ∣ ¬ Lim 𝑦})) ↔ (𝑧 ∈ suc 𝑥𝑧 ∈ {𝑦 ∈ On ∣ ¬ Lim 𝑦})))
3524, 34bitrd 280 . . . . 5 (𝑥 ∈ On → ((Lim 𝑧𝑥𝑧) ↔ (𝑧 ∈ suc 𝑥𝑧 ∈ {𝑦 ∈ On ∣ ¬ Lim 𝑦})))
3635albidv 1927 . . . 4 (𝑥 ∈ On → (∀𝑧(Lim 𝑧𝑥𝑧) ↔ ∀𝑧(𝑧 ∈ suc 𝑥𝑧 ∈ {𝑦 ∈ On ∣ ¬ Lim 𝑦})))
37 df-ss 3907 . . . 4 (suc 𝑥 ⊆ {𝑦 ∈ On ∣ ¬ Lim 𝑦} ↔ ∀𝑧(𝑧 ∈ suc 𝑥𝑧 ∈ {𝑦 ∈ On ∣ ¬ Lim 𝑦}))
3836, 37bitr4di 290 . . 3 (𝑥 ∈ On → (∀𝑧(Lim 𝑧𝑥𝑧) ↔ suc 𝑥 ⊆ {𝑦 ∈ On ∣ ¬ Lim 𝑦}))
3938rabbiia 3396 . 2 {𝑥 ∈ On ∣ ∀𝑧(Lim 𝑧𝑥𝑧)} = {𝑥 ∈ On ∣ suc 𝑥 ⊆ {𝑦 ∈ On ∣ ¬ Lim 𝑦}}
401, 39eqtri 2763 1 ω = {𝑥 ∈ On ∣ suc 𝑥 ⊆ {𝑦 ∈ On ∣ ¬ Lim 𝑦}}
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 207  wa 396  wal 1545   = wceq 1547  wcel 2119  {crab 3392  Vcvv 3432  wss 3890  Oncon0 6317  Lim wlim 6318  suc csuc 6319  ωcom 7813
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2712  ax-sep 5225  ax-pr 5369  ax-un 7685
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2719  df-cleq 2732  df-clel 2815  df-ne 2936  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-br 5080  df-opab 5142  df-tr 5187  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-om 7814
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator