| 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 7796 | . . 3 ⊢ (Ord 𝐵 → (𝐴 ∈ 𝐵 → suc 𝐴 ⊆ 𝐵)) | |
| 2 | 1 | adantl 481 | . 2 ⊢ ((𝐴 ∈ 𝐶 ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 → suc 𝐴 ⊆ 𝐵)) |
| 3 | sucssel 6432 | . . 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 2109 ⊆ wss 3917 Ord word 6334 suc csuc 6337 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2702 ax-sep 5254 ax-nul 5264 ax-pr 5390 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2709 df-cleq 2722 df-clel 2804 df-ne 2927 df-ral 3046 df-rex 3055 df-rab 3409 df-v 3452 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-pss 3937 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-br 5111 df-opab 5173 df-tr 5218 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-we 5596 df-ord 6338 df-on 6339 df-suc 6341 |
| This theorem is referenced by: onsucmin 7799 onsucssi 7820 tfindsg2 7841 ordgt0ge1 8460 cantnflem1 9649 ttrcltr 9676 dmttrcl 9681 r1ordg 9738 r1val1 9746 rankonidlem 9788 rankxplim3 9841 ordeldifsucon 43255 ordeldif1o 43256 oaltom 43401 omltoe 43403 |
| Copyright terms: Public domain | W3C validator |