| Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > ordsssucim | Structured version Visualization version GIF version | ||
| 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 44082 for a biimplication when 𝐴 is a set. (Contributed by RP, 3-Jan-2025.) |
| Ref | Expression |
|---|---|
| ordsssucim | ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ⊆ suc 𝐵 → (𝐴 ⊆ 𝐵 ∨ 𝐴 = suc 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ordsuc 7806 | . . 3 ⊢ (Ord 𝐵 ↔ Ord suc 𝐵) | |
| 2 | ordsseleq 6390 | . . 3 ⊢ ((Ord 𝐴 ∧ Ord suc 𝐵) → (𝐴 ⊆ suc 𝐵 ↔ (𝐴 ∈ suc 𝐵 ∨ 𝐴 = suc 𝐵))) | |
| 3 | 1, 2 | sylan2b 605 | . 2 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ⊆ suc 𝐵 ↔ (𝐴 ∈ suc 𝐵 ∨ 𝐴 = suc 𝐵))) |
| 4 | simpr 489 | . . . 4 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → Ord 𝐵) | |
| 5 | ordtr 6374 | . . . 4 ⊢ (Ord 𝐵 → Tr 𝐵) | |
| 6 | trsucss 6451 | . . . 4 ⊢ (Tr 𝐵 → (𝐴 ∈ suc 𝐵 → 𝐴 ⊆ 𝐵)) | |
| 7 | 4, 5, 6 | 3syl 19 | . . 3 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ∈ suc 𝐵 → 𝐴 ⊆ 𝐵)) |
| 8 | 7 | orim1d 981 | . 2 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → ((𝐴 ∈ suc 𝐵 ∨ 𝐴 = suc 𝐵) → (𝐴 ⊆ 𝐵 ∨ 𝐴 = suc 𝐵))) |
| 9 | 3, 8 | sylbid 243 | 1 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ⊆ suc 𝐵 → (𝐴 ⊆ 𝐵 ∨ 𝐴 = suc 𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∨ wo 860 = wceq 1570 ∈ wcel 2143 ⊆ wss 3905 Tr wtr 5218 Ord word 6359 suc csuc 6362 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5257 ax-pr 5404 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-opab 5174 df-tr 5219 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-ord 6363 df-on 6364 df-suc 6366 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |