| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > onsssuc | Structured version Visualization version GIF version | ||
| Description: A subset of an ordinal number belongs to its successor. (Contributed by NM, 15-Sep-1995.) |
| Ref | Expression |
|---|---|
| onsssuc | ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 ↔ 𝐴 ∈ suc 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eloni 6320 | . 2 ⊢ (𝐵 ∈ On → Ord 𝐵) | |
| 2 | ordsssuc 6401 | . 2 ⊢ ((𝐴 ∈ On ∧ Ord 𝐵) → (𝐴 ⊆ 𝐵 ↔ 𝐴 ∈ suc 𝐵)) | |
| 3 | 1, 2 | sylan2 599 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 ↔ 𝐴 ∈ suc 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∈ wcel 2119 ⊆ wss 3883 Ord word 6309 Oncon0 6310 suc csuc 6312 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2711 ax-sep 5218 ax-pr 5362 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-ne 2935 df-ral 3054 df-rex 3064 df-rab 3392 df-v 3433 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-br 5073 df-opab 5135 df-tr 5180 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5571 df-we 5573 df-ord 6313 df-on 6314 df-suc 6316 |
| This theorem is referenced by: ordsssuc2 6403 onmindif 6404 tfindsg 7801 dfom2 7808 findsg 7837 ondif2 8427 oeeui 8528 cantnflem1 9601 rankr1bg 9718 rankr1c 9736 cofsmo 10182 cfsmolem 10183 cfcof 10187 fin1a2lem9 10321 alephreg 10496 winainflem 10607 n0bday 28362 bdaypw2n0bndlem 28473 bdayfinbndlem1 28477 fineqvnttrclselem2 35303 onsuct0 36669 onint1 36677 onintunirab 43672 cantnfresb 43769 oaun3lem4 43822 |
| Copyright terms: Public domain | W3C validator |