| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > onsseli | Structured version Visualization version GIF version | ||
| Description: Subset is equivalent to membership or equality for ordinal numbers. (Contributed by NM, 15-Sep-1995.) |
| Ref | Expression |
|---|---|
| on.1 | ⊢ 𝐴 ∈ On |
| on.2 | ⊢ 𝐵 ∈ On |
| Ref | Expression |
|---|---|
| onsseli | ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | on.1 | . 2 ⊢ 𝐴 ∈ On | |
| 2 | on.2 | . 2 ⊢ 𝐵 ∈ On | |
| 3 | onsseleq 6429 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) | |
| 4 | 1, 2, 3 | mp2an 705 | 1 ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∨ wo 861 = wceq 1572 ∈ wcel 2150 ⊆ wss 3899 Oncon0 6387 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-ext 2738 ax-sep 5254 ax-pr 5397 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-sb 2104 df-clab 2745 df-cleq 2758 df-clel 2842 df-ne 2963 df-ral 3084 df-rex 3094 df-rab 3416 df-v 3455 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-br 5108 df-opab 5173 df-tr 5218 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-we 5612 df-ord 6390 df-on 6391 |
| This theorem is used by: cardom 10105 tskcard 10904 onnolt 28711 bdayfinbndlem1 28912 rankse 35865 |
| Copyright terms: Public domain | W3C validator |