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 6204 | . 2 ⊢ (𝐵 ∈ On → Ord 𝐵) | |
2 | ordsssuc 6280 | . 2 ⊢ ((𝐴 ∈ On ∧ Ord 𝐵) → (𝐴 ⊆ 𝐵 ↔ 𝐴 ∈ suc 𝐵)) | |
3 | 1, 2 | sylan2 594 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 ↔ 𝐴 ∈ suc 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∈ wcel 2113 ⊆ wss 3939 Ord word 6193 Oncon0 6194 suc csuc 6196 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pr 5333 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-ral 3146 df-rex 3147 df-rab 3150 df-v 3499 df-sbc 3776 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-pss 3957 df-nul 4295 df-if 4471 df-sn 4571 df-pr 4573 df-op 4577 df-uni 4842 df-br 5070 df-opab 5132 df-tr 5176 df-eprel 5468 df-po 5477 df-so 5478 df-fr 5517 df-we 5519 df-ord 6197 df-on 6198 df-suc 6200 |
This theorem is referenced by: ordsssuc2 6282 onmindif 6283 tfindsg 7578 dfom2 7585 findsg 7612 ondif2 8130 oeeui 8231 cantnflem1 9155 rankr1bg 9235 rankr1c 9253 cofsmo 9694 cfsmolem 9695 cfcof 9699 fin1a2lem9 9833 alephreg 10007 winainflem 10118 onsuct0 33793 onint1 33801 |
Copyright terms: Public domain | W3C validator |