Theorem onsucmin 4611

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

Step	Hyp	Ref	Expression
1		eloni 4478	. . . . 5 ⊢ (𝑥 ∈ On → Ord 𝑥)
2		ordelsuc 4609	. . . . 5 ⊢ ((𝐴 ∈ On ∧ Ord 𝑥) → (𝐴 ∈ 𝑥 ↔ suc 𝐴 ⊆ 𝑥))
3	1, 2	sylan2 286	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝑥 ∈ On) → (𝐴 ∈ 𝑥 ↔ suc 𝐴 ⊆ 𝑥))
4	3	rabbidva 2791	. . 3 ⊢ (𝐴 ∈ On → {𝑥 ∈ On ∣ 𝐴 ∈ 𝑥} = {𝑥 ∈ On ∣ suc 𝐴 ⊆ 𝑥})
5	4	inteqd 3938	. 2 ⊢ (𝐴 ∈ On → ∩ {𝑥 ∈ On ∣ 𝐴 ∈ 𝑥} = ∩ {𝑥 ∈ On ∣ suc 𝐴 ⊆ 𝑥})
6		onsucb 4607	. . 3 ⊢ (𝐴 ∈ On ↔ suc 𝐴 ∈ On)
7		intmin 3953	. . 3 ⊢ (suc 𝐴 ∈ On → ∩ {𝑥 ∈ On ∣ suc 𝐴 ⊆ 𝑥} = suc 𝐴)
8	6, 7	sylbi 121	. 2 ⊢ (𝐴 ∈ On → ∩ {𝑥 ∈ On ∣ suc 𝐴 ⊆ 𝑥} = suc 𝐴)
9	5, 8	eqtr2d 2265	1 ⊢ (𝐴 ∈ On → suc 𝐴 = ∩ {𝑥 ∈ On ∣ 𝐴 ∈ 𝑥})

Syntax hints:   → wi 4   ↔ wb 105   = wceq 1398   ∈ wcel 2202  {crab 2515   ⊆ wss 3201  ∩ cint 3933  Ord word 4465  Oncon0 4466  suc csuc 4468

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-rab 2520  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-uni 3899  df-int 3934  df-tr 4193  df-iord 4469  df-on 4471  df-suc 4474

This theorem is referenced by: (None)