Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dflim7 Structured version   Visualization version   GIF version

Theorem dflim7 44259
Description: A limit ordinal is a nonzero ordinal that contains all the successors of its elements. Lemma 1.18 of [Schloeder] p. 2. Closely related to dflim4 7857. (Contributed by RP, 17-Jan-2025.)
Assertion
Ref Expression
dflim7 (Lim 𝐴 ↔ (Ord 𝐴 ∧ ∀𝑏 ∈ 𝐴 suc 𝑏 ∈ 𝐴 ∧ 𝐴 ≠ ∅))
Distinct variable group:   𝐴,𝑏

Proof of Theorem dflim7
StepHypRef Expression
1 dflim4 7857 . 2 (Lim 𝐴 ↔ (Ord 𝐴 ∧ ∅ ∈ 𝐴 ∧ ∀𝑏 ∈ 𝐴 suc 𝑏 ∈ 𝐴))
2 ord0eln0 6418 . . . . . 6 (Ord 𝐴 → (∅ ∈ 𝐴 ↔ 𝐴 ≠ ∅))
32anbi1d 643 . . . . 5 (Ord 𝐴 → ((∅ ∈ 𝐴 ∧ ∀𝑏 ∈ 𝐴 suc 𝑏 ∈ 𝐴) ↔ (𝐴 ≠ ∅ ∧ ∀𝑏 ∈ 𝐴 suc 𝑏 ∈ 𝐴)))
43biancomd 469 . . . 4 (Ord 𝐴 → ((∅ ∈ 𝐴 ∧ ∀𝑏 ∈ 𝐴 suc 𝑏 ∈ 𝐴) ↔ (∀𝑏 ∈ 𝐴 suc 𝑏 ∈ 𝐴 ∧ 𝐴 ≠ ∅)))
54pm5.32i 585 . . 3 ((Ord 𝐴 ∧ (∅ ∈ 𝐴 ∧ ∀𝑏 ∈ 𝐴 suc 𝑏 ∈ 𝐴)) ↔ (Ord 𝐴 ∧ (∀𝑏 ∈ 𝐴 suc 𝑏 ∈ 𝐴 ∧ 𝐴 ≠ ∅)))
6 3anass 1111 . . 3 ((Ord 𝐴 ∧ ∅ ∈ 𝐴 ∧ ∀𝑏 ∈ 𝐴 suc 𝑏 ∈ 𝐴) ↔ (Ord 𝐴 ∧ (∅ ∈ 𝐴 ∧ ∀𝑏 ∈ 𝐴 suc 𝑏 ∈ 𝐴)))
7 3anass 1111 . . 3 ((Ord 𝐴 ∧ ∀𝑏 ∈ 𝐴 suc 𝑏 ∈ 𝐴 ∧ 𝐴 ≠ ∅) ↔ (Ord 𝐴 ∧ (∀𝑏 ∈ 𝐴 suc 𝑏 ∈ 𝐴 ∧ 𝐴 ≠ ∅)))
85, 6, 73bitr4i 306 . 2 ((Ord 𝐴 ∧ ∅ ∈ 𝐴 ∧ ∀𝑏 ∈ 𝐴 suc 𝑏 ∈ 𝐴) ↔ (Ord 𝐴 ∧ ∀𝑏 ∈ 𝐴 suc 𝑏 ∈ 𝐴 ∧ 𝐴 ≠ ∅))
91, 8bitri 278 1 (Lim 𝐴 ↔ (Ord 𝐴 ∧ ∀𝑏 ∈ 𝐴 suc 𝑏 ∈ 𝐴 ∧ 𝐴 ≠ ∅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   ∈ wcel 2145   ≠ wne 2956  ∀wral 3077  ∅c0 4279  Ord word 6360  Lim wlim 6362  suc csuc 6363
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7749
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-tr 5213  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator