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

Theorem ordeq 6367
Description: Equality theorem for the ordinal predicate. (Contributed by NM, 17-Sep-1993.)
Assertion
Ref Expression
ordeq (𝐴 = 𝐵 → (Ord 𝐴 ↔ Ord 𝐵))

Proof of Theorem ordeq
StepHypRef Expression
1 treq 5224 . . 3 (𝐴 = 𝐵 → (Tr 𝐴 ↔ Tr 𝐵))
2 weeq2 5648 . . 3 (𝐴 = 𝐵 → ( E We 𝐴 ↔ E We 𝐵))
31, 2anbi12d 643 . 2 (𝐴 = 𝐵 → ((Tr 𝐴 ∧ E We 𝐴) ↔ (Tr 𝐵 ∧ E We 𝐵)))
4 df-ord 6363 . 2 (Ord 𝐴 ↔ (Tr 𝐴 ∧ E We 𝐴))
5 df-ord 6363 . 2 (Ord 𝐵 ↔ (Tr 𝐵 ∧ E We 𝐵))
63, 4, 53bitr4g 317 1 (𝐴 = 𝐵 → (Ord 𝐴 ↔ Ord 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 400   = wceq 1569  Tr wtr 5217   E cep 5559   We wwe 5612  Ord word 6359
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734
This proof depends on definitions:  df-bi 210  df-an 401  df-tru 1572  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-v 3456  df-ss 3921  df-uni 4872  df-tr 5218  df-po 5568  df-so 5569  df-fr 5613  df-we 5615  df-ord 6363
This theorem is used by:  elong  6368  limeq  6372  ordelord  6382  ordun  6467  ordeleqon  7779  ordsuc  7808  ordzsl  7839  issmo  8333  issmo2  8334  smoeq  8335  smores  8337  smores2  8339  smodm2  8340  smoiso  8347  tfrlem8  8369  ord3  8467  ordtypelem5  9482  ordtypelem7  9484  oicl  9489  oieu  9499  fineqvnttrclse  35545  dfsucon  44277
  Copyright terms: Public domain W3C validator