| 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 6478 | . 2 ⊢ Ord 𝐵 |
| 4 | ordelsuc 7822 | . 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 2146 ⊆ wss 3906 Ord word 6363 Oncon0 6364 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: omopthlem1 8651 rankval4 9846 rankc1 9849 rankc2 9850 rankxplim 9858 rankxplim3 9860 cuteq1 28063 bdayiun 28161 bdayn0p1 28615 rankval4b 35553 onsucsuccmpi 37013 |
| Copyright terms: Public domain | W3C validator |