| 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 6374 | . . . 4 ⊢ ((Ord 𝐵 ∧ Ord 𝐴) → (𝐵 ⊆ 𝐴 ↔ ¬ 𝐴 ∈ 𝐵)) | |
| 2 | 1 | ancoms 462 | . . 3 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐵 ⊆ 𝐴 ↔ ¬ 𝐴 ∈ 𝐵)) |
| 3 | 2 | biimprd 250 | . 2 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (¬ 𝐴 ∈ 𝐵 → 𝐵 ⊆ 𝐴)) |
| 4 | 3 | orrd 874 | 1 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 ∨ 𝐵 ⊆ 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 399 ∨ wo 858 ∈ wcel 2141 ⊆ wss 3902 Ord word 6340 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 ax-sep 5243 ax-pr 5387 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-ne 2957 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-br 5098 df-opab 5160 df-tr 5205 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-we 5598 df-ord 6344 |
| This theorem is referenced by: ordtri2or2 6442 ordunisuc2 7819 oaass 8524 alephdom 10031 iscard3 10043 noetasuplem4 27788 noetainflem4 27792 ltonold 28342 cantnfresb 43862 omabs2 43870 tfsconcat0b 43884 oaun3lem1 43912 |
| Copyright terms: Public domain | W3C validator |