![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ordtri1 | Structured version Visualization version GIF version |
Description: A trichotomy law for ordinals. (Contributed by NM, 25-Mar-1995.) (Proof shortened by Andrew Salmon, 25-Jul-2011.) |
Ref | Expression |
---|---|
ordtri1 | ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ⊆ 𝐵 ↔ ¬ 𝐵 ∈ 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ordsseleq 6058 | . 2 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ⊆ 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) | |
2 | ordn2lp 6049 | . . . . 5 ⊢ (Ord 𝐴 → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐴)) | |
3 | imnan 391 | . . . . 5 ⊢ ((𝐴 ∈ 𝐵 → ¬ 𝐵 ∈ 𝐴) ↔ ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐴)) | |
4 | 2, 3 | sylibr 226 | . . . 4 ⊢ (Ord 𝐴 → (𝐴 ∈ 𝐵 → ¬ 𝐵 ∈ 𝐴)) |
5 | ordirr 6047 | . . . . 5 ⊢ (Ord 𝐵 → ¬ 𝐵 ∈ 𝐵) | |
6 | eleq2 2855 | . . . . . 6 ⊢ (𝐴 = 𝐵 → (𝐵 ∈ 𝐴 ↔ 𝐵 ∈ 𝐵)) | |
7 | 6 | notbid 310 | . . . . 5 ⊢ (𝐴 = 𝐵 → (¬ 𝐵 ∈ 𝐴 ↔ ¬ 𝐵 ∈ 𝐵)) |
8 | 5, 7 | syl5ibrcom 239 | . . . 4 ⊢ (Ord 𝐵 → (𝐴 = 𝐵 → ¬ 𝐵 ∈ 𝐴)) |
9 | 4, 8 | jaao 937 | . . 3 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → ((𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵) → ¬ 𝐵 ∈ 𝐴)) |
10 | ordtri3or 6061 | . . . . . 6 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴)) | |
11 | df-3or 1069 | . . . . . 6 ⊢ ((𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴) ↔ ((𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵) ∨ 𝐵 ∈ 𝐴)) | |
12 | 10, 11 | sylib 210 | . . . . 5 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → ((𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵) ∨ 𝐵 ∈ 𝐴)) |
13 | 12 | orcomd 857 | . . . 4 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐵 ∈ 𝐴 ∨ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) |
14 | 13 | ord 850 | . . 3 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (¬ 𝐵 ∈ 𝐴 → (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) |
15 | 9, 14 | impbid 204 | . 2 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → ((𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵) ↔ ¬ 𝐵 ∈ 𝐴)) |
16 | 1, 15 | bitrd 271 | 1 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ⊆ 𝐵 ↔ ¬ 𝐵 ∈ 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 198 ∧ wa 387 ∨ wo 833 ∨ w3o 1067 = wceq 1507 ∈ wcel 2050 ⊆ wss 3830 Ord word 6028 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1758 ax-4 1772 ax-5 1869 ax-6 1928 ax-7 1965 ax-8 2052 ax-9 2059 ax-10 2079 ax-11 2093 ax-12 2106 ax-13 2301 ax-ext 2751 ax-sep 5060 ax-nul 5067 ax-pr 5186 |
This theorem depends on definitions: df-bi 199 df-an 388 df-or 834 df-3or 1069 df-3an 1070 df-tru 1510 df-ex 1743 df-nf 1747 df-sb 2016 df-mo 2547 df-eu 2584 df-clab 2760 df-cleq 2772 df-clel 2847 df-nfc 2919 df-ne 2969 df-ral 3094 df-rex 3095 df-rab 3098 df-v 3418 df-sbc 3683 df-dif 3833 df-un 3835 df-in 3837 df-ss 3844 df-pss 3846 df-nul 4180 df-if 4351 df-sn 4442 df-pr 4444 df-op 4448 df-uni 4713 df-br 4930 df-opab 4992 df-tr 5031 df-eprel 5317 df-po 5326 df-so 5327 df-fr 5366 df-we 5368 df-ord 6032 |
This theorem is referenced by: ontri1 6063 ordtri2 6064 ordtri4 6066 ordtr3 6074 ordintdif 6078 ordtri2or 6124 ordsucss 7349 ordsucsssuc 7354 ordsucuniel 7355 limsssuc 7381 ssnlim 7414 smoword 7807 tfrlem15 7832 nnaword 8054 nnawordex 8064 onomeneq 8503 nndomo 8507 isfinite2 8571 unfilem1 8577 wofib 8804 cantnflem1 8946 alephgeom 9302 alephdom2 9307 cflim2 9483 fin67 9615 winainflem 9913 finminlem 33184 |
Copyright terms: Public domain | W3C validator |