| 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 6471 | . 2 ⊢ Ord 𝐵 |
| 4 | ordelsuc 7817 | . 2 ⊢ ((𝐴 ∈ On ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 ↔ suc 𝐴 ⊆ 𝐵)) | |
| 5 | 1, 3, 4 | mp2an 705 | 1 ⊢ (𝐴 ∈ 𝐵 ↔ suc 𝐴 ⊆ 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∈ wcel 2145 ⊆ wss 3899 Ord word 6356 Oncon0 6357 suc csuc 6359 |
| 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 2732 ax-sep 5251 ax-pr 5398 |
| 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 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 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 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-ord 6360 df-on 6361 df-suc 6363 |
| This theorem is used by: omopthlem1 8648 rankval4 9850 rankc1 9853 rankc2 9854 rankxplim 9862 rankxplim3 9864 cuteq1 28083 bdayiun 28181 bdayn0p1 28635 rankval4b 35608 onsucsuccmpi 37063 |
| Copyright terms: Public domain | W3C validator |