| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > trssord | GIF version | ||
| Description: A transitive subclass of an ordinal class is ordinal. (Contributed by NM, 29-May-1994.) |
| Ref | Expression |
|---|---|
| trssord | ⊢ ((Tr 𝐴 ∧ 𝐴 ⊆ 𝐵 ∧ Ord 𝐵) → Ord 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dford3 4470 | . . . . . . 7 ⊢ (Ord 𝐵 ↔ (Tr 𝐵 ∧ ∀𝑥 ∈ 𝐵 Tr 𝑥)) | |
| 2 | 1 | simprbi 275 | . . . . . 6 ⊢ (Ord 𝐵 → ∀𝑥 ∈ 𝐵 Tr 𝑥) |
| 3 | ssralv 3292 | . . . . . 6 ⊢ (𝐴 ⊆ 𝐵 → (∀𝑥 ∈ 𝐵 Tr 𝑥 → ∀𝑥 ∈ 𝐴 Tr 𝑥)) | |
| 4 | 2, 3 | syl5 32 | . . . . 5 ⊢ (𝐴 ⊆ 𝐵 → (Ord 𝐵 → ∀𝑥 ∈ 𝐴 Tr 𝑥)) |
| 5 | 4 | imp 124 | . . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ Ord 𝐵) → ∀𝑥 ∈ 𝐴 Tr 𝑥) |
| 6 | 5 | anim2i 342 | . . 3 ⊢ ((Tr 𝐴 ∧ (𝐴 ⊆ 𝐵 ∧ Ord 𝐵)) → (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴 Tr 𝑥)) |
| 7 | 6 | 3impb 1226 | . 2 ⊢ ((Tr 𝐴 ∧ 𝐴 ⊆ 𝐵 ∧ Ord 𝐵) → (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴 Tr 𝑥)) |
| 8 | dford3 4470 | . 2 ⊢ (Ord 𝐴 ↔ (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴 Tr 𝑥)) | |
| 9 | 7, 8 | sylibr 134 | 1 ⊢ ((Tr 𝐴 ∧ 𝐴 ⊆ 𝐵 ∧ Ord 𝐵) → Ord 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1005 ∀wral 2511 ⊆ wss 3201 Tr wtr 4192 Ord word 4465 |
| 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-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-11 1555 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-nf 1510 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-ral 2516 df-in 3207 df-ss 3214 df-iord 4469 |
| This theorem is referenced by: ordelord 4484 ordin 4488 ssorduni 4591 ordtriexmidlem 4623 ordtri2or2exmidlem 4630 onsucelsucexmidlem 4633 ordsuc 4667 |
| Copyright terms: Public domain | W3C validator |