| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ordelsuc | Structured version Visualization version GIF version | ||
| Description: A set belongs to an ordinal iff its successor is a subset of the ordinal. Exercise 8 of [TakeutiZaring] p. 42 and its converse. (Contributed by NM, 29-Nov-2003.) |
| Ref | Expression |
|---|---|
| ordelsuc | ⊢ ((𝐴 ∈ 𝐶 ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 ↔ suc 𝐴 ⊆ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ordsucss 7820 | . . 3 ⊢ (Ord 𝐵 → (𝐴 ∈ 𝐵 → suc 𝐴 ⊆ 𝐵)) | |
| 2 | 1 | adantl 481 | . 2 ⊢ ((𝐴 ∈ 𝐶 ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 → suc 𝐴 ⊆ 𝐵)) |
| 3 | sucssel 6459 | . . 3 ⊢ (𝐴 ∈ 𝐶 → (suc 𝐴 ⊆ 𝐵 → 𝐴 ∈ 𝐵)) | |
| 4 | 3 | adantr 480 | . 2 ⊢ ((𝐴 ∈ 𝐶 ∧ Ord 𝐵) → (suc 𝐴 ⊆ 𝐵 → 𝐴 ∈ 𝐵)) |
| 5 | 2, 4 | impbid 212 | 1 ⊢ ((𝐴 ∈ 𝐶 ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 ↔ suc 𝐴 ⊆ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2107 ⊆ wss 3931 Ord word 6362 suc csuc 6365 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-ext 2706 ax-sep 5276 ax-nul 5286 ax-pr 5412 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-sb 2064 df-clab 2713 df-cleq 2726 df-clel 2808 df-ne 2932 df-ral 3051 df-rex 3060 df-rab 3420 df-v 3465 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-pss 3951 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4888 df-br 5124 df-opab 5186 df-tr 5240 df-eprel 5564 df-po 5572 df-so 5573 df-fr 5617 df-we 5619 df-ord 6366 df-on 6367 df-suc 6369 |
| This theorem is referenced by: onsucmin 7823 onsucssi 7844 tfindsg2 7865 ordgt0ge1 8513 onomeneqOLD 9248 cantnflem1 9711 ttrcltr 9738 dmttrcl 9743 r1ordg 9800 r1val1 9808 rankonidlem 9850 rankxplim3 9903 ordeldifsucon 43249 ordeldif1o 43250 oaltom 43395 omltoe 43397 |
| Copyright terms: Public domain | W3C validator |