Theorem onexgt 41975

Description: For any ordinal, there is always a larger ordinal. (Contributed by RP, 1-Feb-2025.)

Assertion

Ref	Expression
onexgt	⊢ (𝐴 ∈ On → ∃𝑥 ∈ On 𝐴 ∈ 𝑥)

Distinct variable group:   𝑥,𝐴

Proof of Theorem onexgt

Step	Hyp	Ref	Expression
1		onsuc 7796	. 2 ⊢ (𝐴 ∈ On → suc 𝐴 ∈ On)
2		sucidg 6443	. 2 ⊢ (𝐴 ∈ On → 𝐴 ∈ suc 𝐴)
3		eleq2 2823	. . 3 ⊢ (𝑥 = suc 𝐴 → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ suc 𝐴))
4	3	rspcev 3613	. 2 ⊢ ((suc 𝐴 ∈ On ∧ 𝐴 ∈ suc 𝐴) → ∃𝑥 ∈ On 𝐴 ∈ 𝑥)
5	1, 2, 4	syl2anc 585	1 ⊢ (𝐴 ∈ On → ∃𝑥 ∈ On 𝐴 ∈ 𝑥)

Syntax hints:   → wi 4   ∈ wcel 2107  ∃wrex 3071  Oncon0 6362  suc csuc 6364

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-ext 2704  ax-sep 5299  ax-nul 5306  ax-pr 5427  ax-un 7722

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-ne 2942  df-ral 3063  df-rex 3072  df-rab 3434  df-v 3477  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-pss 3967  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-br 5149  df-opab 5211  df-tr 5266  df-eprel 5580  df-po 5588  df-so 5589  df-fr 5631  df-we 5633  df-ord 6365  df-on 6366  df-suc 6368

This theorem is referenced by: (None)