Theorem ordeq 4403

Description: Equality theorem for the ordinal predicate. (Contributed by NM, 17-Sep-1993.)

Assertion

Ref	Expression
ordeq	⊢ (𝐴 = 𝐵 → (Ord 𝐴 ↔ Ord 𝐵))

Proof of Theorem ordeq

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		treq 4133	. . 3 ⊢ (𝐴 = 𝐵 → (Tr 𝐴 ↔ Tr 𝐵))
2		raleq 2690	. . 3 ⊢ (𝐴 = 𝐵 → (∀𝑥 ∈ 𝐴 Tr 𝑥 ↔ ∀𝑥 ∈ 𝐵 Tr 𝑥))
3	1, 2	anbi12d 473	. 2 ⊢ (𝐴 = 𝐵 → ((Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴 Tr 𝑥) ↔ (Tr 𝐵 ∧ ∀𝑥 ∈ 𝐵 Tr 𝑥)))
4		dford3 4398	. 2 ⊢ (Ord 𝐴 ↔ (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴 Tr 𝑥))
5		dford3 4398	. 2 ⊢ (Ord 𝐵 ↔ (Tr 𝐵 ∧ ∀𝑥 ∈ 𝐵 Tr 𝑥))
6	3, 4, 5	3bitr4g 223	1 ⊢ (𝐴 = 𝐵 → (Ord 𝐴 ↔ Ord 𝐵))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1364  ∀wral 2472  Tr wtr 4127  Ord word 4393

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2175

This theorem depends on definitions:  df-bi 117  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-in 3159  df-ss 3166  df-uni 3836  df-tr 4128  df-iord 4397

This theorem is referenced by:  elong  4404  limeq  4408  ordelord  4412  ordtriexmidlem  4551  2ordpr  4556  issmo  6341  issmo2  6342  smoeq  6343  smores  6345  smores2  6347  smodm2  6348  smoiso  6355  tfrlem8  6371  tfri1dALT  6404