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 6195 | . 2 ⊢ (𝐵 ∈ On → Ord 𝐵) | |
2 | ordsssuc 6271 | . 2 ⊢ ((𝐴 ∈ On ∧ Ord 𝐵) → (𝐴 ⊆ 𝐵 ↔ 𝐴 ∈ suc 𝐵)) | |
3 | 1, 2 | sylan2 592 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 ↔ 𝐴 ∈ suc 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∈ wcel 2105 ⊆ wss 3935 Ord word 6184 Oncon0 6185 suc csuc 6187 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pr 5321 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3497 df-sbc 3772 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4466 df-sn 4560 df-pr 4562 df-op 4566 df-uni 4833 df-br 5059 df-opab 5121 df-tr 5165 df-eprel 5459 df-po 5468 df-so 5469 df-fr 5508 df-we 5510 df-ord 6188 df-on 6189 df-suc 6191 |
This theorem is referenced by: ordsssuc2 6273 onmindif 6274 tfindsg 7563 dfom2 7570 findsg 7597 ondif2 8118 oeeui 8218 cantnflem1 9141 rankr1bg 9221 rankr1c 9239 cofsmo 9680 cfsmolem 9681 cfcof 9685 fin1a2lem9 9819 alephreg 9993 winainflem 10104 onsuct0 33687 onint1 33695 |
Copyright terms: Public domain | W3C validator |