| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ordeq | Structured version Visualization version GIF version | ||
| Description: Equality theorem for the ordinal predicate. (Contributed by NM, 17-Sep-1993.) |
| Ref | Expression |
|---|---|
| ordeq | ⊢ (𝐴 = 𝐵 → (Ord 𝐴 ↔ Ord 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | treq 5222 | . . 3 ⊢ (𝐴 = 𝐵 → (Tr 𝐴 ↔ Tr 𝐵)) | |
| 2 | weeq2 5626 | . . 3 ⊢ (𝐴 = 𝐵 → ( E We 𝐴 ↔ E We 𝐵)) | |
| 3 | 1, 2 | anbi12d 632 | . 2 ⊢ (𝐴 = 𝐵 → ((Tr 𝐴 ∧ E We 𝐴) ↔ (Tr 𝐵 ∧ E We 𝐵))) |
| 4 | df-ord 6335 | . 2 ⊢ (Ord 𝐴 ↔ (Tr 𝐴 ∧ E We 𝐴)) | |
| 5 | df-ord 6335 | . 2 ⊢ (Ord 𝐵 ↔ (Tr 𝐵 ∧ E We 𝐵)) | |
| 6 | 3, 4, 5 | 3bitr4g 314 | 1 ⊢ (𝐴 = 𝐵 → (Ord 𝐴 ↔ Ord 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 Tr wtr 5214 E cep 5537 We wwe 5590 Ord word 6331 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2701 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1543 df-ex 1780 df-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-ral 3045 df-v 3449 df-ss 3931 df-uni 4872 df-tr 5215 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-ord 6335 |
| This theorem is referenced by: elong 6340 limeq 6344 ordelord 6354 ordun 6438 ordeleqon 7758 ordsuc 7788 ordsucOLD 7789 ordzsl 7821 issmo 8317 issmo2 8318 smoeq 8319 smores 8321 smores2 8323 smodm2 8324 smoiso 8331 tfrlem8 8352 ord3 8449 ordtypelem5 9475 ordtypelem7 9477 oicl 9482 oieu 9492 dfsucon 43512 |
| Copyright terms: Public domain | W3C validator |