| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ordtri3 | Structured version Visualization version GIF version | ||
| Description: A trichotomy law for ordinals. (Contributed by NM, 18-Oct-1995.) (Proof shortened by Andrew Salmon, 25-Jul-2011.) (Proof shortened by JJ, 24-Sep-2021.) |
| Ref | Expression |
|---|---|
| ordtri3 | ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 = 𝐵 ↔ ¬ (𝐴 ∈ 𝐵 ∨ 𝐵 ∈ 𝐴))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ordirr 6378 | . . . . . 6 ⊢ (Ord 𝐵 → ¬ 𝐵 ∈ 𝐵) | |
| 2 | 1 | adantl 486 | . . . . 5 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → ¬ 𝐵 ∈ 𝐵) |
| 3 | eleq2 2852 | . . . . . 6 ⊢ (𝐴 = 𝐵 → (𝐵 ∈ 𝐴 ↔ 𝐵 ∈ 𝐵)) | |
| 4 | 3 | notbid 321 | . . . . 5 ⊢ (𝐴 = 𝐵 → (¬ 𝐵 ∈ 𝐴 ↔ ¬ 𝐵 ∈ 𝐵)) |
| 5 | 2, 4 | syl5ibrcom 250 | . . . 4 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 = 𝐵 → ¬ 𝐵 ∈ 𝐴)) |
| 6 | 5 | pm4.71d 570 | . . 3 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 = 𝐵 ↔ (𝐴 = 𝐵 ∧ ¬ 𝐵 ∈ 𝐴))) |
| 7 | pm5.61 1016 | . . . 4 ⊢ (((𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴) ∧ ¬ 𝐵 ∈ 𝐴) ↔ (𝐴 = 𝐵 ∧ ¬ 𝐵 ∈ 𝐴)) | |
| 8 | pm4.52 1000 | . . . 4 ⊢ (((𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴) ∧ ¬ 𝐵 ∈ 𝐴) ↔ ¬ (¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴) ∨ 𝐵 ∈ 𝐴)) | |
| 9 | 7, 8 | bitr3i 280 | . . 3 ⊢ ((𝐴 = 𝐵 ∧ ¬ 𝐵 ∈ 𝐴) ↔ ¬ (¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴) ∨ 𝐵 ∈ 𝐴)) |
| 10 | 6, 9 | bitrdi 290 | . 2 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 = 𝐵 ↔ ¬ (¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴) ∨ 𝐵 ∈ 𝐴))) |
| 11 | ordtri2 6396 | . . . 4 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 ↔ ¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴))) | |
| 12 | 11 | orbi1d 929 | . . 3 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → ((𝐴 ∈ 𝐵 ∨ 𝐵 ∈ 𝐴) ↔ (¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴) ∨ 𝐵 ∈ 𝐴))) |
| 13 | 12 | notbid 321 | . 2 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (¬ (𝐴 ∈ 𝐵 ∨ 𝐵 ∈ 𝐴) ↔ ¬ (¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴) ∨ 𝐵 ∈ 𝐴))) |
| 14 | 10, 13 | bitr4d 285 | 1 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 = 𝐵 ↔ ¬ (𝐴 ∈ 𝐵 ∨ 𝐵 ∈ 𝐴))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∨ wo 860 = wceq 1570 ∈ wcel 2143 Ord word 6359 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5257 ax-pr 5404 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-opab 5174 df-tr 5219 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-ord 6363 |
| This theorem is referenced by: ordunisuc2 7836 tz7.48lem 8424 oacan 8529 omcan 8550 oecan 8571 omsmo 8640 omopthi 8643 inf3lem6 9598 cantnfp1lem3 9645 infpssrlem5 10286 fin23lem24 10301 isf32lem4 10335 om2uzf1oi 13985 om2noseqf1o 28494 mh-inf3f1 37072 ordnexbtwnsuc 44014 |
| Copyright terms: Public domain | W3C validator |