| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ordeq | 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 4235 | . . 3 ⊢ (𝐴 = 𝐵 → (Tr 𝐴 ↔ Tr 𝐵)) | |
| 2 | raleq 2749 | . . 3 ⊢ (𝐴 = 𝐵 → (∀𝑥 ∈ 𝐴 Tr 𝑥 ↔ ∀𝑥 ∈ 𝐵 Tr 𝑥)) | |
| 3 | 1, 2 | anbi12d 477 | . 2 ⊢ (𝐴 = 𝐵 → ((Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴 Tr 𝑥) ↔ (Tr 𝐵 ∧ ∀𝑥 ∈ 𝐵 Tr 𝑥))) |
| 4 | dford3 4512 | . 2 ⊢ (Ord 𝐴 ↔ (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴 Tr 𝑥)) | |
| 5 | dford3 4512 | . 2 ⊢ (Ord 𝐵 ↔ (Tr 𝐵 ∧ ∀𝑥 ∈ 𝐵 Tr 𝑥)) | |
| 6 | 3, 4, 5 | 3bitr4g 223 | 1 ⊢ (𝐴 = 𝐵 → (Ord 𝐴 ↔ Ord 𝐵)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1402 ∀wral 2528 Tr wtr 4229 Ord word 4507 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 |
| This proof depends on definitions: df-bi 117 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-in 3226 df-ss 3233 df-uni 3936 df-tr 4230 df-iord 4511 |
| This theorem is used by: elong 4518 limeq 4522 ordelord 4526 ordtriexmidlem 4666 2ordpr 4671 issmo 6559 issmo2 6560 smoeq 6561 smores 6563 smores2 6565 smodm2 6566 smoiso 6573 tfrlem8 6589 tfri1dALT 6622 |
| Copyright terms: Public domain | W3C validator |