| 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 44139 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 7816 | . . 3 ⊢ (Ord 𝐵 ↔ Ord suc 𝐵) | |
| 2 | ordsseleq 6394 | . . 3 ⊢ ((Ord 𝐴 ∧ Ord suc 𝐵) → (𝐴 ⊆ suc 𝐵 ↔ (𝐴 ∈ suc 𝐵 ∨ 𝐴 = suc 𝐵))) | |
| 3 | 1, 2 | sylan2b 606 | . 2 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ⊆ suc 𝐵 ↔ (𝐴 ∈ suc 𝐵 ∨ 𝐴 = suc 𝐵))) |
| 4 | simpr 490 | . . . 4 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → Ord 𝐵) | |
| 5 | ordtr 6378 | . . . 4 ⊢ (Ord 𝐵 → Tr 𝐵) | |
| 6 | trsucss 6455 | . . . 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 |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2146 ⊆ wss 3906 Tr wtr 5220 Ord word 6363 suc csuc 6366 |
| 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 2148 ax-9 2156 ax-ext 2737 ax-sep 5259 ax-pr 5406 |
| 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 2744 df-cleq 2757 df-clel 2840 df-ne 2961 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-tr 5221 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-ord 6367 df-on 6368 df-suc 6370 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |