![]() |
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 6414 | . 2 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ⊆ 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) | |
2 | ordn2lp 6405 | . . . . 5 ⊢ (Ord 𝐴 → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐴)) | |
3 | imnan 399 | . . . . 5 ⊢ ((𝐴 ∈ 𝐵 → ¬ 𝐵 ∈ 𝐴) ↔ ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐴)) | |
4 | 2, 3 | sylibr 234 | . . . 4 ⊢ (Ord 𝐴 → (𝐴 ∈ 𝐵 → ¬ 𝐵 ∈ 𝐴)) |
5 | ordirr 6403 | . . . . 5 ⊢ (Ord 𝐵 → ¬ 𝐵 ∈ 𝐵) | |
6 | eleq2 2827 | . . . . . 6 ⊢ (𝐴 = 𝐵 → (𝐵 ∈ 𝐴 ↔ 𝐵 ∈ 𝐵)) | |
7 | 6 | notbid 318 | . . . . 5 ⊢ (𝐴 = 𝐵 → (¬ 𝐵 ∈ 𝐴 ↔ ¬ 𝐵 ∈ 𝐵)) |
8 | 5, 7 | syl5ibrcom 247 | . . . 4 ⊢ (Ord 𝐵 → (𝐴 = 𝐵 → ¬ 𝐵 ∈ 𝐴)) |
9 | 4, 8 | jaao 956 | . . 3 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → ((𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵) → ¬ 𝐵 ∈ 𝐴)) |
10 | ordtri3or 6417 | . . . . . 6 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴)) | |
11 | df-3or 1087 | . . . . . 6 ⊢ ((𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴) ↔ ((𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵) ∨ 𝐵 ∈ 𝐴)) | |
12 | 10, 11 | sylib 218 | . . . . 5 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → ((𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵) ∨ 𝐵 ∈ 𝐴)) |
13 | 12 | orcomd 871 | . . . 4 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐵 ∈ 𝐴 ∨ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) |
14 | 13 | ord 864 | . . 3 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (¬ 𝐵 ∈ 𝐴 → (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) |
15 | 9, 14 | impbid 212 | . 2 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → ((𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵) ↔ ¬ 𝐵 ∈ 𝐴)) |
16 | 1, 15 | bitrd 279 | 1 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ⊆ 𝐵 ↔ ¬ 𝐵 ∈ 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 ∨ w3o 1085 = wceq 1536 ∈ wcel 2105 ⊆ wss 3962 Ord word 6384 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1791 ax-4 1805 ax-5 1907 ax-6 1964 ax-7 2004 ax-8 2107 ax-9 2115 ax-ext 2705 ax-sep 5301 ax-nul 5311 ax-pr 5437 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1539 df-fal 1549 df-ex 1776 df-sb 2062 df-clab 2712 df-cleq 2726 df-clel 2813 df-ne 2938 df-ral 3059 df-rex 3068 df-rab 3433 df-v 3479 df-dif 3965 df-un 3967 df-in 3969 df-ss 3979 df-pss 3982 df-nul 4339 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4912 df-br 5148 df-opab 5210 df-tr 5265 df-eprel 5588 df-po 5596 df-so 5597 df-fr 5640 df-we 5642 df-ord 6388 |
This theorem is referenced by: ontri1 6419 ordtri2 6420 ordtri4 6422 ordtr3 6430 ordintdif 6435 ordtri2or 6483 ordsucss 7837 ordsucsssuc 7842 ordsucuniel 7843 limsssuc 7870 ssnlim 7906 smoword 8404 tfrlem15 8430 nnaword 8663 nnawordex 8673 eldifsucnn 8700 nndomog 9250 nndomogOLD 9260 onomeneq 9262 onomeneqOLD 9263 isfinite2 9331 unfilem1 9340 wofib 9582 cantnflem1 9726 ttrcltr 9753 dmttrcl 9758 alephgeom 10119 alephdom2 10124 cflim2 10300 fin67 10432 winainflem 10730 finminlem 36300 ordeldif 43247 ordeldifsucon 43248 ordeldif1o 43249 |
Copyright terms: Public domain | W3C validator |