| 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 6396 | . 2 ⊢ (𝐴 ∈ On → Ord 𝐴) | |
| 2 | eloni 6396 | . 2 ⊢ (𝐵 ∈ On → Ord 𝐵) | |
| 3 | ordsseleq 6416 | . 2 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ⊆ 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) | |
| 4 | 1, 2, 3 | syl2an 608 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2147 ⊆ wss 3900 Ord word 6385 Oncon0 6386 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 ax-sep 5253 ax-pr 5396 |
| 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 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5172 df-tr 5217 df-eprel 5556 df-po 5564 df-so 5565 df-fr 5609 df-we 5611 df-ord 6389 df-on 6390 |
| This theorem is used by: onsseli 6509 on0eqel 6512 onmindif2 7853 omword 8614 oeword 8635 oewordi 8636 dffi3 9458 cantnflem1d 9724 cantnflem1 9725 r1ord3g 9821 alephdom 10197 cardaleph 10205 cfsmolem 10385 ttukeylem5 10628 alephreg 10704 inar1 10897 gruina 10940 om2uzlt2i 14132 nolt02o 28098 nogt01o 28099 nosupbnd2lem1 28118 noinfbnd2lem1 28133 madebday 28332 om2noseqlt2 28732 r0maxss 36037 nmuladdss 37170 oege2 44564 ontric3g 44778 |
| Copyright terms: Public domain | W3C validator |