![]() |
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 6400 | . . 3 ⊢ (Ord 𝑁 → Tr 𝑁) | |
2 | ordelord 6408 | . . . . 5 ⊢ ((Ord 𝑁 ∧ 𝑥 ∈ 𝑁) → Ord 𝑥) | |
3 | ordtr 6400 | . . . . 5 ⊢ (Ord 𝑥 → Tr 𝑥) | |
4 | 2, 3 | syl 17 | . . . 4 ⊢ ((Ord 𝑁 ∧ 𝑥 ∈ 𝑁) → Tr 𝑥) |
5 | 4 | ralrimiva 3144 | . . 3 ⊢ (Ord 𝑁 → ∀𝑥 ∈ 𝑁 Tr 𝑥) |
6 | 1, 5 | jca 511 | . 2 ⊢ (Ord 𝑁 → (Tr 𝑁 ∧ ∀𝑥 ∈ 𝑁 Tr 𝑥)) |
7 | simpl 482 | . . 3 ⊢ ((Tr 𝑁 ∧ ∀𝑥 ∈ 𝑁 Tr 𝑥) → Tr 𝑁) | |
8 | dford3lem1 43015 | . . . . 5 ⊢ ((Tr 𝑁 ∧ ∀𝑥 ∈ 𝑁 Tr 𝑥) → ∀𝑎 ∈ 𝑁 (Tr 𝑎 ∧ ∀𝑥 ∈ 𝑎 Tr 𝑥)) | |
9 | dford3lem2 43016 | . . . . . 6 ⊢ ((Tr 𝑎 ∧ ∀𝑥 ∈ 𝑎 Tr 𝑥) → 𝑎 ∈ On) | |
10 | 9 | ralimi 3081 | . . . . 5 ⊢ (∀𝑎 ∈ 𝑁 (Tr 𝑎 ∧ ∀𝑥 ∈ 𝑎 Tr 𝑥) → ∀𝑎 ∈ 𝑁 𝑎 ∈ On) |
11 | 8, 10 | syl 17 | . . . 4 ⊢ ((Tr 𝑁 ∧ ∀𝑥 ∈ 𝑁 Tr 𝑥) → ∀𝑎 ∈ 𝑁 𝑎 ∈ On) |
12 | dfss3 3984 | . . . 4 ⊢ (𝑁 ⊆ On ↔ ∀𝑎 ∈ 𝑁 𝑎 ∈ On) | |
13 | 11, 12 | sylibr 234 | . . 3 ⊢ ((Tr 𝑁 ∧ ∀𝑥 ∈ 𝑁 Tr 𝑥) → 𝑁 ⊆ On) |
14 | ordon 7796 | . . . 4 ⊢ Ord On | |
15 | 14 | a1i 11 | . . 3 ⊢ ((Tr 𝑁 ∧ ∀𝑥 ∈ 𝑁 Tr 𝑥) → Ord On) |
16 | trssord 6403 | . . 3 ⊢ ((Tr 𝑁 ∧ 𝑁 ⊆ On ∧ Ord On) → Ord 𝑁) | |
17 | 7, 13, 15, 16 | syl3anc 1370 | . 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 2106 ∀wral 3059 ⊆ wss 3963 Tr wtr 5265 Ord word 6385 Oncon0 6386 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pr 5438 ax-un 7754 ax-reg 9630 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-ral 3060 df-rex 3069 df-rab 3434 df-v 3480 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-br 5149 df-opab 5211 df-tr 5266 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-ord 6389 df-on 6390 df-suc 6392 |
This theorem is referenced by: dford4 43018 |
Copyright terms: Public domain | W3C validator |