| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > onsucssi | Structured version Visualization version GIF version | ||
| Description: A set belongs to an ordinal number iff its successor is a subset of the ordinal number. Exercise 8 of [TakeutiZaring] p. 42 and its converse. (Contributed by NM, 16-Sep-1995.) |
| Ref | Expression |
|---|---|
| onssi.1 | ⊢ 𝐴 ∈ On |
| onsucssi.2 | ⊢ 𝐵 ∈ On |
| Ref | Expression |
|---|---|
| onsucssi | ⊢ (𝐴 ∈ 𝐵 ↔ suc 𝐴 ⊆ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | onssi.1 | . 2 ⊢ 𝐴 ∈ On | |
| 2 | onsucssi.2 | . . 3 ⊢ 𝐵 ∈ On | |
| 3 | 2 | onordi 6459 | . 2 ⊢ Ord 𝐵 |
| 4 | ordelsuc 7800 | . 2 ⊢ ((𝐴 ∈ On ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 ↔ suc 𝐴 ⊆ 𝐵)) | |
| 5 | 1, 3, 4 | mp2an 702 | 1 ⊢ (𝐴 ∈ 𝐵 ↔ suc 𝐴 ⊆ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 208 ∈ wcel 2142 ⊆ wss 3904 Ord word 6345 Oncon0 6346 suc csuc 6348 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-ext 2734 ax-sep 5246 ax-pr 5390 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1099 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-sb 2091 df-clab 2741 df-cleq 2754 df-clel 2837 df-ne 2958 df-ral 3077 df-rex 3087 df-rab 3415 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-tr 5208 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-ord 6349 df-on 6350 df-suc 6352 |
| This theorem is referenced by: omopthlem1 8629 rankval4 9825 rankc1 9828 rankc2 9829 rankxplim 9837 rankxplim3 9839 cuteq1 27910 bdayiun 28008 bdayn0p1 28462 rankval4b 35396 onsucsuccmpi 36803 |
| Copyright terms: Public domain | W3C validator |