ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  onsucmin GIF version

Theorem onsucmin 4431
Description: The successor of an ordinal number is the smallest larger ordinal number. (Contributed by NM, 28-Nov-2003.)
Assertion
Ref Expression
onsucmin (𝐴 ∈ On → suc 𝐴 = {𝑥 ∈ On ∣ 𝐴𝑥})
Distinct variable group:   𝑥,𝐴

Proof of Theorem onsucmin
StepHypRef Expression
1 eloni 4305 . . . . 5 (𝑥 ∈ On → Ord 𝑥)
2 ordelsuc 4429 . . . . 5 ((𝐴 ∈ On ∧ Ord 𝑥) → (𝐴𝑥 ↔ suc 𝐴𝑥))
31, 2sylan2 284 . . . 4 ((𝐴 ∈ On ∧ 𝑥 ∈ On) → (𝐴𝑥 ↔ suc 𝐴𝑥))
43rabbidva 2677 . . 3 (𝐴 ∈ On → {𝑥 ∈ On ∣ 𝐴𝑥} = {𝑥 ∈ On ∣ suc 𝐴𝑥})
54inteqd 3784 . 2 (𝐴 ∈ On → {𝑥 ∈ On ∣ 𝐴𝑥} = {𝑥 ∈ On ∣ suc 𝐴𝑥})
6 sucelon 4427 . . 3 (𝐴 ∈ On ↔ suc 𝐴 ∈ On)
7 intmin 3799 . . 3 (suc 𝐴 ∈ On → {𝑥 ∈ On ∣ suc 𝐴𝑥} = suc 𝐴)
86, 7sylbi 120 . 2 (𝐴 ∈ On → {𝑥 ∈ On ∣ suc 𝐴𝑥} = suc 𝐴)
95, 8eqtr2d 2174 1 (𝐴 ∈ On → suc 𝐴 = {𝑥 ∈ On ∣ 𝐴𝑥})
Colors of variables: wff set class
Syntax hints:  wi 4  wb 104   = wceq 1332  wcel 1481  {crab 2421  wss 3076   cint 3779  Ord word 4292  Oncon0 4293  suc csuc 4295
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-pow 4106  ax-pr 4139  ax-un 4363
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-rab 2426  df-v 2691  df-un 3080  df-in 3082  df-ss 3089  df-pw 3517  df-sn 3538  df-pr 3539  df-uni 3745  df-int 3780  df-tr 4035  df-iord 4296  df-on 4298  df-suc 4301
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator