| 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 6502 | . 2 ⊢ Ord 𝐵 |
| 4 | ordelsuc 7865 | . 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 2147 ⊆ wss 3900 Ord word 6387 Oncon0 6388 suc csuc 6390 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 ax-sep 5255 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 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-tr 5219 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-ord 6391 df-on 6392 df-suc 6394 |
| This theorem is used by: omopthlem1 8706 rankval4b 9917 rankval4 9921 rankc1 9924 rankc2 9925 rankxplim 9933 rankxplim3 9935 cuteq1 28260 bdayiun 28358 bdayn0p1 28812 onsucsuccmpi 37446 |
| Copyright terms: Public domain | W3C validator |