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

Theorem ordsssucim 44403
Description: If an ordinal is less than or equal to the successor of another, then the first is either less than or equal to the second or the first is equal to the successor of the second. Theorem 1 in Grzegorz Bancerek, "Epsilon Numbers and Cantor Normal Form", Formalized Mathematics, Vol. 17, No. 4, Pages 249–256, 2009. DOI: 10.2478/v10037-009-0032-8 See also ordsssucb 44336 for a biimplication when 𝐴 is a set. (Contributed by RP, 3-Jan-2025.)
Assertion
Ref Expression
ordsssucim ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ⊆ suc 𝐵 → (𝐴 ⊆ 𝐵 ∨ 𝐴 = suc 𝐵)))

Proof of Theorem ordsssucim
StepHypRef Expression
1 ordsuc 7825 . . 3 (Ord 𝐵 ↔ Ord suc 𝐵)
2 ordsseleq 6392 . . 3 ((Ord 𝐴 ∧ Ord suc 𝐵) → (𝐴 ⊆ suc 𝐵 ↔ (𝐴 ∈ suc 𝐵 ∨ 𝐴 = suc 𝐵)))
31, 2sylan2b 606 . 2 ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ⊆ suc 𝐵 ↔ (𝐴 ∈ suc 𝐵 ∨ 𝐴 = suc 𝐵)))
4 simpr 490 . . . 4 ((Ord 𝐴 ∧ Ord 𝐵) → Ord 𝐵)
5 ordtr 6376 . . . 4 (Ord 𝐵 → Tr 𝐵)
6 trsucss 6453 . . . 4 (Tr 𝐵 → (𝐴 ∈ suc 𝐵 → 𝐴 ⊆ 𝐵))
74, 5, 63syl 19 . . 3 ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ∈ suc 𝐵 → 𝐴 ⊆ 𝐵))
87orim1d 981 . 2 ((Ord 𝐴 ∧ Ord 𝐵) → ((𝐴 ∈ suc 𝐵 ∨ 𝐴 = suc 𝐵) → (𝐴 ⊆ 𝐵 ∨ 𝐴 = suc 𝐵)))
93, 8sylbid 243 1 ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ⊆ suc 𝐵 → (𝐴 ⊆ 𝐵 ∨ 𝐴 = suc 𝐵)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2145   ⊆ wss 3899  Tr wtr 5212  Ord word 6361  suc csuc 6364
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-pr 5391
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 6365  df-on 6366  df-suc 6368
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator