HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem ordeq 2982
Description: Equality theorem for the ordinal predicate.
Assertion
Ref Expression
ordeq |- (A = B -> (Ord A <-> Ord B))

Proof of Theorem ordeq
StepHypRef Expression
1 treq 2760 . . 3 |- (A = B -> (Tr A <-> Tr B))
2 weeq2 2965 . . 3 |- (A = B -> (E We A <-> E We B))
31, 2anbi12d 631 . 2 |- (A = B -> ((Tr A /\ E We A) <-> (Tr B /\ E We B)))
4 df-ord 2978 . 2 |- (Ord A <-> (Tr A /\ E We A))
5 df-ord 2978 . 2 |- (Ord B <-> (Tr B /\ E We B))
63, 4, 53bitr4g 558 1 |- (A = B -> (Ord A <-> Ord B))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 144   /\ wa 221   = wceq 992  Tr wtr 2754  Ecep 2908   We wwe 2946  Ord word 2974
This theorem is referenced by:  elong 2983  limeq 2987  ordelord 2997  ordun 3071  ordeleqon 3144  ordsuc 3171  ordzsl 3199  elom 3221  elomg 3222  tfrlem8 4219
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 998  ax-gen 999  ax-8 1000  ax-10 1002  ax-12 1004  ax-17 1007  ax-4 1009  ax-5o 1011  ax-6o 1014  ax-9o 1159  ax-10o 1177  ax-16 1247  ax-11o 1255  ax-ext 1500
This theorem depends on definitions:  df-bi 145  df-or 222  df-an 223  df-3an 783  df-ex 1017  df-sb 1209  df-clab 1506  df-cleq 1511  df-clel 1514  df-ral 1695  df-rex 1696  df-v 1858  df-dif 2101  df-un 2102  df-in 2103  df-ss 2105  df-nul 2333  df-sn 2470  df-pr 2471  df-op 2474  df-uni 2570  df-br 2693  df-tr 2755  df-po 2918  df-so 2929  df-fr 2947  df-we 2962  df-ord 2978
Copyright terms: Public domain