MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ordtri3 Structured version   Visualization version   GIF version

Theorem ordtri3 6287
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.)
Assertion
Ref Expression
ordtri3 ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 = 𝐵 ↔ ¬ (𝐴𝐵𝐵𝐴)))

Proof of Theorem ordtri3
StepHypRef Expression
1 ordirr 6269 . . . . . 6 (Ord 𝐵 → ¬ 𝐵𝐵)
21adantl 481 . . . . 5 ((Ord 𝐴 ∧ Ord 𝐵) → ¬ 𝐵𝐵)
3 eleq2 2827 . . . . . 6 (𝐴 = 𝐵 → (𝐵𝐴𝐵𝐵))
43notbid 317 . . . . 5 (𝐴 = 𝐵 → (¬ 𝐵𝐴 ↔ ¬ 𝐵𝐵))
52, 4syl5ibrcom 246 . . . 4 ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 = 𝐵 → ¬ 𝐵𝐴))
65pm4.71d 561 . . 3 ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 = 𝐵 ↔ (𝐴 = 𝐵 ∧ ¬ 𝐵𝐴)))
7 pm5.61 997 . . . 4 (((𝐴 = 𝐵𝐵𝐴) ∧ ¬ 𝐵𝐴) ↔ (𝐴 = 𝐵 ∧ ¬ 𝐵𝐴))
8 pm4.52 981 . . . 4 (((𝐴 = 𝐵𝐵𝐴) ∧ ¬ 𝐵𝐴) ↔ ¬ (¬ (𝐴 = 𝐵𝐵𝐴) ∨ 𝐵𝐴))
97, 8bitr3i 276 . . 3 ((𝐴 = 𝐵 ∧ ¬ 𝐵𝐴) ↔ ¬ (¬ (𝐴 = 𝐵𝐵𝐴) ∨ 𝐵𝐴))
106, 9bitrdi 286 . 2 ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 = 𝐵 ↔ ¬ (¬ (𝐴 = 𝐵𝐵𝐴) ∨ 𝐵𝐴)))
11 ordtri2 6286 . . . 4 ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴𝐵 ↔ ¬ (𝐴 = 𝐵𝐵𝐴)))
1211orbi1d 913 . . 3 ((Ord 𝐴 ∧ Ord 𝐵) → ((𝐴𝐵𝐵𝐴) ↔ (¬ (𝐴 = 𝐵𝐵𝐴) ∨ 𝐵𝐴)))
1312notbid 317 . 2 ((Ord 𝐴 ∧ Ord 𝐵) → (¬ (𝐴𝐵𝐵𝐴) ↔ ¬ (¬ (𝐴 = 𝐵𝐵𝐴) ∨ 𝐵𝐴)))
1410, 13bitr4d 281 1 ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 = 𝐵 ↔ ¬ (𝐴𝐵𝐵𝐴)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 395  wo 843   = wceq 1539  wcel 2108  Ord word 6250
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-11 2156  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-tr 5188  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-ord 6254
This theorem is referenced by:  ordunisuc2  7666  tz7.48lem  8242  oacan  8341  omcan  8362  oecan  8382  omsmo  8448  omopthi  8451  inf3lem6  9321  cantnfp1lem3  9368  infpssrlem5  9994  fin23lem24  10009  isf32lem4  10043  om2uzf1oi  13601
  Copyright terms: Public domain W3C validator