| Mathbox for Stefan O'Rear |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dford3 | Structured version Visualization version GIF version | ||
| Description: Ordinals are precisely the hereditarily transitive classes. Definition 1.2 of [Schloeder] p. 1. (Contributed by Stefan O'Rear, 28-Oct-2014.) |
| Ref | Expression |
|---|---|
| dford3 | ⊢ (Ord 𝑁 ↔ (Tr 𝑁 ∧ ∀𝑥 ∈ 𝑁 Tr 𝑥)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ordtr 6329 | . . 3 ⊢ (Ord 𝑁 → Tr 𝑁) | |
| 2 | ordelord 6337 | . . . . 5 ⊢ ((Ord 𝑁 ∧ 𝑥 ∈ 𝑁) → Ord 𝑥) | |
| 3 | ordtr 6329 | . . . . 5 ⊢ (Ord 𝑥 → Tr 𝑥) | |
| 4 | 2, 3 | syl 17 | . . . 4 ⊢ ((Ord 𝑁 ∧ 𝑥 ∈ 𝑁) → Tr 𝑥) |
| 5 | 4 | ralrimiva 3126 | . . 3 ⊢ (Ord 𝑁 → ∀𝑥 ∈ 𝑁 Tr 𝑥) |
| 6 | 1, 5 | jca 511 | . 2 ⊢ (Ord 𝑁 → (Tr 𝑁 ∧ ∀𝑥 ∈ 𝑁 Tr 𝑥)) |
| 7 | simpl 482 | . . 3 ⊢ ((Tr 𝑁 ∧ ∀𝑥 ∈ 𝑁 Tr 𝑥) → Tr 𝑁) | |
| 8 | dford3lem1 43210 | . . . . 5 ⊢ ((Tr 𝑁 ∧ ∀𝑥 ∈ 𝑁 Tr 𝑥) → ∀𝑎 ∈ 𝑁 (Tr 𝑎 ∧ ∀𝑥 ∈ 𝑎 Tr 𝑥)) | |
| 9 | dford3lem2 43211 | . . . . . 6 ⊢ ((Tr 𝑎 ∧ ∀𝑥 ∈ 𝑎 Tr 𝑥) → 𝑎 ∈ On) | |
| 10 | 9 | ralimi 3071 | . . . . 5 ⊢ (∀𝑎 ∈ 𝑁 (Tr 𝑎 ∧ ∀𝑥 ∈ 𝑎 Tr 𝑥) → ∀𝑎 ∈ 𝑁 𝑎 ∈ On) |
| 11 | 8, 10 | syl 17 | . . . 4 ⊢ ((Tr 𝑁 ∧ ∀𝑥 ∈ 𝑁 Tr 𝑥) → ∀𝑎 ∈ 𝑁 𝑎 ∈ On) |
| 12 | dfss3 3920 | . . . 4 ⊢ (𝑁 ⊆ On ↔ ∀𝑎 ∈ 𝑁 𝑎 ∈ On) | |
| 13 | 11, 12 | sylibr 234 | . . 3 ⊢ ((Tr 𝑁 ∧ ∀𝑥 ∈ 𝑁 Tr 𝑥) → 𝑁 ⊆ On) |
| 14 | ordon 7720 | . . . 4 ⊢ Ord On | |
| 15 | 14 | a1i 11 | . . 3 ⊢ ((Tr 𝑁 ∧ ∀𝑥 ∈ 𝑁 Tr 𝑥) → Ord On) |
| 16 | trssord 6332 | . . 3 ⊢ ((Tr 𝑁 ∧ 𝑁 ⊆ On ∧ Ord On) → Ord 𝑁) | |
| 17 | 7, 13, 15, 16 | syl3anc 1373 | . 2 ⊢ ((Tr 𝑁 ∧ ∀𝑥 ∈ 𝑁 Tr 𝑥) → Ord 𝑁) |
| 18 | 6, 17 | impbii 209 | 1 ⊢ (Ord 𝑁 ↔ (Tr 𝑁 ∧ ∀𝑥 ∈ 𝑁 Tr 𝑥)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 ∈ wcel 2113 ∀wral 3049 ⊆ wss 3899 Tr wtr 5203 Ord word 6314 Oncon0 6315 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pr 5375 ax-un 7678 ax-reg 9495 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-ral 3050 df-rex 3059 df-rab 3398 df-v 3440 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-br 5097 df-opab 5159 df-tr 5204 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-ord 6318 df-on 6319 df-suc 6321 |
| This theorem is referenced by: dford4 43213 |
| Copyright terms: Public domain | W3C validator |