| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > onsseleq | Structured version Visualization version GIF version | ||
| Description: Relationship between subset and membership of an ordinal number. (Contributed by NM, 15-Sep-1995.) |
| Ref | Expression |
|---|---|
| onsseleq | ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eloni 6370 | . 2 ⊢ (𝐴 ∈ On → Ord 𝐴) | |
| 2 | eloni 6370 | . 2 ⊢ (𝐵 ∈ On → Ord 𝐵) | |
| 3 | ordsseleq 6390 | . 2 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ⊆ 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) | |
| 4 | 1, 2, 3 | syl2an 607 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∨ wo 860 = wceq 1570 ∈ wcel 2143 ⊆ wss 3905 Ord word 6359 Oncon0 6360 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5257 ax-pr 5404 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-opab 5174 df-tr 5219 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-ord 6363 df-on 6364 |
| This theorem is referenced by: onsseli 6483 on0eqel 6486 onmindif2 7802 omword 8551 oeword 8572 oewordi 8573 dffi3 9387 cantnflem1d 9653 cantnflem1 9654 r1ord3g 9747 alephdom 10061 cardaleph 10069 cfsmolem 10249 ttukeylem5 10492 alephreg 10562 inar1 10755 gruina 10798 om2uzlt2i 13983 nolt02o 27859 nogt01o 27860 nosupbnd2lem1 27879 noinfbnd2lem1 27894 madebday 28093 om2noseqlt2 28493 nmuladdss 36690 oege2 44034 ontric3g 44248 |
| Copyright terms: Public domain | W3C validator |