| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ordtri2or | Structured version Visualization version GIF version | ||
| Description: A trichotomy law for ordinal classes. (Contributed by NM, 13-Sep-2003.) (Proof shortened by Andrew Salmon, 12-Aug-2011.) |
| Ref | Expression |
|---|---|
| ordtri2or | ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 ∨ 𝐵 ⊆ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ordtri1 6391 | . . . 4 ⊢ ((Ord 𝐵 ∧ Ord 𝐴) → (𝐵 ⊆ 𝐴 ↔ ¬ 𝐴 ∈ 𝐵)) | |
| 2 | 1 | ancoms 464 | . . 3 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐵 ⊆ 𝐴 ↔ ¬ 𝐴 ∈ 𝐵)) |
| 3 | 2 | biimprd 251 | . 2 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (¬ 𝐴 ∈ 𝐵 → 𝐵 ⊆ 𝐴)) |
| 4 | 3 | orrd 877 | 1 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 ∨ 𝐵 ⊆ 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 ∈ wcel 2145 ⊆ wss 3899 Ord word 6356 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2732 ax-sep 5251 ax-pr 5398 |
| 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 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-tr 5213 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-ord 6360 |
| This theorem is used by: ordtri2or2 6459 ordunisuc2 7840 oaass 8548 alephdom 10084 iscard3 10096 noetasuplem4 27972 noetainflem4 27976 ltonold 28526 cantnfresb 44165 omabs2 44173 tfsconcat0b 44187 oaun3lem1 44215 |
| Copyright terms: Public domain | W3C validator |